Submission #1679925


Source Code Expand

#include <bits/stdc++.h>
#define REP(i,n) for (int i=0;i<(n);i++)
using namespace std;int x,p[1<<25],t[26];int main(){REP(i,25){scanf("%d",&x);if(x)t[x]=i+1;}p[0]=1;REP(i,1<<25){x=__builtin_popcount(i);REP(j,25){if(t[x]>0&t[x]!=j+1)continue;if(i&1<<j&&((j%5==0||j%5==4||!((1<<j-1&i)>0^((1<<j+1&i)>0)))&(j/5==0||j/5==4||!((1<<j-5&i)>0^(1<<j+5&i)>0)))){(p[i]+=p[i^(1<<j)])%=1000000007;}}}printf("%d\n",p[(1<<25)-1]);}

Submission Info

Submission Time
Task D - 25個の整数
User omi
Language C++14 (GCC 5.4.1)
Score 100
Code Size 419 Byte
Status AC
Exec Time 4333 ms
Memory 131328 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:3:77: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
 using namespace std;int x,p[1<<25],t[26];int main(){REP(i,25){scanf("%d",&x);if(x)t[x]=i+1;}p[0]=1;REP(i,1<<25){x=__builtin_popcount(i);REP(j,25){if(t[x]>0&t[x]!=j+1)continue;if(i&1<<j&&((j%5==0||j%5==4||!((1<<j-1&i)>0^((1<<j+1&i)>0)))&(j/5==0||j/5==4||!((1<<j-5&i)>0^(1<<j+5&i)>0)))){(p[i]+=p[i^(1<<j)])%=1000000007;}}}printf("%d\n",p[(1<<25)-1]);}
                                                                             ^

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 4
AC × 19
AC × 29
Set Name Test Cases
Sample sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt
Subtask1 sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt, test-1-01.txt, test-1-02.txt, test-1-03.txt, test-1-04.txt, test-1-05.txt, test-1-06.txt, test-1-07.txt, test-1-08.txt, test-1-09.txt, test-1-10.txt, test-1-11.txt, test-1-12.txt, test-1-13.txt, test-1-14.txt, test-1-15.txt
Subtask2 sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt, test-1-01.txt, test-1-02.txt, test-1-03.txt, test-1-04.txt, test-1-05.txt, test-1-06.txt, test-1-07.txt, test-1-08.txt, test-1-09.txt, test-1-10.txt, test-1-11.txt, test-1-12.txt, test-1-13.txt, test-1-14.txt, test-1-15.txt, test-2-01.txt, test-2-02.txt, test-2-03.txt, test-2-04.txt, test-2-05.txt, test-2-06.txt, test-2-07.txt, test-2-08.txt, test-2-09.txt, test-2-10.txt
Case Name Status Exec Time Memory
sample-01.txt AC 3215 ms 131328 KB
sample-02.txt AC 1304 ms 131328 KB
sample-03.txt AC 1197 ms 131328 KB
sample-04.txt AC 1116 ms 131200 KB
test-1-01.txt AC 1938 ms 131328 KB
test-1-02.txt AC 2655 ms 131328 KB
test-1-03.txt AC 3195 ms 131328 KB
test-1-04.txt AC 2269 ms 131328 KB
test-1-05.txt AC 1283 ms 131328 KB
test-1-06.txt AC 2889 ms 131328 KB
test-1-07.txt AC 3050 ms 131328 KB
test-1-08.txt AC 1756 ms 131328 KB
test-1-09.txt AC 1933 ms 131328 KB
test-1-10.txt AC 1130 ms 131328 KB
test-1-11.txt AC 1671 ms 131328 KB
test-1-12.txt AC 2101 ms 131328 KB
test-1-13.txt AC 1168 ms 131328 KB
test-1-14.txt AC 1996 ms 131328 KB
test-1-15.txt AC 3194 ms 131328 KB
test-2-01.txt AC 3501 ms 131328 KB
test-2-02.txt AC 3017 ms 131328 KB
test-2-03.txt AC 3031 ms 131328 KB
test-2-04.txt AC 3164 ms 131328 KB
test-2-05.txt AC 3693 ms 131328 KB
test-2-06.txt AC 3807 ms 131328 KB
test-2-07.txt AC 4139 ms 131328 KB
test-2-08.txt AC 4242 ms 131328 KB
test-2-09.txt AC 3501 ms 131328 KB
test-2-10.txt AC 4333 ms 131328 KB