제출 #396736

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
396736		danielcm585	Martian DNA (BOI18_dna)	C++14	0 / 100	38 ms	2432 KiB

dna

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

#define fi first
#define se second

typedef long long ll;
typedef pair<int,int> ii;

const int N = 2e5;
const int INF = 1e9;
int n, k, r;
int a[N+2], cnt[N+2], need[N+2];

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> k >> r;
    for (int i = 1; i <= n; i++) cin >> a[i];
    for (int i = 1; i <= r; i++) {
        int b, q; cin >> b >> q;
        need[b] = q;
    }
    int ans = INF, get = 0;
    for (int i = 1, j = 1; j <= n; i++) {
        while (j <= n && get < r) {
            cnt[a[j]]++;
            get += (need[a[j]] && cnt[a[j]] == need[a[j]]);
            j++;
        }
        // cout << i << " -> " << j << '\n';
        if (get == r) ans = min(ans,j-i);
        get -= (need[a[i]] && cnt[a[i]] == need[a[i]]);
        cnt[a[i]]--;
    }
    if (ans == INF) cout << "impossible\n";
    else cout << ans << '\n';
    return 0;
}

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