| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 936792 |
2024-03-02T17:58:24 Z |
PagodePaiva |
Teams (IOI15_teams) |
C++17 |
|
4000 ms |
17444 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);
}
// 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;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
1 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 ms |
348 KB |
Output is correct |
| 4 |
Correct |
1 ms |
532 KB |
Output is correct |
| 5 |
Correct |
0 ms |
436 KB |
Output is correct |
| 6 |
Correct |
1 ms |
604 KB |
Output is correct |
| 7 |
Correct |
0 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 |
0 ms |
432 KB |
Output is correct |
| 11 |
Correct |
0 ms |
348 KB |
Output is correct |
| 12 |
Correct |
0 ms |
348 KB |
Output is correct |
| 13 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 14 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
14 ms |
3536 KB |
Output is correct |
| 2 |
Correct |
14 ms |
3540 KB |
Output is correct |
| 3 |
Correct |
14 ms |
3540 KB |
Output is correct |
| 4 |
Correct |
16 ms |
4420 KB |
Output is correct |
| 5 |
Correct |
10 ms |
3028 KB |
Output is correct |
| 6 |
Correct |
10 ms |
3124 KB |
Output is correct |
| 7 |
Correct |
10 ms |
3028 KB |
Output is correct |
| 8 |
Correct |
10 ms |
3008 KB |
Output is correct |
| 9 |
Correct |
7 ms |
3280 KB |
Output is correct |
| 10 |
Correct |
6 ms |
2772 KB |
Output is correct |
| 11 |
Correct |
5 ms |
2772 KB |
Output is correct |
| 12 |
Correct |
6 ms |
3028 KB |
Output is correct |
| 13 |
Correct |
12 ms |
3284 KB |
Output is correct |
| 14 |
Correct |
12 ms |
3280 KB |
Output is correct |
| 15 |
Incorrect |
13 ms |
3280 KB |
Output isn't correct |
| 16 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
28 ms |
3784 KB |
Output is correct |
| 2 |
Correct |
30 ms |
3792 KB |
Output is correct |
| 3 |
Execution timed out |
4019 ms |
4360 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
119 ms |
16384 KB |
Output is correct |
| 2 |
Correct |
132 ms |
16476 KB |
Output is correct |
| 3 |
Execution timed out |
4088 ms |
17444 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
