| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 912411 |
2024-01-19T12:18:19 Z |
JakobZorz |
Teams (IOI15_teams) |
C++17 |
|
4000 ms |
38608 KB |
#include"teams.h"
#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
using namespace std;
typedef long long ll;
int n;
int a[500000];
int b[500000];
void init(int N,int A[],int B[]){
n=N;
vector<pair<int,int>>vec(n);
for(int i=0;i<n;i++)
vec[i]={A[i],B[i]};
sort(vec.begin(),vec.end());
for(int i=0;i<n;i++){
a[i]=vec[i].first;
b[i]=vec[i].second;
}
}
int can(int m,int k[]){
multiset<int>s;
sort(k,k+m);
int ci=0;
for(int i=0;i<m;i++){
while(ci<n&&a[ci]<=k[i])
s.insert(b[ci++]);
while(s.size()&&*s.begin()<k[i])
s.erase(s.begin());
for(int j=0;j<k[i];j++){
if(s.empty())
return 0;
s.erase(s.begin());
}
}
return 1;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 2 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 3 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 4 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 5 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 6 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 7 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 8 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 9 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 10 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 11 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 12 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 13 |
Correct |
2 ms |
2396 KB |
Output is correct |
| 14 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 15 |
Correct |
1 ms |
2404 KB |
Output is correct |
| 16 |
Correct |
2 ms |
2396 KB |
Output is correct |
| 17 |
Correct |
1 ms |
2496 KB |
Output is correct |
| 18 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 19 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 20 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 21 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 22 |
Correct |
1 ms |
2496 KB |
Output is correct |
| 23 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 24 |
Correct |
1 ms |
2480 KB |
Output is correct |
| 25 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 26 |
Correct |
1 ms |
2396 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
14 ms |
5484 KB |
Output is correct |
| 2 |
Correct |
13 ms |
5468 KB |
Output is correct |
| 3 |
Correct |
33 ms |
9032 KB |
Output is correct |
| 4 |
Correct |
16 ms |
5724 KB |
Output is correct |
| 5 |
Correct |
15 ms |
4956 KB |
Output is correct |
| 6 |
Correct |
16 ms |
4956 KB |
Output is correct |
| 7 |
Correct |
10 ms |
4956 KB |
Output is correct |
| 8 |
Correct |
10 ms |
4952 KB |
Output is correct |
| 9 |
Correct |
22 ms |
9028 KB |
Output is correct |
| 10 |
Correct |
22 ms |
8740 KB |
Output is correct |
| 11 |
Correct |
21 ms |
8780 KB |
Output is correct |
| 12 |
Correct |
22 ms |
8524 KB |
Output is correct |
| 13 |
Correct |
26 ms |
7244 KB |
Output is correct |
| 14 |
Correct |
29 ms |
9236 KB |
Output is correct |
| 15 |
Correct |
16 ms |
5468 KB |
Output is correct |
| 16 |
Correct |
13 ms |
5468 KB |
Output is correct |
| 17 |
Correct |
19 ms |
5964 KB |
Output is correct |
| 18 |
Correct |
20 ms |
5700 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
20 ms |
5724 KB |
Output is correct |
| 2 |
Correct |
18 ms |
5700 KB |
Output is correct |
| 3 |
Execution timed out |
4094 ms |
9672 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
84 ms |
18836 KB |
Output is correct |
| 2 |
Correct |
84 ms |
19048 KB |
Output is correct |
| 3 |
Execution timed out |
4070 ms |
38608 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
