Submission #1132095

#	Time	Username	Problem	Language	Result	Execution time	Memory
1132095		lopkus	스탬프 수집 (JOI16_ho_t2)	C++20	0 / 100	0 ms	328 KiB

2016_ho_t2

#include <bits/stdc++.h>

#define int long long


using namespace std;

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    vector<char> a(n + 1);
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    int f = 0;
    vector<int> prefj(n + 1, 0);
    vector<int> sufi(n + 3, 0);
    for(int i = 1; i <= n; i++) {
        prefj[i] = prefj[i - 1] + (a[i] == 'J');
    }
    for(int i = n; i >= 1; i--) {
        sufi[i] = sufi[i + 1] + (a[i] == 'I');
    }
    for(int i = 1; i <= n; i++) {
        if(a[i] != 'J') {
            continue;
        }
        for(int j = i + 1; j <= n; j++) {
            if(a[j] == 'O') {
                f += sufi[j + 1];
            }
        }
    }
    int ans = 0;
    for(int i = 1; i <= n + 1; i++) {
        int ansj = f;
        int anso = f;
        int ansi = f;
        for(int j = i + 1; j <= n; j++) {
            if(a[j] == 'O') {
                ansj += sufi[j + 1];
            }
        }
        anso += prefj[i - 1] * sufi[i + 1];
        for(int j = i - 1; j >= 1; j--) {
            if(a[j] == 'O') {
                ansi += prefj[j - 1];
            }
        }
        ans = max({ans, ansj, ansi, anso});
    }
    cout << ans;
}

• Subtask 1: 0 / 30
• Subtask 2: 0 / 20
• Subtask 3: 0 / 50