This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")
#include<bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define sz(a) (int)a.size()
#define s second
#define f first
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
vector<pii> rid = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
vector<pii> dir = {{-1, -1}, {-1, 1}, {1, -1}, {1, 1}};
const int N = 6e4 + 1, mod = 1e9 + 7;
const ll inf = 1e9;
double eps = 1e-15;
bool flg = 0;
void slv() {
int n, k, r;
cin >> n >> k >> r;
int a[n + 1];
for (int i = 1; i <= n; i++) cin >> a[i];
vector<int> v(k);
multiset<int> s;
for (int i = 1; i <= r; i++) {
int b, q;
cin >> b >> q;
v[b] = q;
s.insert(0);
}
queue<int> ps[k];
int mn = inf;
for (int i = 1; i <= n; i++) {
ps[a[i]].push(i);
if (sz(ps[a[i]]) == v[a[i]])
s.erase(s.find(0));
if (sz(ps[a[i]]) > v[a[i]]) {
if (v[a[i]])
s.erase(s.find(ps[a[i]].front()));
ps[a[i]].pop();
}
if (v[a[i]] && sz(ps[a[i]]) == v[a[i]])
s.insert(ps[a[i]].front());
int l = *s.begin();
if (!l) continue;
mn = min(mn, i - l + 1);
}
if (mn == inf) cout << "impossible";
else cout << mn;
}
main() {
//freopen("rsq.in", "r", stdin);
//freopen("rsq.out", "w", stdout);
ios_base::sync_with_stdio(0);
cin.tie(0);
int tp = 1;
if (flg) cin >> tp;
while (tp--) {
slv();
}
}
//wenomechainsama
Compilation message (stderr)
dna.cpp:65:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
65 | main() {
| ^~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |