제출 #1040271

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1040271		shezitt	Miners (IOI07_miners)	C++14	45 / 100	1590 ms	856 KiB

miners

#include<bits/stdc++.h>

using namespace std;

using ll = long long;

#define int ll
#define fore(a, b, c) for(int a=b; a<c; ++a)
#define vi vector<int>
#define pb push_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define F first
#define S second
#define ii pair<int,int>
#define dbg(x) cerr << #x << ": " << x << endl
#define raya cerr << "=============" << endl

int n;
string s;

int calc(string &cur){
    set<char> st;
    for(int i=sz(cur)-1; i>=max(0ll, sz(cur)-3); --i){
        st.insert(cur[i]);
    }
    return sz(st);
}

signed main(){
    cin >> n;
    cin >> s;

    int ans = 0;
    for(int mask=0; mask<(1<<n); ++mask){
        string mine1, mine2;
        int res = 0;
        fore(i, 0, n) {
            if((mask >> i) & 1){
                // mine1
                mine1.pb(s[i]);
                res += calc(mine1);
            } else {
                // mine2    
                mine2.pb(s[i]);
                res += calc(mine2);
            }
        }
        ans = max(ans, res);
    }

    cout << ans << endl;

}

• Subtask 1: 9 / 9
• Subtask 2: 9 / 9
• Subtask 3: 9 / 9
• Subtask 4: 9 / 9
• Subtask 5: 9 / 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