oj.uz

Submission #458383

# Submission time Handle Problem Language Result Execution time Memory
458383 2021-08-08T04:20:58 Z thomas_li Miners (IOI07_miners) C++17
84 / 100
 1500 ms 588 KB 
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pi;
const int MM = 1e5+5;
int n,dp[2][4][4][4][4][4][4],ans[4][4][4]; // add extra state for empty
int vals[MM][3],ptr = 0;
char mp[256];
int main(){
    cin.tie(0)->sync_with_stdio(0);
    cin >> n;
    string s; cin >> s; s = ' ' + s;
    memset(dp,-0x3f,sizeof dp);
    mp['M'] = 1;
    mp['F'] = 2;
    mp['B'] = 3;
    dp[0][0][0][0][0][0][0] = 0; 
    auto smax = [&](int& x, int y){
        x = max(x,y);
    };
    auto coal = [&](int x, int y, int z){
        set<int> s;
        if(x > 0) s.insert(x);
        if(y > 0) s.insert(y);
        if(z > 0) s.insert(z);
        ans[x][y][z] = (int)s.size();
    };
    for(int i = 0; i <= 3; i++){
        for(int j = 0; j <= 3; j++){
            for(int k = 0; k <= 3; k++){
                // if there are 0s, they must be a prefix
                if(i == 0 && k == 0 && !(j == 0)) continue;
                if(j == 0 && k == 0 && !(i == 0)) continue;
                if(k == 0 && !(j == 0) && !(i == 0)) continue;
                if(j == 0 && !(k == 0) && !(i == 0)) continue;
                vals[ptr][2] = k;
                vals[ptr][1] = j;
                vals[ptr++][0] = i;
                coal(i,j,k);
            }
        }
    }
    int res = 0,val;
    for(int i = 0; i < n; i++){
        int cur = i & 1, nxt = !cur;
        for(int j = 0; j < ptr; j++){
            for(int k = 0; k < ptr; k++){
                val = dp[cur][vals[j][0]][vals[j][1]][vals[j][2]][vals[k][0]][vals[k][1]][vals[k][2]]; 
                if(val < 0) continue;
                // add i+1 to a
                smax(dp[nxt][vals[j][1]][vals[j][2]][mp[s[i+1]]][vals[k][0]][vals[k][1]][vals[k][2]],val+ans[vals[j][1]][vals[j][2]][mp[s[i+1]]]);
                // add i+1 to b
                smax(dp[nxt][vals[j][0]][vals[j][1]][vals[j][2]][vals[k][1]][vals[k][2]][mp[s[i+1]]],val+ans[vals[k][1]][vals[k][2]][mp[s[i+1]]]);
                if(i+1 == n){
                    smax(res,dp[nxt][vals[j][1]][vals[j][2]][mp[s[i+1]]][vals[k][0]][vals[k][1]][vals[k][2]]);
                    smax(res,dp[nxt][vals[j][0]][vals[j][1]][vals[j][2]][vals[k][1]][vals[k][2]][mp[s[i+1]]]);
                }
            }
        }
        // prep cur row for next i
    }
    cout << res << "\n";
}

Compilation message

miners.cpp: In function 'int main()':
miners.cpp:53:63: warning: array subscript has type 'char' [-Wchar-subscripts]
   53 |                 smax(dp[nxt][vals[j][1]][vals[j][2]][mp[s[i+1]]][vals[k][0]][vals[k][1]][vals[k][2]],val+ans[vals[j][1]][vals[j][2]][mp[s[i+1]]]);
      |                                                               ^
miners.cpp:53:63: warning: array subscript has type 'char' [-Wchar-subscripts]
   53 |                 smax(dp[nxt][vals[j][1]][vals[j][2]][mp[s[i+1]]][vals[k][0]][vals[k][1]][vals[k][2]],val+ans[vals[j][1]][vals[j][2]][mp[s[i+1]]]);
      |                                                      ~~~~~~~~~^
