oj.uz

Submission #890895

# Submission time Handle Problem Language Result Execution time Memory
890895 2023-12-22T04:59:06 Z Sir_Ahmed_Imran Miners (IOI07_miners) C++17
84 / 100
 1500 ms 704 KB 
                              ///~~~LOTA~~~///
#include <bits/stdc++.h>
using namespace std;
#define nl '\n'
#define ff first
#define ss second
#define ll long long 
#define append push_back
#define pii pair<int,int>
#define all(x) (x).begin(),(x).end()
int dp[2][4][4][4][4];
set<int> x;
inline int c(int& n,int& m,int& o){
    if(n) x.insert(n);
    if(m) x.insert(m);
    if(o) x.insert(o);
    int z=x.size();
    x.clear();
    return z;
}
void solve(){
    char s;
    int n,m,o,p,q,r;
    cin>>n;
    map<pair<pii,pii>,bool> u,v;
    dp[0][0][0][0][0]=0;
    v[{{0,0},{0,0}}]=1;
    for(int i=0;i<n;i++){
        cin>>s;
        if(s=='M') m=1;
        if(s=='F') m=2;
        if(s=='B') m=3;
        for(int j=0;j<4;j++){
            for(int k=0;k<4;k++){
                for(int l=0;l<4;l++){
                    for(int t=0;t<4;t++){
                        if(!v[{{j,k},{l,t}}]) continue;
                        if(!u[{{k,m},{l,t}}]){
                            dp[(i+1)%2][k][m][l][t]=0;
                            u[{{k,m},{l,t}}]=1;    
                        }
                        dp[(i+1)%2][k][m][l][t]=max(dp[(i+1)%2][k][m][l][t]
                        ,dp[i%2][j][k][l][t]+c(j,k,m));
                        if(!u[{{j,k},{t,m}}]){
                            dp[(i+1)%2][j][k][t][m]=0;
                            u[{{j,k},{t,m}}]=1;    
                        }
                        dp[(i+1)%2][j][k][t][m]=max(dp[(i+1)%2][j][k][t][m]
                        ,dp[i%2][j][k][l][t]+c(l,t,m));
                    }
                }
            }
        }
        swap(v,u);
        u.clear();
    }
    for(int i=o=0;i<4;i++)
        for(int j=0;j<4;j++)
            for(int k=0;k<4;k++)
                for(int l=0;l<4;l++)
                    o=max(o,dp[n%2][i][j][k][l]);
    cout<<o;
}
int main(){
    solve();
    return 0;
}

Compilation message

miners.cpp: In function 'void solve()':
miners.cpp:23:15: warning: unused variable 'p' [-Wunused-variable]
   23 |     int n,m,o,p,q,r;
      |               ^
miners.cpp:23:17: warning: unused variable 'q' [-Wunused-variable]
   23 |     int n,m,o,p,q,r;
      |                 ^
miners.cpp:23:19: warning: unused variable 'r' [-Wunused-variable]
   23 |     int n,m,o,p,q,r;
      |                   ^

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 432 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct

Subtask #6
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct

Subtask #7
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 348 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 161 ms 344 KB Output is correct

Subtask #9
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 391 ms 348 KB Output is correct

Subtask #10
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1031 ms 704 KB Output is correct

Subtask #11
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1602 ms 692 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #12
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1550 ms 484 KB Time limit exceeded
2 Halted 0 ms 0 KB -