Submission #199838

#	Time	Username	Problem	Language	Result	Execution time	Memory
199838		Mercenary	Miners (IOI07_miners)	C++14	0 / 100	158 ms	100796 KiB

miners

#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 & 7]++;
                    cnt[0][(j >> 2) & 7]++;
                    cnt[1][k & 7]++;
                    cnt[1][(k >> 2) & 7]++;
                    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) | (s[i] << 2);
                    dp[i + 1][cur][k] = max(dp[i + 1][cur][k],dp[i][j][k]+cal[0]);
                    cur = (k >> 2) | (s[i] << 2);
                    dp[i + 1][j][cur] = max(dp[i + 1][cur][cur],dp[i][j][k]+cal[1]);
                }
            }
        }
    }
    cout << res;
}

Compilation message (stderr)

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: 0 / 9
• Subtask 2: 0 / 9
• Subtask 3: 0 / 9
• Subtask 4: 0 / 9
• Subtask 5: 0 / 9
• Subtask 6: 0 / 7
• Subtask 7: 0 / 8
• Subtask 8: 0 / 8
• Subtask 9: 0 / 8
• Subtask 10: 0 / 8
• Subtask 11: 0 / 8
• Subtask 12: 0 / 8