#include <bits/stdc++.h>
#define nl "\n"
#define no "NO"
#define yes "YES"
#define fi first
#define se second
#define vec vector
#define task "main"
#define _mp make_pair
#define ii pair<int, int>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define evoid(val) return void(std::cout << val)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FOD(i, b, a) for(int i = (b); i >= (a); --i)
#define unq(x) sort(all(x)); x.resize(unique(all(x)) - x.begin())
using namespace std;
template<typename U, typename V> bool maxi(U &a, V b) {
if (a < b) { a = b; return 1; } return 0;
}
template<typename U, typename V> bool mini(U &a, V b) {
if (a > b) { a = b; return 1; } return 0;
}
const int N = (int)2e5 + 9;
const int mod = (int)1e9 + 7;
void prepare(); void main_code();
int main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
if (fopen(task".inp", "r")) {
freopen(task".inp", "r", stdin);
freopen(task".out", "w", stdout);
}
const bool MULTITEST = 0; prepare();
int num_test = 1; if (MULTITEST) cin >> num_test;
while (num_test--) { main_code(); }
}
void prepare() {};
int a[N], cnt[12][N], b[N], q[N], ind[N];
int n, k, r;
bool check(int x, int y) {
FOR(i, 1, r)
if (cnt[ind[b[i]]][y] - cnt[ind[b[i]]][x - 1] < q[i]) return 0;
return 1;
}
void subtask3() {
FOR(i, 1, r) ind[b[i]] = i; ind[0] = 0;
FOR(i, 1, n) a[i] = ind[a[i]];
FOR(j, 1, k) {
FOR(i, 1, n) cnt[j][i] = cnt[j][i - 1] + (a[i] == j);
}
int res = n + 1, j = 1;
FOR(i, 1, n) {
while (j <= i and check(j, i)) {
res = min(res, i - j + 1); ++j;
}
}
if (res == n + 1)
evoid("impossible");
cout << res;
}
void main_code() {
cin >> n >> k >> r;
FOR(i, 1, n) cin >> a[i], ++a[i];
FOR(i, 1, r) cin >> b[i] >> q[i], ++b[i];
if (r <= 10) return subtask3(), void();
}
/* Let the river flows naturally */
Compilation message
dna.cpp: In function 'void subtask3()':
dna.cpp:15:22: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
15 | #define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
| ^~~
dna.cpp:57:5: note: in expansion of macro 'FOR'
57 | FOR(i, 1, r) ind[b[i]] = i; ind[0] = 0;
| ^~~
dna.cpp:57:33: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
57 | FOR(i, 1, r) ind[b[i]] = i; ind[0] = 0;
| ^~~
dna.cpp: In function 'int main()':
dna.cpp:36:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
36 | freopen(task".inp", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
dna.cpp:37:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
37 | freopen(task".out", "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4440 KB |
Output is correct |
| 2 |
Runtime error |
5 ms |
9052 KB |
Execution killed with signal 11 |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 2 |
Correct |
1 ms |
4700 KB |
Output is correct |
| 3 |
Runtime error |
6 ms |
9316 KB |
Execution killed with signal 11 |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
17 ms |
11912 KB |
Output is correct |
| 2 |
Correct |
12 ms |
7772 KB |
Output is correct |
| 3 |
Correct |
20 ms |
11908 KB |
Output is correct |
| 4 |
Correct |
18 ms |
11868 KB |
Output is correct |
| 5 |
Runtime error |
31 ms |
23644 KB |
Execution killed with signal 11 |
| 6 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
18 ms |
4444 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
