제출 #497669

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
497669		LittleCube	Martian DNA (BOI18_dna)	C++14	100 / 100	95 ms	4508 KiB

dna

#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
#define S second
using namespace std;

int N, K, R, arr[200005], acc[200005], lim[200005], remain, ans = 1e9;

signed main()
{
    cin >> N >> K >> R;
    remain = R;
    for (int i = 1; i <= N; i++)
        cin >> arr[i];
    for (int i = 1; i <= R; i++)
    {
        int B, Q;
        cin >> B >> Q;
        lim[B] = Q;
    }
    for (int l = 1, r = 1; l <= N; l++)
    {
        while(r <= N && remain > 0)
        {
            acc[arr[r]]++;
            if(acc[arr[r]] == lim[arr[r]])
                remain--;
            r++;
        }
        if(remain == 0)
            ans = min(ans, r - l);
        if(acc[arr[l]] == lim[arr[l]])
            remain++;
        acc[arr[l]]--;
    }
    if(ans > N)
        cout << "impossible\n";
    else
        cout << ans << '\n';
}

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