Submission #619440

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
619440	2022-08-02T12:04:55 Z	Hazem	Teams (IOI15_teams)	C++14	34 / 100	4000 ms	11436 KB

teams

#include <bits/stdc++.h>

using namespace std;

const int S = 2e5+10;

pair<int,int>p[S];
int n;

void init(int N, int A[], int B[]) {

	n = N;
	for(int i=1;i<=N;i++)
		p[i] = {A[i-1],B[i-1]};

	sort(p+1,p+n+1);
}

int can(int M, int K[]) {
	
	sort(K,K+M);

	int cur = 1;
	multiset<int>st;
	for(int i=0;i<M;i++){
		while(cur<=n)
			if(p[cur].first<=K[i])
				st.insert(p[cur++].second);
			else 
				break;
		
		while(!st.empty()){
			auto it = st.begin();

			if(*it<K[i])
				st.erase(*it);
			else 
				break;
		}

		int cnt = 0;
		while(!st.empty()){
			
			if(cnt==K[i])
				break;

			auto it = st.lower_bound(K[i]);
			if(it==st.end())
				break;
			
			st.erase(st.find(*it));
			cnt++;
		}

		if(cnt!=K[i])
			return 0;
	}

	return 1;
}

Subtask #1

21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	220 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 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	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 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	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct

Subtask #2

13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	13 ms	1876 KB	Output is correct
2	Correct	13 ms	1888 KB	Output is correct
3	Correct	40 ms	6100 KB	Output is correct
4	Correct	15 ms	2260 KB	Output is correct
5	Correct	20 ms	1876 KB	Output is correct
6	Correct	19 ms	1884 KB	Output is correct
7	Correct	9 ms	1880 KB	Output is correct
8	Correct	9 ms	1876 KB	Output is correct
9	Correct	31 ms	6604 KB	Output is correct
10	Correct	30 ms	6536 KB	Output is correct
11	Correct	33 ms	6548 KB	Output is correct
12	Correct	30 ms	6216 KB	Output is correct
13	Correct	32 ms	4588 KB	Output is correct
14	Correct	36 ms	6508 KB	Output is correct
15	Correct	15 ms	2388 KB	Output is correct
16	Correct	13 ms	1876 KB	Output is correct
17	Correct	24 ms	3156 KB	Output is correct
18	Correct	25 ms	3156 KB	Output is correct

Subtask #3

0 / 43.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	19 ms	2260 KB	Output is correct
2	Correct	19 ms	2260 KB	Output is correct
3	Execution timed out	4088 ms	6560 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-

Subtask #4

0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	32 ms	11436 KB	Execution killed with signal 11
2	Halted	0 ms	0 KB	-