Submission #381449

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
381449	2021-03-25T08:01:34 Z	Return_0	Martian DNA (BOI18_dna)	C++17	100 / 100	82 ms	11008 KB

#pragma GCC optimize("Ofast,unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef int ll;
typedef long double ld;
typedef pair <ll, ll> pll;

#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
	const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush();
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< (x) << endl, 0
#define cl const ll
#define fr first
#define sc second
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()

cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353;

template <class A,class B> ostream& operator << (ostream& out,const pair<A,B>&a){return out<<'('<<a.first<<", "<<a.second<<')';}
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
	out<< '['; for (int i = -1; ++i < int(a.size());) out<< a[i] << (i + 1 < int(a.size()) ? ", " : ""); return out<<']'; }
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;

cl N = 2e5 + 7;

ll a [N], nxt [N], cnt [N], Q [N], L [N], bad, n, k, R, ans = inf;
multiset <ll> st;

int main ()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

	memset(L, -1, sizeof L);

	cin>> n >> k >> R;
	for (ll i = 0; i < n; i++) {
		cin>> a[i];
		if (L[a[i]] == -1) {
			L[a[i]] = i;
		} else {
			nxt[L[a[i]]] = i;
			L[a[i]] = i;
		}
	}

	for (ll i = 0, x; i < R; i++) {
		cin>> x;
		cin>> Q[x];
	}

	bad = k;
	for (ll i = 0; i < k; i++) bad -= (Q[i] == 0);

	// dbg(bad);
	// dbg2(nxt, 0, n);

	for (ll i = n; i--;) L[a[i]] = i;

	for (ll i = 0; i < n; i++) {
		cnt[a[i]]++;
		if (!Q[a[i]]) {
			if (bad) continue;
			ans = min(ans, i - *st.begin() + 1);
		} else {
			if (cnt[a[i]] == Q[a[i]]) {
				bad--;
				st.insert(L[a[i]]);
			} else if (cnt[a[i]] > Q[a[i]]) {
				st.erase(st.find(L[a[i]]));
				if (nxt[L[a[i]]]) L[a[i]] = nxt[L[a[i]]];
				st.insert(L[a[i]]);
			}
			if (!bad) ans = min(ans, i - *st.begin() + 1);
		}
	}

	if (ans > n) kill("impossible");
	kill(ans);

	cerr<< "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";

	return 0;
}
/*
5 2 2
0 1 1 0 1
0 1
1 1

13 4 3
1 1 3 2 0 1 2 0 0
0 0 3 1
0 2
2 1
1 2

5 3 1
1 2 0 1 2
0 2

*/

Subtask #1
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	1132 KB	Output is correct
2	Correct	2 ms	1132 KB	Output is correct
3	Correct	1 ms	1132 KB	Output is correct
4	Correct	2 ms	1132 KB	Output is correct
5	Correct	2 ms	1260 KB	Output is correct
6	Correct	1 ms	1132 KB	Output is correct
7	Correct	2 ms	1132 KB	Output is correct
8	Correct	2 ms	1132 KB	Output is correct
9	Correct	2 ms	1132 KB	Output is correct

Subtask #2
24.0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	1132 KB	Output is correct
2	Correct	2 ms	1132 KB	Output is correct
3	Correct	2 ms	1260 KB	Output is correct
4	Correct	2 ms	1152 KB	Output is correct
5	Correct	2 ms	1260 KB	Output is correct
6	Correct	2 ms	1132 KB	Output is correct
7	Correct	1 ms	1132 KB	Output is correct
8	Correct	1 ms	1132 KB	Output is correct
9	Correct	1 ms	1132 KB	Output is correct
10	Correct	2 ms	1132 KB	Output is correct
11	Correct	2 ms	1132 KB	Output is correct
12	Correct	2 ms	1132 KB	Output is correct
13	Correct	1 ms	1132 KB	Output is correct
14	Correct	2 ms	1132 KB	Output is correct
15	Correct	1 ms	1132 KB	Output is correct

