Submission #381449

#	Time	Username	Problem	Language	Result	Execution time	Memory
381449		Return_0	Martian DNA (BOI18_dna)	C++17	100 / 100	82 ms	11008 KiB

dna

#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 / 16
• Subtask 2: 24 / 24
• Subtask 3: 28 / 28
• Subtask 4: 32 / 32