제출 #479986

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
479986		kym	Event Hopping 2 (JOI21_event2)	C++14	0 / 100	1 ms	204 KiB

event2

#include <bits/stdc++.h>
using namespace std;
#define int ll 
#define FOR(i,s,e) for(ll i = s; i <= (ll)e; ++i)
#define DEC(i,s,e) for(ll i = s; i >= (ll)e; --i)
#define IAMSPEED ios_base::sync_with_stdio(false); cin.tie(0);
#ifdef LOCAL
#define db(x) cerr << #x << "=" << x << "\n"
#define db2(x, y) cerr << #x << "=" << x << " , " << #y << "=" << y << "\n"
#define db3(a,b,c) cerr<<#a<<"="<<a<<","<<#b<<"="<<b<<","<<#c<<"="<<c<<"\n"
#define dbv(v) cerr << #v << ":"; for (auto ite : v) cerr << ite << ' '; cerr <<"\n"
#define dbvp(v) cerr << #v << ":"; for (auto ite : v) cerr << "{"  << ite.f << ',' << ite.s << "} "; cerr << "\n"
#define dba(a,ss,ee) cerr << #a << ":"; FOR(ite,ss,ee) cerr << a[ite] << ' '; cerr << "\n"
#define reach cerr << "LINE: " << __LINE__ << "\n";
#else
#define db(x)
#define db2(x,y)
#define db3(a,b,c)
#define dbv(v)
#define dbvp(v)
#define dba(a,ss,ee)
#define reach 
#endif
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define ll long long 
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define f first
#define s second
#define g0(x) get<0>(x)
#define g1(x) get<1>(x)
#define g2(x) get<2>(x)
#define g3(x) get<3>(x)
typedef pair <ll, ll> pi;
typedef tuple<ll,ll,ll> ti3;
typedef tuple<ll,ll,ll,ll> ti4;
ll rand(ll a, ll b) { return a + rng() % (b-a+1); }
const int MOD = 1e9 + 7;
const int inf = (int)1e9 + 500;
const long long oo = (ll)1e18 + 500;
template <typename T> void chmax(T& a, const T b) { a=max(a,b); }
template <typename T> void chmin(T& a, const T b) { a=min(a,b); }
const int MAXN = -1;
int k;
void out(set<ti3>ans) {
	set<int> s;
	for(auto i:ans)s.insert(g2(i));
	dbv(s);
	vector<int>v;
	for(auto i:s)v.pb(i);
	FOR(i,0,k-1)cout<<v[i]<<'\n';
	exit(0);
}

int32_t main() 
{
	IAMSPEED
	int n;cin>>n>>k;
	vector<ti3> v;
	FOR(i,1,n) {
		int a,b,c;cin>>a>>b;c=i;
		v.pb(ti3(a,b,c));
	}
	sort(all(v),[](ti3 a, ti3 b) {
		if(g1(a)!=g1(b)) return g1(a)<g1(b);
		else return g0(a)>g0(b);
	});
	set<ti3>s;
	int st=-1;
	DEC(i,v.size()-1,0) {
		if(g1(v[i])<=st){
			s.insert(v[i]);
			st=g0(v[i]);
		}
	
		
	}
	//out(s);
	if((int)s.size()<k)return cout<<-1,0;
	sort(all(v),[](ti3 a, ti3 b) {
		return g2(a)<g2(b);
	});
	FOR(i,0,v.size()-1) {
		db(i);
		ti3 c=v[i];
		if(s.find(c)!=s.end())continue;
		set<ti3>os=s;
		int lf=g0(c),rg=g1(c);
		auto it=s.lower_bound(ti3(lf,oo,oo));
		while(it!=s.begin()){
			it=prev(it);
			ti3 x=*it;
			if(g1(x)>lf&&g2(x)<g2(c))goto riedusg;
			if(g1(x)>lf){
				it=next(it);
				s.erase(x);
			} else break;
				
		}
		it=s.lower_bound(ti3(lf,-oo,-oo));
		while(it!=s.end()) {
			ti3 x=*it;
			if(g0(x)<rg&&g2(x)<g2(c))goto riedusg;
			if(g0(x)<rg){
				it=next(it);
				s.erase(x);
			} else {
				break;
			}
		}
		s.insert(c);
		if((int)s.size()<k)out(os);
		continue;
		riedusg:;
		s=os;
	}
	out(s);
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 1
• Subtask 3: 0 / 31
• Subtask 4: 0 / 61