| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 434334 |
2021-06-21T01:17:37 Z |
benedict0724 |
Teams (IOI15_teams) |
C++17 |
|
4000 ms |
19780 KB |
#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> student[100002];
struct state
{
int a, b;
state() :state(0, 0) {}
state(int _a, int _b) : a(_a), b(_b) {}
bool operator < (const state &O) const
{
return b > O.b;
}
};
int idx[100002];
int n;
void init(int N, int A[], int B[])
{
for(int i=0;i<N;i++) student[A[i]].push_back(B[i]);
n = N;
}
int can(int M, int K[]) {
priority_queue<state> pq;
int now = -1;
sort(K, K+M);
for(int i=0;i<M;i++)
{
if(K[i] > now)
{
for(int k=now+1;k<=K[i];k++) for(int j : student[k]) pq.push(state(k, j));
now = K[i];
}
for(int j=0;j<K[i];j++)
{
while(!pq.empty() && pq.top().b < K[i]) pq.pop();
if(pq.empty()) return 0;
pq.pop();
}
}
return 1;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
2636 KB |
Output is correct |
| 2 |
Correct |
2 ms |
2636 KB |
Output is correct |
| 3 |
Correct |
2 ms |
2636 KB |
Output is correct |
| 4 |
Correct |
2 ms |
2636 KB |
Output is correct |
| 5 |
Correct |
2 ms |
2636 KB |
Output is correct |
| 6 |
Correct |
2 ms |
2636 KB |
Output is correct |
| 7 |
Correct |
2 ms |
2636 KB |
Output is correct |
| 8 |
Correct |
3 ms |
2624 KB |
Output is correct |
| 9 |
Correct |
2 ms |
2636 KB |
Output is correct |
| 10 |
Correct |
2 ms |
2636 KB |
Output is correct |
| 11 |
Correct |
2 ms |
2636 KB |
Output is correct |
| 12 |
Correct |
2 ms |
2636 KB |
Output is correct |
| 13 |
Correct |
2 ms |
2636 KB |
Output is correct |
| 14 |
Correct |
2 ms |
2636 KB |
Output is correct |
| 15 |
Correct |
3 ms |
2636 KB |
Output is correct |
| 16 |
Correct |
3 ms |
2636 KB |
Output is correct |
| 17 |
Correct |
2 ms |
2636 KB |
Output is correct |
| 18 |
Correct |
2 ms |
2636 KB |
Output is correct |
| 19 |
Correct |
3 ms |
2636 KB |
Output is correct |
| 20 |
Correct |
2 ms |
2636 KB |
Output is correct |
| 21 |
Correct |
3 ms |
2636 KB |
Output is correct |
| 22 |
Correct |
2 ms |
2764 KB |
Output is correct |
| 23 |
Correct |
2 ms |
2636 KB |
Output is correct |
| 24 |
Correct |
2 ms |
2636 KB |
Output is correct |
| 25 |
Correct |
2 ms |
2636 KB |
Output is correct |
| 26 |
Correct |
2 ms |
2636 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
17 ms |
6388 KB |
Output is correct |
| 2 |
Correct |
19 ms |
6376 KB |
Output is correct |
| 3 |
Correct |
32 ms |
7500 KB |
Output is correct |
| 4 |
Correct |
20 ms |
6860 KB |
Output is correct |
| 5 |
Correct |
13 ms |
4812 KB |
Output is correct |
| 6 |
Correct |
16 ms |
4940 KB |
Output is correct |
| 7 |
Correct |
9 ms |
4812 KB |
Output is correct |
| 8 |
Correct |
8 ms |
4812 KB |
Output is correct |
| 9 |
Correct |
22 ms |
5956 KB |
Output is correct |
| 10 |
Correct |
20 ms |
5620 KB |
Output is correct |
| 11 |
Correct |
19 ms |
5572 KB |
Output is correct |
| 12 |
Correct |
21 ms |
5704 KB |
Output is correct |
| 13 |
Correct |
23 ms |
5708 KB |
Output is correct |
| 14 |
Correct |
28 ms |
6492 KB |
Output is correct |
| 15 |
Correct |
22 ms |
6388 KB |
Output is correct |
| 16 |
Correct |
17 ms |
6204 KB |
Output is correct |
| 17 |
Correct |
18 ms |
5452 KB |
Output is correct |
| 18 |
Correct |
20 ms |
5452 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
27 ms |
7132 KB |
Output is correct |
| 2 |
Correct |
25 ms |
7056 KB |
Output is correct |
| 3 |
Execution timed out |
4088 ms |
8484 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
41 ms |
19780 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
