제출 #496001

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
496001		AlperenT	Grudanje (COCI19_grudanje)	C++17	70 / 70	132 ms	13716 KiB

grudanje

#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 5;

string str, cur;

int n, q, balls[N];

array<int, 26> prefix[N];

pair<int, int> query[N];

bool check(int m){
    cur = str;

    for(int i = 1; i <= m; i++) cur[balls[i]] = '.';

    for(int i = 1; i <= n; i++){
        prefix[i] = prefix[i - 1];

        if(cur[i] != '.') prefix[i][cur[i] - 'a']++;
    }

    for(int i = 0; i < q; i++){
        for(int j = 0; j < 26; j++){
            if(prefix[query[i].second][j] - prefix[query[i].first - 1][j] > 1) return false;
        }
    }

    return true;
}

int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);

    cin >> str;

    n = str.size();

    str = '$' + str;

    cin >> q;

    for(int i = 0; i < q; i++) cin >> query[i].first >> query[i].second;

    for(int i = 1; i <= n; i++) cin >> balls[i];

    int l = -1, r = n, m;

    while(r - l > 1){
        m = l + (r - l) / 2;

        if(check(m)) r = m;
        else l = m;
    }

    cout << r;
}

• Subtask 1: 7 / 7
• Subtask 2: 7 / 7
• Subtask 3: 7 / 7
• Subtask 4: 7 / 7
• Subtask 5: 7 / 7
• Subtask 6: 7 / 7
• Subtask 7: 7 / 7
• Subtask 8: 7 / 7
• Subtask 9: 7 / 7
• Subtask 10: 7 / 7