Submission #1242514

#TimeUsernameProblemLanguageResultExecution timeMemory
1242514chikien2009 Martian DNA (BOI18_dna)C++20
100 / 100
19 ms2628 KiB
#include <bits/stdc++.h>

using namespace std;

void setup()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}

int n, k, r, a, b, req[200000], num[200000], v[200000], sat;

int main()
{
    setup();

    cin >> n >> k >> r;
    for (int i = 0; i < n; ++i)
    {
        cin >> v[i];
    }
    sat = k - r;
    while (r--)
    {
        cin >> a >> b;
        req[a] = b;
    }
    a = 2e9;
    for (int i = 0, j = 0; i < n; ++i)
    {
        while (j < n && sat < k)
        {
            num[v[j]]++;
            sat += (num[v[j]] == req[v[j]]);
            j++;
        }
        if (sat == k)
        {
            a = min(a, j - i);
        }
        sat -= (num[v[i]] == req[v[i]]);
        num[v[i]]--;
    }
    if (a == 2e9)
    {
        cout << "impossible";
        return 0;
    }
    cout << a;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...