제출 #1008021

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1008021		vjudge1	Miners (IOI07_miners)	C++17	45 / 100	1560 ms	852 KiB

miners

#include <bits/stdc++.h>
using namespace std;

int shipment2(char s1, char s2) {
    return 1 + (s1 != s2);
}

int shipment3(char s1, char s2, char s3) {
    if (s1 == s2 && s2 == s3) return 1;
    return (s1 != s2) + (s2 != s3) + (s3 != s1);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int n; string s; cin >> n >> s;
    int ans = 0;
    for (int mask = 0; mask < (1 << n)-1; mask++) {
        string mine1, mine2;
        for (int i = 0; i < n; i++) {
            if (mask & (1 << i)) mine1 += s[i];
            else mine2 += s[i];
        }
        int l1 = mine1.size(), l2 = mine2.size();
        int sum = 0;
        if (l1 > 1) sum += 1 + shipment2(mine1[0], mine1[1]);
        else if (l1 == 1) sum += 1;

        if (l2 > 1) sum += 1 + shipment2(mine2[0], mine2[1]);
        else if (l2 == 1) sum += 1;

        for (int i = 2; i < l1; i++) {
            sum += shipment3(mine1[i], mine1[i-1], mine1[i-2]);
        }
        for (int i = 2; i < l2; i++) {
            sum += shipment3(mine2[i], mine2[i-1], mine2[i-2]);
        }
        ans = max(ans, sum);
    }
    cout << ans;
}

• 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