Submission #382476

#	Time	Username	Problem	Language	Result	Execution time	Memory
382476		vishesh312	Martian DNA (BOI18_dna)	C++17	0 / 100	43 ms	2028 KiB

dna

#include "bits/stdc++.h"
using namespace std;
/*
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using ordered_set = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;
*/

#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()

using ll = long long;
const int mod = 1e9+7;

void solve(int tc) {
    int n, k, r;
    cin >> n >> k >> r;
    vector<int> v(n), a(k);
    vector<bool> need(k);
    for (auto &x : v) cin >> x;
    int req = 0;
    while (r--) {
        int b, q;
        cin >> b >> q;
        a[b] = q;
        req += q;
        need[b] = true;
    }
    int l = 0;
    r = 0;
    if (need[v[0]]) {
        --req;
    }
    --a[v[0]];
    int ans = 1e9;
    while (r < n-1) {
        while (!req) {
//          cout << "l r : " << l << " " << r << '\n';
            ans = min(ans, r-l+1);
            if (need[v[l]]) {
//              cout << "v[l] a[v[l]] : " << v[l] << " " << a[v[l]] << '\n';
                a[v[l]]++;
                if (a[v[l]] > 0) req++;
            }
            ++l;
        }
        while (req and r < n-1) {
            ++r;
            if (need[v[r]]) {
//              cout << "v[r] a[v[r]] " << v[r] << " " << a[v[r]] << '\n';
                if (a[v[r]] > 0) --req;
                a[v[r]]--;
//              cout << "a[v[r]] : " << a[v[r]] << '\n';
            }
        }
    }
    if (ans == 1e9) cout << "impossible\n";
    else cout << ans << '\n';
}

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    int tc = 1;
    //cin >> tc;
    for (int i = 1; i <= tc; ++i) solve(i);
    return 0;
}

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