oj.uz

Submission #742821

# Submission time Handle Problem Language Result Execution time Memory
742821 2023-05-17T03:09:41 Z Abrar_Al_Samit Teams (IOI15_teams) C++17
34 / 100
 4000 ms 19844 KB 
#include "teams.h"
#include <bits/stdc++.h>
using namespace std;

const int nax = 100;
int n;
vector<pair<int,int>>a;
void init(int N, int A[], int B[]) {
	n = N;
	for(int i=0; i<n; ++i) {
		a.emplace_back(A[i], B[i]);
	}
	sort(a.begin(), a.end());
}

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

	multiset<int>res;
	for(int i=0; i<M; ++i) {
		while(at < n && a[at].first<=K[i]) {
			if(a[at].second >= K[i]) {
				res.insert(a[at].second);
			}
			++at;
		}
		while(!res.empty() && *res.begin()<K[i]) {
			res.erase(res.begin());
		}
		if(res.size() < K[i]) return 0;
		while(K[i]--) {
			res.erase(res.begin());
		}
	}
	return 1;
}

Compilation message

teams.cpp: In function 'int can(int, int*)':
teams.cpp:31:17: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   31 |   if(res.size() < K[i]) return 0;
      |      ~~~~~~~~~~~^~~~~~

Subtask #1
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 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 296 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 296 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 296 KB Output is correct
12 Correct 1 ms 304 KB Output is correct
13 Correct 2 ms 308 KB Output is correct
14 Correct 2 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 300 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 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 1 ms 212 KB Output is correct
23 Correct 1 ms 300 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 15 ms 2380 KB Output is correct
2 Correct 15 ms 2312 KB Output is correct
3 Correct 24 ms 3816 KB Output is correct
4 Correct 18 ms 2460 KB Output is correct
5 Correct 20 ms 2408 KB Output is correct
6 Correct 15 ms 2516 KB Output is correct
7 Correct 10 ms 2460 KB Output is correct
8 Correct 11 ms 3020 KB Output is correct
9 Correct 29 ms 7520 KB Output is correct
10 Correct 26 ms 7148 KB Output is correct
11 Correct 28 ms 7092 KB Output is correct
12 Correct 28 ms 6808 KB Output is correct
13 Correct 30 ms 5448 KB Output is correct
14 Correct 23 ms 5920 KB Output is correct
15 Correct 16 ms 3512 KB Output is correct
16 Correct 15 ms 3304 KB Output is correct
17 Correct 24 ms 4140 KB Output is correct
18 Correct 26 ms 4196 KB Output is correct

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 2416 KB Output is correct
2 Correct 21 ms 2320 KB Output is correct
3 Execution timed out 4038 ms 4488 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 9136 KB Output is correct
2 Correct 92 ms 9160 KB Output is correct
3 Execution timed out 4081 ms 19844 KB Time limit exceeded
4 Halted 0 ms 0 KB -