제출 #1212845

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1212845		ml_tss	Grudanje (COCI19_grudanje)	C++20	49 / 70	2096 ms	20464 KiB

grudanje

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

int main() {
    string st; 
    cin >> st;
    int n = st.size();

    int Q; 
    cin >> Q;

    vector<pair<int,int>> subwords(Q);
    vector<unordered_set<char>> subwords_chars(Q);
    for (int i = 0; i < Q; i++) {
        int a, b;
        cin >> a >> b;
        subwords[i] = {a-1, b-1};
    }

    vector<int> p(n);
    for (int i = 0; i < n; i++) {
        cin >> p[i];
        p[i]--;
    }

    for (int i = n-1; i >= 0; i--) {
        int pos = p[i];
        char c = st[pos];

        for (int j = 0; j < Q; j++) {
            auto [l, r] = subwords[j];
            if (pos >= l && pos <= r) {
                if (subwords_chars[j].count(c)) {
                    cout << i + 1;
                    return 0;
                }
                subwords_chars[j].insert(c);
            }
        }
    }

    cout << 0;
}

• 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: 0 / 7
• Subtask 9: 0 / 7
• Subtask 10: 0 / 7