| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 761961 |
2023-06-20T12:51:45 Z |
Dan4Life |
Teams (IOI15_teams) |
C++17 |
|
4000 ms |
9940 KB |
#include <bits/stdc++.h>
using namespace std;
pair<int,int> v[100000]; int n;
multiset<int> S;
void init(int N, int a[], int b[]) {
for(int i = 0; i < N; i++)
v[i]=make_pair(a[i],b[i]);
n = N; sort(v,v+n);
}
int can(int m, int a[]) {
sort(a,a+m);
int j = 0; S.clear();
for(int i = 0; i < m; i++){
int x = a[i];
while(j<n and v[j].first<=a[i])
S.insert(v[j].second), j++;
while(x--){
auto itr = S.lower_bound(a[i]);
if(itr==end(S)) return 0;
S.erase(itr);
}
}
return 1;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
212 KB |
Output is correct |
| 2 |
Correct |
0 ms |
212 KB |
Output is correct |
| 3 |
Correct |
0 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 |
0 ms |
340 KB |
Output is correct |
| 7 |
Correct |
1 ms |
212 KB |
Output is correct |
| 8 |
Correct |
1 ms |
212 KB |
Output is correct |
| 9 |
Correct |
1 ms |
212 KB |
Output is correct |
| 10 |
Correct |
1 ms |
212 KB |
Output is correct |
| 11 |
Correct |
1 ms |
212 KB |
Output is correct |
| 12 |
Correct |
1 ms |
212 KB |
Output is correct |
| 13 |
Correct |
1 ms |
212 KB |
Output is correct |
| 14 |
Correct |
1 ms |
212 KB |
Output is correct |
| 15 |
Correct |
1 ms |
212 KB |
Output is correct |
| 16 |
Correct |
1 ms |
212 KB |
Output is correct |
| 17 |
Correct |
0 ms |
212 KB |
Output is correct |
| 18 |
Correct |
0 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 |
0 ms |
212 KB |
Output is correct |
| 22 |
Correct |
1 ms |
212 KB |
Output is correct |
| 23 |
Correct |
0 ms |
212 KB |
Output is correct |
| 24 |
Correct |
0 ms |
212 KB |
Output is correct |
| 25 |
Correct |
1 ms |
212 KB |
Output is correct |
| 26 |
Correct |
1 ms |
212 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
12 ms |
1876 KB |
Output is correct |
| 2 |
Correct |
12 ms |
1888 KB |
Output is correct |
| 3 |
Correct |
31 ms |
6096 KB |
Output is correct |
| 4 |
Correct |
14 ms |
2260 KB |
Output is correct |
| 5 |
Correct |
16 ms |
1880 KB |
Output is correct |
| 6 |
Correct |
21 ms |
4028 KB |
Output is correct |
| 7 |
Correct |
9 ms |
1820 KB |
Output is correct |
| 8 |
Correct |
9 ms |
1876 KB |
Output is correct |
| 9 |
Correct |
23 ms |
6696 KB |
Output is correct |
| 10 |
Correct |
22 ms |
6644 KB |
Output is correct |
| 11 |
Correct |
22 ms |
6552 KB |
Output is correct |
| 12 |
Correct |
26 ms |
6224 KB |
Output is correct |
| 13 |
Correct |
24 ms |
4484 KB |
Output is correct |
| 14 |
Correct |
28 ms |
6480 KB |
Output is correct |
| 15 |
Correct |
15 ms |
2388 KB |
Output is correct |
| 16 |
Correct |
12 ms |
1880 KB |
Output is correct |
| 17 |
Correct |
20 ms |
3540 KB |
Output is correct |
| 18 |
Correct |
20 ms |
3116 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
17 ms |
2260 KB |
Output is correct |
| 2 |
Correct |
17 ms |
2156 KB |
Output is correct |
| 3 |
Execution timed out |
4062 ms |
6568 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
29 ms |
9940 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
