Submission #1115897

#	Time	Username	Problem	Language	Result	Execution time	Memory
1115897		njoop	Martian DNA (BOI18_dna)	C++17	0 / 100	25 ms	4556 KiB

dna

#include <bits/stdc++.h>

using namespace std;

int n, k, r, req[300010], amt[300010], qu, ans = 1e9, p1 = 0, p2 = 0;
vector<int> dna;

void add(int type) {
    if(req[type] == 0) return;
    if(req[type] == amt[type]+1) {
        qu++;
    }
    amt[type]++;
}

void del(int type) {
    if(req[type] == 0) return;
    if(req[type] == amt[type]) {
        qu--;
    }
    amt[type]--;
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n >> k >> r;
    for(int i=1; i<=n; i++) {
        int in;
        cin >> in;
        dna.push_back(in);
    }
    for(int i=1; i<=r; i++) {
        int b, q;
        cin >> b >> q;
        req[b] = q;
    }
    while(p2 < n) {
        if(qu == r) {
            ans = min(ans, p2-p1);
            del(dna[p1]);
            p1++;
        } else {
            add(dna[p2]);
            p2++;
        }
    }
    if(ans == 1e9) {
        cout << "impossible";
    } else {
        cout << ans;
    }
    return 0;
}

• Subtask 1: 0 / 16
• Subtask 2: 0 / 24
• Subtask 3: 0 / 28
• Subtask 4: 0 / 32