oj.uz

Submission #595666

# Submission time Handle Problem Language Result Execution time Memory
595666 2022-07-14T00:16:04 Z inksamurai Event Hopping 2 (JOI21_event2) C++17
32 / 100
 252 ms 2780 KB 
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
#define rng(i,c,n) for(int i=c;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3uHasSr ios::sync_with_stdio(0),cin.tie(0)
typedef long long ll;
using pii=pair<int,int>;
using vi=vector<int>;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}
// e

using T=pair<pii,int>;

signed main(){
_3uHasSr;
	int n,k;
	cin>>n>>k;
	vec(T) a(n);
	rep(i,n){
		cin>>a[i].fi.fi>>a[i].fi.se;
		a[i].se=i;
	}
	assert(n<=3000);
	vec(pii) _a;
	rep(i,n){
		_a.pb(a[i].fi);
	}
	sort(a.begin(), a.end(),[&](const T&l,const T&r){
		return l.fi.se<r.fi.se;
	});
	vec(pii) stk;
	vi pns;
	rep(_i,n){
		pii _p=_a[_i];
		vec(pii) _stk=stk;
		stk.pb(_p);
		sort(stk.begin(), stk.end(),[&](pii l,pii r){
			return l.se<r.se;
		});
		bool pok=1;
		// check if i already intersect 
		{
			int _lst=-1;
			for(auto p:stk){
				if(p.fi<_lst){
					pok=0;
					break;
				}
				_lst=p.se;
			}
		}
		if(!pok){
			stk=_stk;
			continue;
		}
		int _lst=-1;
		int j=0,cnt=0;
		rep(i,n){
			pii p=a[i].fi;
			// if(_i==1){
			// 	print(p.fi,p.se,j);
			// }
			if(j<sz(stk) and p==stk[j]){
				_lst=stk[j].se;
				j+=1;
				cnt+=1;
			}else if(p.fi>=_lst and (j==sz(stk) or p.se<=stk[j].fi)){
				_lst=p.se;
				cnt+=1;
			}
		}
		// return 0;
		// print(_i,cnt);
		// if(_i==1){
		// 	return 0;
		// }
		// //
		stk=_stk;
		if(cnt>=k){
			pns.pb(_i);
			stk.pb(_p);
		}
	}
	while(sz(pns)>k){
		pns.pop_back();
	}
	if(sz(pns)<k){
		print(-1);
		return 0;
	}
	rep(i,k){
		print(pns[i]+1);
	}
// 
	return 0;
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Runtime error 21 ms 2780 KB Execution killed with signal 6
5 Halted 0 ms 0 KB -

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 280 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 316 KB Output is correct
25 Correct 1 ms 320 KB Output is correct
26 Correct 1 ms 320 KB Output is correct
27 Correct 1 ms 212 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 280 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 316 KB Output is correct
25 Correct 1 ms 320 KB Output is correct
26 Correct 1 ms 320 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 3 ms 412 KB Output is correct
29 Correct 3 ms 468 KB Output is correct
30 Correct 3 ms 468 KB Output is correct
31 Correct 2 ms 464 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 16 ms 460 KB Output is correct
34 Correct 19 ms 468 KB Output is correct
35 Correct 234 ms 636 KB Output is correct
36 Correct 252 ms 624 KB Output is correct
37 Correct 211 ms 664 KB Output is correct
38 Correct 17 ms 460 KB Output is correct
39 Correct 225 ms 520 KB Output is correct
40 Correct 235 ms 616 KB Output is correct
41 Correct 208 ms 544 KB Output is correct
42 Correct 18 ms 468 KB Output is correct
43 Correct 84 ms 492 KB Output is correct
44 Correct 86 ms 480 KB Output is correct
45 Correct 84 ms 492 KB Output is correct
46 Correct 19 ms 472 KB Output is correct
47 Correct 12 ms 420 KB Output is correct
48 Correct 11 ms 472 KB Output is correct
49 Correct 9 ms 472 KB Output is correct
50 Correct 12 ms 460 KB Output is correct
51 Correct 4 ms 468 KB Output is correct
52 Correct 3 ms 476 KB Output is correct
53 Correct 2 ms 468 KB Output is correct
54 Correct 11 ms 468 KB Output is correct
55 Correct 74 ms 468 KB Output is correct
56 Correct 69 ms 520 KB Output is correct
57 Correct 67 ms 544 KB Output is correct
58 Correct 74 ms 516 KB Output is correct
59 Correct 68 ms 500 KB Output is correct
60 Correct 72 ms 520 KB Output is correct
61 Correct 65 ms 520 KB Output is correct
62 Correct 66 ms 548 KB Output is correct
63 Correct 64 ms 504 KB Output is correct
64 Correct 12 ms 468 KB Output is correct

Subtask #4
0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Runtime error 21 ms 2780 KB Execution killed with signal 6
5 Halted 0 ms 0 KB -