# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
125584 |
2019-07-06T02:15:00 Z |
baluteshih |
Teams (IOI15_teams) |
C++14 |
|
4000 ms |
29184 KB |
#include "teams.h"
#include <bits/stdc++.h>
#define pb push_back
#define MP make_pair
#define F first
#define S second
#define MEM(i,j) memset(i,j,sizeof i)
#define ALL(v) v.begin(),v.end()
#define ET cout << "\n"
#define DB(a,s,e) {for(int i=s;i<e;++i) cout << a[i] << " ";ET;}
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
vector<int> v[500005];
void init(int N, int A[], int B[])
{
for(int i=0;i<N;++i)
v[A[i]].pb(B[i]);
}
int can(int M, int K[])
{
priority_queue<int,vector<int>,greater<int>> pq;
vector<int> query;
for(int i=0;i<M;++i)
query.pb(K[i]);
sort(ALL(query));
for(int i=0,nw=1,cnt;i<M;++i)
{
for(;nw<=query[i];++nw)
for(int j:v[nw])
pq.push(j);
for(cnt=query[i];pq.size()&&cnt;pq.pop())
if(pq.top()>=query[i])
--cnt;
if(cnt)
return 0;
}
return 1;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
12 ms |
12024 KB |
Output is correct |
2 |
Correct |
12 ms |
12024 KB |
Output is correct |
3 |
Correct |
14 ms |
12024 KB |
Output is correct |
4 |
Correct |
15 ms |
12024 KB |
Output is correct |
5 |
Correct |
13 ms |
12024 KB |
Output is correct |
6 |
Correct |
13 ms |
12312 KB |
Output is correct |
7 |
Correct |
12 ms |
12024 KB |
Output is correct |
8 |
Correct |
13 ms |
12152 KB |
Output is correct |
9 |
Correct |
13 ms |
12152 KB |
Output is correct |
10 |
Correct |
13 ms |
12024 KB |
Output is correct |
11 |
Correct |
13 ms |
12028 KB |
Output is correct |
12 |
Correct |
13 ms |
12152 KB |
Output is correct |
13 |
Correct |
13 ms |
12152 KB |
Output is correct |
14 |
Correct |
13 ms |
12152 KB |
Output is correct |
15 |
Correct |
13 ms |
12152 KB |
Output is correct |
16 |
Correct |
13 ms |
12152 KB |
Output is correct |
17 |
Correct |
12 ms |
12024 KB |
Output is correct |
18 |
Correct |
12 ms |
12024 KB |
Output is correct |
19 |
Correct |
13 ms |
12024 KB |
Output is correct |
20 |
Correct |
15 ms |
12024 KB |
Output is correct |
21 |
Correct |
12 ms |
12024 KB |
Output is correct |
22 |
Correct |
13 ms |
12024 KB |
Output is correct |
23 |
Correct |
12 ms |
12152 KB |
Output is correct |
24 |
Correct |
12 ms |
12024 KB |
Output is correct |
25 |
Correct |
16 ms |
12024 KB |
Output is correct |
26 |
Correct |
16 ms |
11996 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
31 ms |
14716 KB |
Output is correct |
2 |
Correct |
31 ms |
14684 KB |
Output is correct |
3 |
Correct |
47 ms |
15356 KB |
Output is correct |
4 |
Correct |
35 ms |
15736 KB |
Output is correct |
5 |
Correct |
20 ms |
13432 KB |
Output is correct |
6 |
Correct |
22 ms |
13560 KB |
Output is correct |
7 |
Correct |
18 ms |
13432 KB |
Output is correct |
8 |
Correct |
18 ms |
13432 KB |
Output is correct |
9 |
Correct |
23 ms |
14448 KB |
Output is correct |
10 |
Correct |
22 ms |
14292 KB |
Output is correct |
11 |
Correct |
23 ms |
14028 KB |
Output is correct |
12 |
Correct |
23 ms |
14064 KB |
Output is correct |
13 |
Correct |
28 ms |
13940 KB |
Output is correct |
14 |
Correct |
34 ms |
14704 KB |
Output is correct |
15 |
Correct |
39 ms |
14584 KB |
Output is correct |
16 |
Correct |
30 ms |
14584 KB |
Output is correct |
17 |
Correct |
25 ms |
13688 KB |
Output is correct |
18 |
Correct |
26 ms |
13688 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
39 ms |
15096 KB |
Output is correct |
2 |
Correct |
40 ms |
15024 KB |
Output is correct |
3 |
Execution timed out |
4027 ms |
15944 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
172 ms |
25736 KB |
Output is correct |
2 |
Correct |
241 ms |
25848 KB |
Output is correct |
3 |
Execution timed out |
4051 ms |
29184 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |