Submission #1679606
Source Code Expand
#include<bits/stdc++.h>
#define mod 1000000007
#define N 309
#define ad(x,y) (x=(x+(y))%mod)
using namespace std;
int n,m,fst[N],pnt[N],len[N],nxt[N],dp[N][N][N]; bool bo[N][N][N];
int main(){
scanf("%d%d",&n,&m);
int i,j,k,l,x,y;
for (i=1; i<=m; i++){
scanf("%d%d",&x,&y);
pnt[i]=x; nxt[i]=fst[y]; fst[y]=i;
scanf("%d",&len[i]);
}
for (i=0; i<=n; i++)
for (j=0; j<=n; j++)
for (k=0; k<=n; k++){
x=max(max(i,j),k);
for (l=fst[x]; l; l=nxt[l]){
y=pnt[l];
if ((i>=y)+(j>=y)+(k>=y)!=len[l]) break;
}
bo[i][j][k]=(!l);
}
dp[0][0][0]=1;
for (i=0; i<n; i++)
for (j=0; j<n; j++)
for (k=0; k<n; k++) if (dp[i][j][k] && bo[i][j][k]){
x=max(max(i,j),k);
ad(dp[x+1][j][k],dp[i][j][k]);
ad(dp[i][x+1][k],dp[i][j][k]);
ad(dp[i][j][x+1],dp[i][j][k]);
}
int ans=0;
for (i=0; i<=n; i++)
for (j=0; j<=n; j++)
for (k=0; k<=n; k++) if (i==n || j==n || k==n)
if (bo[i][j][k]) ad(ans,dp[i][j][k]);
printf("%d\n",ans);
return 0;
}
Submission Info
Submission Time
2017-10-13 17:13:28+0900
Task
E - RGB Sequence
User
lych_cys
Language
C++14 (GCC 5.4.1)
Score
800
Code Size
1036 Byte
Status
AC
Exec Time
512 ms
Memory
140544 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:9:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&n,&m);
^
./Main.cpp:12:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&x,&y);
^
./Main.cpp:14:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&len[i]);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
800 / 800
Status
Set Name
Test Cases
Sample
0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt
All
0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt
Case Name
Status
Exec Time
Memory
0_00.txt
AC
2 ms
2304 KB
0_01.txt
AC
2 ms
2304 KB
0_02.txt
AC
2 ms
2304 KB
0_03.txt
AC
3 ms
4352 KB
1_00.txt
AC
196 ms
97664 KB
1_01.txt
AC
159 ms
92672 KB
1_02.txt
AC
170 ms
92032 KB
1_03.txt
AC
195 ms
89984 KB
1_04.txt
AC
211 ms
97920 KB
1_05.txt
AC
163 ms
93952 KB
1_06.txt
AC
164 ms
92928 KB
1_07.txt
AC
153 ms
57600 KB
1_08.txt
AC
203 ms
97792 KB
1_09.txt
AC
168 ms
93184 KB
1_10.txt
AC
173 ms
108928 KB
1_11.txt
AC
150 ms
49408 KB
1_12.txt
AC
173 ms
95360 KB
1_13.txt
AC
170 ms
92672 KB
1_14.txt
AC
184 ms
115456 KB
1_15.txt
AC
213 ms
95104 KB
1_16.txt
AC
207 ms
100480 KB
1_17.txt
AC
164 ms
93568 KB
1_18.txt
AC
170 ms
99456 KB
1_19.txt
AC
161 ms
89216 KB
1_20.txt
AC
200 ms
97280 KB
1_21.txt
AC
174 ms
92672 KB
1_22.txt
AC
193 ms
113664 KB
1_23.txt
AC
209 ms
98816 KB
1_24.txt
AC
186 ms
97408 KB
1_25.txt
AC
175 ms
92928 KB
1_26.txt
AC
176 ms
104064 KB
1_27.txt
AC
165 ms
65792 KB
1_28.txt
AC
207 ms
91904 KB
1_29.txt
AC
180 ms
91776 KB
1_30.txt
AC
181 ms
99968 KB
1_31.txt
AC
194 ms
93056 KB
1_32.txt
AC
175 ms
91904 KB
1_33.txt
AC
180 ms
92032 KB
1_34.txt
AC
191 ms
100096 KB
1_35.txt
AC
189 ms
100352 KB
1_36.txt
AC
153 ms
89856 KB
1_37.txt
AC
183 ms
90112 KB
1_38.txt
AC
190 ms
97792 KB
1_39.txt
AC
180 ms
89088 KB
1_40.txt
AC
512 ms
140544 KB
1_41.txt
AC
208 ms
140416 KB
1_42.txt
AC
169 ms
89856 KB