oj.uz

Submission #936797

# Submission time Handle Problem Language Result Execution time Memory
936797 2024-03-02T18:00:30 Z PagodePaiva Teams (IOI15_teams) C++17
0 / 100
 4000 ms 10176 KB 
#include "teams.h"
#include<bits/stdc++.h>

using namespace std;

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.push_back({B[i], -A[i]});
	}
	sort(v.begin(), v.end());
	for(auto &x : v){
		swap(x.first, x.second);
		x.first *= -1;
	}
	// for(auto x : v){
	// 	cout << x << ' ';
	// }
}

int can(int M, int K[]) {
	int m = M;
	vector <int> k;
	for(int i = 0;i < m;i++) k.push_back(K[i]);
	sort(k.begin(), k.end());
	reverse(k.begin(), k.end());
	int l = n-1;
	for(auto x : k){
		int cnt = x;
		while(cnt > 0){
			if(l < 0) return 0;
			// cout << v[l].first << ' ' << v[l].second << ' ' << x << endl;
			if(v[l].first <= x and x <= v[l].second){
				cnt--;
			}
			l--;
		}
	}
	return 1;
}

Subtask #1
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Incorrect 0 ms 348 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 2256 KB Output is correct
2 Correct 13 ms 2260 KB Output is correct
3 Correct 13 ms 2260 KB Output is correct
4 Correct 15 ms 3112 KB Output is correct
5 Correct 10 ms 2256 KB Output is correct
6 Correct 10 ms 2260 KB Output is correct
7 Correct 10 ms 2260 KB Output is correct
8 Correct 10 ms 2256 KB Output is correct
9 Correct 6 ms 2512 KB Output is correct
10 Incorrect 6 ms 2256 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #3
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 2260 KB Output is correct
2 Correct 29 ms 2260 KB Output is correct
3 Execution timed out 4070 ms 2644 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 117 ms 10176 KB Output is correct
2 Correct 136 ms 9132 KB Output is correct
3 Execution timed out 4017 ms 9152 KB Time limit exceeded
4 Halted 0 ms 0 KB -