# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
787446 | 2023-07-19T08:01:10 Z | guagua0407 | Dango Maker (JOI18_dango_maker) | C++17 | 5 ms | 9172 KB |
//#pragma GCC optimize("O3") #include <bits/stdc++.h> using namespace std; #define ll long long #define pii pair<int,int> #define f first #define s second #define all(x) x.begin(),x.end() #define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); void setIO(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); } const int mxn=3010; char grid[mxn][mxn]; int dp[mxn][mxn][3]; int main() {_ int n,m; cin>>n>>m; for(int i=0;i<mxn;i++){ fill(grid[i],grid[i]+mxn,'.'); } for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ cin>>grid[i][j]; } } for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ if(grid[i-1][j]=='R' and grid[i][j]=='G' and grid[i+1][j]=='W'){ dp[i][j][0]=1; } if(grid[i][j-1]=='R' and grid[i][j]=='G' and grid[i][j+1]=='W'){ dp[i][j][1]=1; } } } int ans=0; for(int gap=-(m-1);gap<n;gap++){ int x,y; for(int i=1;i<=n;i++){ int j=i-gap; if(j<1 or j>m) continue; dp[i][j][0]+=max(dp[i-1][j-1][0],dp[i-1][j-1][2]); dp[i][j][1]+=max(dp[i-1][j-1][1],dp[i-1][j-1][2]); dp[i][j][2]+=max({dp[i-1][j-1][0],dp[i-1][j-1][1],dp[i-1][j-1][2]}); x=i,y=j; } ans+=max({dp[x][y][0],dp[x][y][1],dp[x][y][2]}); } cout<<ans<<'\n'; return 0; } //maybe its multiset not set
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 9172 KB | Output is correct |
2 | Correct | 4 ms | 9172 KB | Output is correct |
3 | Correct | 4 ms | 9160 KB | Output is correct |
4 | Correct | 5 ms | 9108 KB | Output is correct |
5 | Correct | 5 ms | 9172 KB | Output is correct |
6 | Incorrect | 4 ms | 9132 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 9172 KB | Output is correct |
2 | Correct | 4 ms | 9172 KB | Output is correct |
3 | Correct | 4 ms | 9160 KB | Output is correct |
4 | Correct | 5 ms | 9108 KB | Output is correct |
5 | Correct | 5 ms | 9172 KB | Output is correct |
6 | Incorrect | 4 ms | 9132 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 9172 KB | Output is correct |
2 | Correct | 4 ms | 9172 KB | Output is correct |
3 | Correct | 4 ms | 9160 KB | Output is correct |
4 | Correct | 5 ms | 9108 KB | Output is correct |
5 | Correct | 5 ms | 9172 KB | Output is correct |
6 | Incorrect | 4 ms | 9132 KB | Output isn't correct |
7 | Halted | 0 ms | 0 KB | - |