제출 #1210601

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1210601		emptypringlescan	Event Hopping 2 (JOI21_event2)	C++17	1 / 100	46 ms	1168 KiB

event2

#include <bits/stdc++.h>
using namespace std;
bool cmp(pair<int,int> a, pair<int,int> b){
	return a.second<b.second;
}
int32_t main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n,k;
	cin >> n >> k;
	pair<int,int> arr[n];
	for(int i=0; i<n; i++) cin >> arr[i].first >> arr[i].second;
	vector<vector<int> > ans;
	for(int bt=0; bt<(1<<n); bt++){
		if(__builtin_popcount(bt)!=k) continue;
		vector<pair<int,int> > yay;
		for(int i=0; i<n; i++) if(bt&(1<<i)) yay.push_back(arr[i]);
		sort(yay.begin(),yay.end(),cmp);
		int cur=-1,can=0;
		for(auto i:yay) if(i.first>=cur){
			can++;
			cur=i.second;
		}
		if(can==k){
			vector<int> me;
			for(int i=0; i<n; i++) if(bt&(1<<i)) me.push_back(i+1);
			ans.push_back(me);
		}
	}
	sort(ans.begin(),ans.end());
	if(ans.empty()) cout << -1;
	else for(int i:ans[0]) cout << i << '\n';
}

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