| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 262227 |
2020-08-12T13:44:27 Z |
amiratou |
Teams (IOI15_teams) |
C++14 |
|
4000 ms |
38416 KB |
#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ll long long
#define fi first
#define se second
#define sz(x) (int)(x.size())
vector<pair<int,int> > vec;
void init(int N, int A[], int B[]) {
vec.resize(N);
for (int i = 0; i < N; ++i)
vec[i]={A[i],B[i]};
sort(vec.begin(),vec.end());
}
int can(int M, int K[]) {
sort(K,K+M);
multiset<int> myset;
int idx=0;
for (int i = 0; i < M; ++i)
{
while(idx<sz(vec) && vec[idx].fi<=K[i])
myset.insert(vec[idx].se),idx++;
while(sz(myset)&&((*myset.begin())<K[i]))
myset.erase(myset.begin());
if(sz(myset)<K[i])return 0;
for (int j = 0; j < K[i]; ++j)
myset.erase(myset.begin());
}
return 1;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
256 KB |
Output is correct |
| 2 |
Correct |
1 ms |
256 KB |
Output is correct |
| 3 |
Correct |
1 ms |
256 KB |
Output is correct |
| 4 |
Correct |
1 ms |
384 KB |
Output is correct |
| 5 |
Correct |
1 ms |
384 KB |
Output is correct |
| 6 |
Correct |
1 ms |
384 KB |
Output is correct |
| 7 |
Correct |
1 ms |
256 KB |
Output is correct |
| 8 |
Correct |
1 ms |
384 KB |
Output is correct |
| 9 |
Correct |
1 ms |
384 KB |
Output is correct |
| 10 |
Correct |
1 ms |
256 KB |
Output is correct |
| 11 |
Correct |
1 ms |
384 KB |
Output is correct |
| 12 |
Correct |
2 ms |
384 KB |
Output is correct |
| 13 |
Correct |
1 ms |
384 KB |
Output is correct |
| 14 |
Correct |
2 ms |
372 KB |
Output is correct |
| 15 |
Correct |
2 ms |
256 KB |
Output is correct |
| 16 |
Correct |
1 ms |
256 KB |
Output is correct |
| 17 |
Correct |
1 ms |
384 KB |
Output is correct |
| 18 |
Correct |
1 ms |
256 KB |
Output is correct |
| 19 |
Correct |
1 ms |
384 KB |
Output is correct |
| 20 |
Correct |
1 ms |
256 KB |
Output is correct |
| 21 |
Correct |
1 ms |
256 KB |
Output is correct |
| 22 |
Correct |
1 ms |
256 KB |
Output is correct |
| 23 |
Correct |
1 ms |
256 KB |
Output is correct |
| 24 |
Correct |
1 ms |
256 KB |
Output is correct |
| 25 |
Correct |
1 ms |
256 KB |
Output is correct |
| 26 |
Correct |
1 ms |
256 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
17 ms |
3072 KB |
Output is correct |
| 2 |
Correct |
17 ms |
3072 KB |
Output is correct |
| 3 |
Correct |
48 ms |
7416 KB |
Output is correct |
| 4 |
Correct |
20 ms |
3704 KB |
Output is correct |
| 5 |
Correct |
21 ms |
2816 KB |
Output is correct |
| 6 |
Correct |
22 ms |
2808 KB |
Output is correct |
| 7 |
Correct |
12 ms |
2688 KB |
Output is correct |
| 8 |
Correct |
12 ms |
2720 KB |
Output is correct |
| 9 |
Correct |
30 ms |
7552 KB |
Output is correct |
| 10 |
Correct |
27 ms |
7168 KB |
Output is correct |
| 11 |
Correct |
27 ms |
7160 KB |
Output is correct |
| 12 |
Correct |
30 ms |
7040 KB |
Output is correct |
| 13 |
Correct |
30 ms |
5620 KB |
Output is correct |
| 14 |
Correct |
35 ms |
7552 KB |
Output is correct |
| 15 |
Correct |
20 ms |
3576 KB |
Output is correct |
| 16 |
Correct |
16 ms |
3072 KB |
Output is correct |
| 17 |
Correct |
26 ms |
4472 KB |
Output is correct |
| 18 |
Correct |
26 ms |
4224 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
24 ms |
3840 KB |
Output is correct |
| 2 |
Correct |
24 ms |
3836 KB |
Output is correct |
| 3 |
Execution timed out |
4077 ms |
8068 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
102 ms |
11000 KB |
Output is correct |
| 2 |
Correct |
105 ms |
16400 KB |
Output is correct |
| 3 |
Execution timed out |
4029 ms |
38416 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
