# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1093135 | juicy | Martian DNA (BOI18_dna) | C++17 | 149 ms | 143300 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif
const int N = 2e5, inf = 1e9;
int n, k, r;
int a[N], l[N];
deque<int> dq[N];
int main() {
ios::sync_with_stdio(false); cin.tie(nullptr);
cin >> n >> k >> r;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
for (int i = 0; i < r; ++i) {
int b; cin >> b >> l[b];
}
set<int> st;
int res = inf;
for (int i = 0; i < n; ++i) {
if (l[a[i]]) {
dq[a[i]].push_back(i);
if (dq[a[i]].size() > l[a[i]]) {
st.erase(dq[a[i]].front());
dq[a[i]].pop_front();
}
if (dq[a[i]].size() == l[a[i]]) {
st.insert(dq[a[i]].front());
}
}
if (st.size() == r) {
res = min(res, i - *st.begin() + 1);
}
}
if (res == inf) {
cout << "impossible";
} else {
cout << res;
}
return 0;
}
Compilation message (stderr)
# | 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... |