Subtask #3
28.0 / 28.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	22 ms	3052 KB	Output is correct
2	Correct	23 ms	3180 KB	Output is correct
3	Correct	27 ms	3180 KB	Output is correct
4	Correct	27 ms	3180 KB	Output is correct
5	Correct	24 ms	4204 KB	Output is correct
6	Correct	17 ms	3052 KB	Output is correct
7	Correct	20 ms	3308 KB	Output is correct
8	Correct	26 ms	3948 KB	Output is correct
9	Correct	22 ms	3692 KB	Output is correct
10	Correct	27 ms	3052 KB	Output is correct
11	Correct	2 ms	1132 KB	Output is correct
12	Correct	2 ms	1132 KB	Output is correct
13	Correct	2 ms	1260 KB	Output is correct
14	Correct	2 ms	1132 KB	Output is correct
15	Correct	2 ms	1260 KB	Output is correct
16	Correct	2 ms	1188 KB	Output is correct
17	Correct	1 ms	1132 KB	Output is correct
18	Correct	1 ms	1132 KB	Output is correct
19	Correct	2 ms	1132 KB	Output is correct
20	Correct	2 ms	1132 KB	Output is correct
21	Correct	2 ms	1132 KB	Output is correct
22	Correct	2 ms	1132 KB	Output is correct
23	Correct	2 ms	1132 KB	Output is correct
24	Correct	2 ms	1132 KB	Output is correct
25	Correct	1 ms	1132 KB	Output is correct

Subtask #4
32.0 / 32.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	82 ms	8556 KB	Output is correct
2	Correct	75 ms	7680 KB	Output is correct
3	Correct	39 ms	5356 KB	Output is correct
4	Correct	24 ms	3052 KB	Output is correct
5	Correct	44 ms	5612 KB	Output is correct
6	Correct	66 ms	11008 KB	Output is correct
7	Correct	65 ms	4076 KB	Output is correct
8	Correct	82 ms	4920 KB	Output is correct
9	Correct	23 ms	3052 KB	Output is correct
10	Correct	22 ms	3052 KB	Output is correct
11	Correct	28 ms	3180 KB	Output is correct
12	Correct	27 ms	3180 KB	Output is correct
13	Correct	24 ms	4204 KB	Output is correct
14	Correct	18 ms	3180 KB	Output is correct
15	Correct	23 ms	3436 KB	Output is correct
16	Correct	26 ms	3948 KB	Output is correct
17	Correct	22 ms	3692 KB	Output is correct
18	Correct	27 ms	3052 KB	Output is correct
19	Correct	2 ms	1132 KB	Output is correct
20	Correct	2 ms	1132 KB	Output is correct
21	Correct	2 ms	1260 KB	Output is correct
22	Correct	2 ms	1132 KB	Output is correct
23	Correct	2 ms	1260 KB	Output is correct
24	Correct	2 ms	1132 KB	Output is correct
25	Correct	2 ms	1132 KB	Output is correct
26	Correct	2 ms	1132 KB	Output is correct
27	Correct	2 ms	1132 KB	Output is correct
28	Correct	1 ms	1132 KB	Output is correct
29	Correct	1 ms	1132 KB	Output is correct
30	Correct	2 ms	1132 KB	Output is correct
31	Correct	2 ms	1132 KB	Output is correct
32	Correct	2 ms	1132 KB	Output is correct
33	Correct	2 ms	1132 KB	Output is correct

Submission #381449

Compilation message

Subtask #1 16.0 / 16.0

Subtask #2 24.0 / 24.0

Subtask #3 28.0 / 28.0

Subtask #4 32.0 / 32.0

Subtask #1
16.0 / 16.0

Subtask #2
24.0 / 24.0

Subtask #3
28.0 / 28.0

Subtask #4
32.0 / 32.0