# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
197567 | 2020-01-21T17:15:58 Z | Peacher29 | Miners (IOI07_miners) | C++14 | 268 ms | 125572 KB |
#include<bits/stdc++.h> using namespace std; int val(int a, int b, int c){ int db=0; for(int i=1;i<=3;i++){ if(a==i || b==i || c==i){ ++db; } } return db; } int dp[100001][4][4][4][4]; bool reach[100001][4][4][4][4]; int main(){ int n; char c; cin >> n; int mx=0; reach[0][0][0][0][0]=1; for(int i=1;i<=n;i++){ cin >> c; int mi; if(c=='M') mi = 1; if(c=='B') mi = 2; if(c=='F') mi = 3; for(int a=0;a<4;a++){ for(int b=0;b<4;b++){ for(int c=0;c<4;c++){ for(int d=0;d<4;d++){ if(reach[i-1][a][b][c][d]){ reach[i][mi][a][c][d] = 1; reach[i][a][b][mi][c] = 1; dp[i][mi][a][c][d]=max(dp[i-1][a][b][c][d]+val(mi,a,b),dp[i][mi][a][c][d]); mx=max(mx,dp[i][mi][a][c][d]); dp[i][a][b][mi][c]=max(dp[i-1][a][b][c][d]+val(mi,c,d),dp[i][a][b][mi][c]); mx=max(mx,dp[i][a][b][mi][c]); } } } } } } cout << mx; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 380 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 380 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 1656 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 13 ms | 6588 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 28 ms | 12896 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 75 ms | 31580 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 180 ms | 94280 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 268 ms | 125572 KB | Output is correct |