miners.cpp:53:143: warning: array subscript has type 'char' [-Wchar-subscripts]
   53 |                 smax(dp[nxt][vals[j][1]][vals[j][2]][mp[s[i+1]]][vals[k][0]][vals[k][1]][vals[k][2]],val+ans[vals[j][1]][vals[j][2]][mp[s[i+1]]]);
      |                                                                                                                                               ^
miners.cpp:53:143: warning: array subscript has type 'char' [-Wchar-subscripts]
   53 |                 smax(dp[nxt][vals[j][1]][vals[j][2]][mp[s[i+1]]][vals[k][0]][vals[k][1]][vals[k][2]],val+ans[vals[j][1]][vals[j][2]][mp[s[i+1]]]);
      |                                                                                                                                      ~~~~~~~~~^
miners.cpp:55:99: warning: array subscript has type 'char' [-Wchar-subscripts]
   55 |                 smax(dp[nxt][vals[j][0]][vals[j][1]][vals[j][2]][vals[k][1]][vals[k][2]][mp[s[i+1]]],val+ans[vals[k][1]][vals[k][2]][mp[s[i+1]]]);
      |                                                                                                   ^
miners.cpp:55:99: warning: array subscript has type 'char' [-Wchar-subscripts]
   55 |                 smax(dp[nxt][vals[j][0]][vals[j][1]][vals[j][2]][vals[k][1]][vals[k][2]][mp[s[i+1]]],val+ans[vals[k][1]][vals[k][2]][mp[s[i+1]]]);
      |                                                                                          ~~~~~~~~~^
miners.cpp:55:143: warning: array subscript has type 'char' [-Wchar-subscripts]
   55 |                 smax(dp[nxt][vals[j][0]][vals[j][1]][vals[j][2]][vals[k][1]][vals[k][2]][mp[s[i+1]]],val+ans[vals[k][1]][vals[k][2]][mp[s[i+1]]]);
      |                                                                                                                                               ^
miners.cpp:55:143: warning: array subscript has type 'char' [-Wchar-subscripts]
   55 |                 smax(dp[nxt][vals[j][0]][vals[j][1]][vals[j][2]][vals[k][1]][vals[k][2]][mp[s[i+1]]],val+ans[vals[k][1]][vals[k][2]][mp[s[i+1]]]);
      |                                                                                                                                      ~~~~~~~~~^
miners.cpp:57:71: warning: array subscript has type 'char' [-Wchar-subscripts]
   57 |                     smax(res,dp[nxt][vals[j][1]][vals[j][2]][mp[s[i+1]]][vals[k][0]][vals[k][1]][vals[k][2]]);
      |                                                                       ^
miners.cpp:57:71: warning: array subscript has type 'char' [-Wchar-subscripts]
   57 |                     smax(res,dp[nxt][vals[j][1]][vals[j][2]][mp[s[i+1]]][vals[k][0]][vals[k][1]][vals[k][2]]);
      |                                                              ~~~~~~~~~^
miners.cpp:58:107: warning: array subscript has type 'char' [-Wchar-subscripts]
   58 |                     smax(res,dp[nxt][vals[j][0]][vals[j][1]][vals[j][2]][vals[k][1]][vals[k][2]][mp[s[i+1]]]);
      |                                                                                                           ^
miners.cpp:58:107: warning: array subscript has type 'char' [-Wchar-subscripts]
   58 |                     smax(res,dp[nxt][vals[j][0]][vals[j][1]][vals[j][2]][vals[k][1]][vals[k][2]][mp[s[i+1]]]);
      |                                                                                                  ~~~~~~~~~^

Subtask #1
9.0 / 9.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

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

Subtask #5
9.0 / 9.0

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

Subtask #6
7.0 / 7.0

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

Subtask #7
8.0 / 8.0

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

Subtask #8
8.0 / 8.0

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

Subtask #9
8.0 / 8.0

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

Subtask #10
8.0 / 8.0

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

Subtask #11
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1591 ms 584 KB Time limit exceeded

Subtask #12
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1578 ms 588 KB Time limit exceeded