oj.uz

Submission #199840

# Submission time Handle Problem Language Result Execution time Memory
199840 2020-02-03T15:48:58 Z Mercenary Miners (IOI07_miners) C++14
100 / 100
 173 ms 100908 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>

#define pb push_back
#define mp make_pair
#define taskname "A"

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef tree <int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;

const int maxn = 1e5 + 5;
int n;
string s;
int dp[maxn][16][16];
int cnt[2][4];

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    if(fopen(taskname".INP","r")){
		freopen(taskname".INP", "r",stdin);
		freopen(taskname".OUT", "w",stdout);
    }
    cin >> n >> s;
    for(int i = 0 ; i < n ; ++i){
        if(s[i] == 'M')s[i] = 1;
        else if(s[i] == 'F')s[i] = 2;
        else s[i] = 3;
    }
    memset(dp,-123,sizeof dp);
    dp[0][0][0] = 0;
    int res = 0;
    for(int i = 0 ; i <= n ; ++i){
        for(int j = 0 ; j < 16 ; ++j){
            for(int k = 0 ; k < 16 ; ++k){
                if(dp[i][j][k] >= 0){
                    if(i == n){
                        res = max(res,dp[i][j][k]);
                        continue;
                    }
                    memset(cnt,0,sizeof cnt);
                    cnt[0][j & 3]++;
                    cnt[0][(j >> 2) & 3]++;
                    cnt[1][k & 3]++;
                    cnt[1][(k >> 2) & 3]++;
                    int cal[2] = {0,0};
                    cnt[0][s[i]]++;cnt[1][s[i]]++;
                    for(int t = 1 ; t <= 3 ; ++t){
                        if(cnt[0][t])cal[0]++;
                        if(cnt[1][t])cal[1]++;
                    }
                    int cur = (j >> 2) | ((int)s[i] << 2);
                    dp[i + 1][cur][k] = max(dp[i + 1][cur][k],dp[i][j][k]+cal[0]);
                    cur = (k >> 2) | ((int)s[i] << 2);
                    dp[i + 1][j][cur] = max(dp[i + 1][j][cur],dp[i][j][k]+cal[1]);
                }
            }
        }
    }
    cout << res;
}

Compilation message

miners.cpp: In function 'int main()':
miners.cpp:54:32: warning: array subscript has type 'char' [-Wchar-subscripts]
                     cnt[0][s[i]]++;cnt[1][s[i]]++;
                                ^
miners.cpp:54:47: warning: array subscript has type 'char' [-Wchar-subscripts]
                     cnt[0][s[i]]++;cnt[1][s[i]]++;
                                               ^
miners.cpp:28:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen(taskname".INP", "r",stdin);
   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
miners.cpp:29:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen(taskname".OUT", "w",stdout);
   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

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

Subtask #5
9.0 / 9.0

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

Subtask #6
7.0 / 7.0

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

Subtask #7
8.0 / 8.0

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

Subtask #8
8.0 / 8.0

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

Subtask #9
8.0 / 8.0

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

Subtask #10
8.0 / 8.0

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

Subtask #11
8.0 / 8.0

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

Subtask #12
8.0 / 8.0

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