# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
467949 | 2021-08-25T17:28:41 Z | RibljiKeksic | Dango Maker (JOI18_dango_maker) | C++14 | 3 ms | 476 KB |
#include <bits/stdc++.h> using namespace std; int n,m,DP[3010][3010][5],u; string s[3010],f; int main() { freopen("03-29.txt","r",stdin); ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n >> m; for(int i=0; i<n; i++) { cin >> f; s[i+1] += ' '; s[i+1] += f; } fclose(stdin); for(int i=1; i<=n; i++) { for(int j=1; j<=m; j++) { DP[i][j][0] = max(DP[i-1][j+1][0],max(DP[i-1][j+1][1],DP[i-1][j+1][2])); if(s[i][j]=='G') { if(s[i][j-1]=='R' && s[i][j+1]=='W') DP[i][j][1] = max(DP[i-1][j+1][0],DP[i-1][j+1][1]) + 1; if(s[i-1][j]=='R' && s[i+1][j]=='W') DP[i][j][2] = max(DP[i-1][j+1][0],DP[i-1][j+1][2]) + 1; } if(j==1) { u += max(DP[i][j][0],max(DP[i][j][1],DP[i][j][2])); } else { if(i==n) { u += max(DP[i][j][0],max(DP[i][j][1],DP[i][j][2])); } } } } cout << u <<endl; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 460 KB | Output is correct |
2 | Correct | 2 ms | 460 KB | Output is correct |
3 | Correct | 2 ms | 460 KB | Output is correct |
4 | Correct | 2 ms | 460 KB | Output is correct |
5 | Correct | 3 ms | 460 KB | Output is correct |
6 | Incorrect | 2 ms | 476 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 460 KB | Output is correct |
2 | Correct | 2 ms | 460 KB | Output is correct |
3 | Correct | 2 ms | 460 KB | Output is correct |
4 | Correct | 2 ms | 460 KB | Output is correct |
5 | Correct | 3 ms | 460 KB | Output is correct |
6 | Incorrect | 2 ms | 476 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 460 KB | Output is correct |
2 | Correct | 2 ms | 460 KB | Output is correct |
3 | Correct | 2 ms | 460 KB | Output is correct |
4 | Correct | 2 ms | 460 KB | Output is correct |
5 | Correct | 3 ms | 460 KB | Output is correct |
6 | Incorrect | 2 ms | 476 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |