Submission #860955

#	Time	Username	Problem	Language	Result	Execution time	Memory
860955		GordonRemzi007	Martian DNA (BOI18_dna)	C++17	0 / 100	194 ms	8788 KiB

dna

#include <iostream>
#include <vector>
#include <map>
#include <climits>
#define int long long

using namespace std;

signed main() {
    int n, k, r, res = LLONG_MAX, ri = -1;
    bool ok;
    map<int,int> c;
    cin >> n >> k >> r;
    vector<int> a(n), sum(r);
    vector<pair<int,int>> b(r);
    for(int i = 0; i < n; i++) cin >> a[i];
    for(int i = 0; i < r; i++) {
        cin >> b[i].first >> b[i].second;
        c[b[i].first] = i+1;
    }
    //find start
    while(true) {
        if(ri == n-1) {
            cout << "impossible\n";
            return 0;
        }
        ri++;
        if(c[a[ri]]) {
            sum[c[a[ri]]-1]++;
            ok = true;
            for(int i = 0; i < r; i++) {
                if(sum[i] < b[i].second) {
                    ok = false;
                    break;
                }
            }
            if(ok) break;
        }
    }
    //start
    res = ri+1;
    cout << ri << "\n";
    for(int i = 0; i < n; i++) {
        if(c[a[i]]) {
            sum[c[a[i]]-1]--;
            ok = true;
            while(sum[c[a[i]]-1] < b[c[a[i]]-1].second) {
                if(ri == n-1) {
                    ok = false;
                    break;
                }
                ri++;
                if(c[a[ri]]) sum[c[a[ri]]-1]++;
            }
            if(!ok) break;
        }
        res = min(res, ri-i);
    }
    cout << res << "\n";
}

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