Submission #798026

#	Time	Username	Problem	Language	Result	Execution time	Memory
798026		sentheta	Martian DNA (BOI18_dna)	C++17	100 / 100	47 ms	15688 KiB

dna

// author : sentheta aka vanwij
#ifdef VANWIJ
	#include"/home/user/code/bits/stdc++.h"
	#define DBG 1
#else
	#include"bits/stdc++.h"
	#define DBG 0
#endif
using namespace std;

#define Int long long
#define V vector
#define pii pair<int,int>
#define ff first
#define ss second

static mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

#define pow2(x) (1LL<<(x))
#define msb(x) (63-__builtin_clzll(x))
#define bitcnt(x) (__builtin_popcountll(x))

#define nl '\n'
#define _ << ' ' <<
#define all(x) (x).begin(), (x).end()
#define rep(i,a,b) for(int i = (int)(a); i < (int)(b); i++)

#define cerr if(DBG) cout
#define dbg(x) {cerr << "?" << #x << " : " << (x) << endl << flush;}

#define int long long
// const Int MOD = 1e9+7;
const Int MOD = 998244353;
Int bpow(Int a,Int b){
	Int ret = 1;
	for(;b; a=a*a%MOD,b/=2) if(b&1) ret = ret*a%MOD;
	return ret;
}
Int inv(Int a){return bpow(a,MOD-2);}

void solve(); int TC, ALLTC;
signed main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cout << fixed << setprecision(7);
	// cin >> ALLTC; for(TC=1; TC<=ALLTC; TC++) solve(); return 0;
	solve();
}










const int N = 2e5+5;

int n, k, q;

int a[N];
int ptr[N];
V<int> pos[N];

void solve(){
	
	cin >> n >> k >> q;
	
	rep(i,0,n){
		cin >> a[i];
		
		pos[a[i]].push_back(i);
	}
	
	rep(i,0,k){
		ptr[i] = -1;
	}
	rep(i,0,q){
		int x, y;
		cin >> x >> y;
		ptr[x] = y-1;
	}
	
	int r = 0;
	rep(i,0,k) if(ptr[i]>=0){
		if((int)pos[i].size() <= ptr[i]){
			cout << "impossible" << nl; return;
		}
		
		r = max(r, pos[i][ptr[i]]);
	}
	
	int ans = n;
	rep(l,0,n){
		dbg(l);
		dbg(r);
		ans = min(ans, r-l+1);
		
		ptr[a[l]]++;
		if((int)pos[a[l]].size() <= ptr[a[l]]){
			break;
		}
		r = max(r, pos[a[l]][ptr[a[l]]]);
	}
	
	cout << ans << nl;
	
	
	
	
	
}

• Subtask 1: 16 / 16
• Subtask 2: 24 / 24
• Subtask 3: 28 / 28
• Subtask 4: 32 / 32