Submission #541277

#	Time	Username	Problem	Language	Result	Execution time	Memory
541277		Lobo	Martian DNA (BOI18_dna)	C++17	100 / 100	35 ms	6860 KiB

dna

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

const long long inf = (long long) 1e18 + 10;
const int inf1 = (int) 1e9 + 10;
#define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()

const int maxn = 2e5+10;

int n,k,R,s[maxn], mn[maxn], qtd[maxn];

void solve() {
    cin >> n >> k >> R;
    for(int i = 1; i <= n; i++) {
        cin >> s[i];
    }
    int q = R;
    for(int i = 1; i <= R; i++) {
        int id;
        cin >> id;
        cin >> mn[id];
    }

    int ans = inf;
    int r = 0;
    for(int i = 1; i <= n; i++) {
        while(r != n && q != 0) {
            //aumenta r
            r++;
            qtd[s[r]]++;
            if(qtd[s[r]] == mn[s[r]]) {
                q--;
            }
        }

        if(q == 0) ans = min(ans, r-i+1);

        //tira i
        qtd[s[i]]--;
        if(qtd[s[i]] == mn[s[i]]-1) {
            q++;
        }
    }

    if(ans == inf) cout << "impossible" << endl;
    else cout << ans << endl;


}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(0);

    // freopen("in.in", "r", stdin);
    // freopen("out.out", "w", stdout);

    int tt = 1;
    // cin >> tt;
    while(tt--) solve();

}

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