Submission #1679914
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){t[i+1]=-1;}REP(i,25){scanf("%d",&x);if(x)t[x]=i;}p[0]=1;REP(i,1<<25){x=__builtin_popcount(i);REP(j,25){if(t[x]!=-1&t[x]!=j)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
2017-10-13 21:14:15+0900
Task
D - 25個の整数
User
omi
Language
C++14 (GCC 5.4.1)
Score
100
Code Size
438 Byte
Status
AC
Exec Time
4348 ms
Memory
131456 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:3:98: 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){t[i+1]=-1;}REP(i,25){scanf("%d",&x);if(x)t[x]=i;}p[0]=1;REP(i,1<<25){x=__builtin_popcount(i);REP(j,25){if(t[x]!=-1&t[x]!=j)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
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
3232 ms
131328 KB
sample-02.txt
AC
1326 ms
131328 KB
sample-03.txt
AC
1211 ms
131328 KB
sample-04.txt
AC
1133 ms
131200 KB
test-1-01.txt
AC
1969 ms
131328 KB
test-1-02.txt
AC
2650 ms
131328 KB
test-1-03.txt
AC
3224 ms
131328 KB
test-1-04.txt
AC
2295 ms
131328 KB
test-1-05.txt
AC
1306 ms
131328 KB
test-1-06.txt
AC
2891 ms
131328 KB
test-1-07.txt
AC
3071 ms
131328 KB
test-1-08.txt
AC
1774 ms
131328 KB
test-1-09.txt
AC
1953 ms
131328 KB
test-1-10.txt
AC
1140 ms
131328 KB
test-1-11.txt
AC
1691 ms
131328 KB
test-1-12.txt
AC
2119 ms
131328 KB
test-1-13.txt
AC
1185 ms
131328 KB
test-1-14.txt
AC
2000 ms
131328 KB
test-1-15.txt
AC
3201 ms
131328 KB
test-2-01.txt
AC
3508 ms
131328 KB
test-2-02.txt
AC
3026 ms
131328 KB
test-2-03.txt
AC
3052 ms
131328 KB
test-2-04.txt
AC
3182 ms
131328 KB
test-2-05.txt
AC
3713 ms
131328 KB
test-2-06.txt
AC
3838 ms
131328 KB
test-2-07.txt
AC
4166 ms
131328 KB
test-2-08.txt
AC
4277 ms
131328 KB
test-2-09.txt
AC
3526 ms
131456 KB
test-2-10.txt
AC
4348 ms
131328 KB