제출 #1142475

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1142475		thelegendary08	Martian DNA (BOI18_dna)	C++17	100 / 100	76 ms	27380 KiB

dna

#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define pout(a) cout<<a.first<<' '<<a.second<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
 
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	in3(n,k,q);
	vvi thing(k);
	vin(v,n);
	f0r(i,n){
		thing[v[i]].pb(i);
	}
	vector<pair<pii, int>> w;
	vector<vpii>y(k);
	bool ok = 1;
	vi items;
	while(q--){
		in2(item, quant);
		items.pb(item);
		if(thing[item].size() < quant){
			ok = 0;
		}
		else{
			f0r(i, thing[item].size() - quant + 1){
				w.pb(mp(mp(thing[item][i], thing[item][i + quant - 1]), item));
				y[item].pb(mp(thing[item][i], thing[item][i + quant - 1]));
			}
		}
	}
	sort(all(w));
	if(!ok)out("impossible");
	else{
		int ans = 4e18;
		int mn = 4e18;
		int mx = -1;
		priority_queue<pair<pii,int>>pq;
		for(auto u : items){
			mn = min(mn,y[u][0].first);
			mx = max(mx, y[u][0].second);
			pq.push(mp(mp(-y[u][0].first, -y[u][0].second), u));
		}
		vi ptrs(k);
		ans = mx - mn + 1;
		//out2(mn, mx);
		while(!pq.empty()){
			int cur = pq.top().second;
			pq.pop();
			ptrs[cur]++;
			if(ptrs[cur] >= y[cur].size()){
				break;
			}
			else{
				pq.push(mp(mp(-y[cur][ptrs[cur]].first, -y[cur][ptrs[cur]].second), cur));
				mn = -pq.top().first.first;
				mx = max(mx,y[cur][ptrs[cur]].second);
				ans = min(ans, mx - mn + 1);
			//	out2(mn, mx);
				
			}
		}
		out(ans);
	}
	
}

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