답안 #959163

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
959163	2024-04-07T14:27:38 Z	Mizo_Compiler	팀들 (IOI15_teams)	C++17	34 / 100	4000 ms	16976 KB

teams

#include <bits/stdc++.h>
#include "teams.h"
using namespace std;
typedef long long ll;
typedef double ld;
#define pb push_back
#define sz(x) int32_t(x.size())
#define all(x) x.begin(),x.end()
#define F first
#define S second
int n;
vector<pair<int, int>> v;
void init(int N, int A[], int B[]) {
	n = N;
	for (int i = 0; i < n; i++) {
		v.pb({B[i], A[i]});
	}
	sort(all(v));
}

int can(int M, int K[]) {
	sort(K, K+M);
	int sm = 0;
	for (int i = 0; i < M; i++) {
		sm += K[i];
		if (sm > n)return 0;
	}	
	int id = 0, rem = K[0];
	vector<bool> tk(n, false);
	while (id < M) {
		bool ff = false;
		for (int i = 0; i < n; i++) {
			if (tk[i])continue;
			if (v[i].S <= K[id] && v[i].F >= K[id]) {
				rem--;
				tk[i] = true;
				if (!rem) {
					id++;
					if (id < M)rem = K[id];
				}
				ff = true;
				break;
			}
		}
		if (!ff)break;
	}
	return (id == M);
}

Subtask #1

21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	596 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	448 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	1 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	344 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	1 ms	344 KB	Output is correct

Subtask #2

13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	15 ms	3792 KB	Output is correct
2	Correct	15 ms	3540 KB	Output is correct
3	Correct	3756 ms	3540 KB	Output is correct
4	Correct	16 ms	3724 KB	Output is correct
5	Correct	3707 ms	3000 KB	Output is correct
6	Correct	2316 ms	3024 KB	Output is correct
7	Correct	10 ms	3024 KB	Output is correct
8	Correct	11 ms	3028 KB	Output is correct
9	Correct	3541 ms	3012 KB	Output is correct
10	Correct	3615 ms	2772 KB	Output is correct
11	Correct	3514 ms	2768 KB	Output is correct
12	Correct	3528 ms	3024 KB	Output is correct
13	Correct	3351 ms	3284 KB	Output is correct
14	Correct	3630 ms	3280 KB	Output is correct
15	Correct	68 ms	3280 KB	Output is correct
16	Correct	15 ms	3284 KB	Output is correct
17	Correct	3030 ms	3316 KB	Output is correct
18	Correct	3233 ms	3436 KB	Output is correct

Subtask #3

0 / 43.0

#	결과	실행 시간	메모리	Grader output
1	Correct	60 ms	3796 KB	Output is correct
2	Correct	126 ms	3772 KB	Output is correct
3	Execution timed out	4054 ms	3540 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-

Subtask #4

0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	642 ms	16368 KB	Output is correct
2	Correct	868 ms	16492 KB	Output is correct
3	Execution timed out	4030 ms	16976 KB	Time limit exceeded
4	Halted	0 ms	0 KB	-