제출 #788614

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
788614		WLZ	Martian DNA (BOI18_dna)	C++17	100 / 100	32 ms	4552 KiB

dna

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

typedef pair<int, int> ii;
typedef long long ll;
const int INF = 1e9;
const int MAXN = 2e5 + 5;
const ll LINF = 1e18;
const double pi = acos(-1);
const double EPS = 1e-9;
template <class T> using MinPQ = priority_queue<T, vector<T>, greater<T>>;
template <class T> using MaxPQ = priority_queue<T>;

int n, k, r;

int main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    cin >> n >> k >> r;
    vector<int> a(n);
    for (int i = 0; i < n; i++) cin >> a[i];
    vector<int> q(k);
    int numOfMatched = k - r;
    for (int i = 0; i < r; i++) {
        int b;
        cin >> b;
        cin >> q[b];
    }
    int j = 0;
    vector<int> matched(k, 0);
    int ans = 1e9;
    int curLen = 0;
    for (int i = 0; i < n; i++) {
        matched[a[i]]++; ++curLen;
        if (matched[a[i]] == q[a[i]]) ++numOfMatched;
        if (numOfMatched == k) ans = min(ans, curLen);
        while (j <= i && numOfMatched == k) {
            matched[a[j]]--;
            if (matched[a[j]] < q[a[j]]) numOfMatched--;
            j++;
            curLen--;
            if (numOfMatched == k) ans = min(ans, curLen);
        }
    }
    if (ans > n) cout << "impossible\n";
    else cout << ans << "\n";
    return 0;
}

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