# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
832404 | 2023-08-21T10:02:57 Z | Valaki2 | Teams (IOI15_teams) | C++14 | 4000 ms | 12276 KB |
#include "teams.h" #include <bits/stdc++.h> using namespace std; #define ll long long #define pb push_back #define mp make_pair #define pii pair<int, int> #define fi first #define se second int n; vector<pii> v; void init(int N, int A[], int B[]) { n = N; v.resize(n); for(int i = 0; i < n; i++) { v[i] = mp(A[i], B[i]); } sort(v.begin(), v.end()); } int can(int M, int K[]) { vector<int> s; for(int i = 0; i < M; i++) { s.pb(K[i]); } sort(s.begin(), s.end()); int ptr = 0; priority_queue<int> q; for(int cur : s) { while(ptr < n && v[ptr].fi <= cur) { q.push(-v[ptr].se); ptr++; } while(!q.empty() && -q.top() < cur) { q.pop(); } if(q.size() < cur) { return 0; } for(int i = 0; i < cur; i++) { q.pop(); } } return 1; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 1 ms | 212 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 0 ms | 212 KB | Output is correct |
5 | Correct | 0 ms | 212 KB | Output is correct |
6 | Correct | 1 ms | 468 KB | Output is correct |
7 | Correct | 0 ms | 212 KB | Output is correct |
8 | Correct | 1 ms | 212 KB | Output is correct |
9 | Correct | 1 ms | 296 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 | 300 KB | Output is correct |
19 | Correct | 1 ms | 212 KB | Output is correct |
20 | Correct | 1 ms | 212 KB | Output is correct |
21 | Correct | 1 ms | 212 KB | Output is correct |
22 | Correct | 1 ms | 212 KB | Output is correct |
23 | Correct | 0 ms | 300 KB | Output is correct |
24 | Correct | 1 ms | 212 KB | Output is correct |
25 | Correct | 0 ms | 212 KB | Output is correct |
26 | Correct | 0 ms | 212 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 12 ms | 1876 KB | Output is correct |
2 | Correct | 13 ms | 1884 KB | Output is correct |
3 | Correct | 18 ms | 2520 KB | Output is correct |
4 | Correct | 15 ms | 4236 KB | Output is correct |
5 | Correct | 10 ms | 2644 KB | Output is correct |
6 | Correct | 12 ms | 2644 KB | Output is correct |
7 | Correct | 9 ms | 2644 KB | Output is correct |
8 | Correct | 9 ms | 2644 KB | Output is correct |
9 | Correct | 9 ms | 3548 KB | Output is correct |
10 | Correct | 7 ms | 3124 KB | Output is correct |
11 | Correct | 7 ms | 3116 KB | Output is correct |
12 | Correct | 8 ms | 3152 KB | Output is correct |
13 | Correct | 14 ms | 3076 KB | Output is correct |
14 | Correct | 13 ms | 3416 KB | Output is correct |
15 | Correct | 13 ms | 3100 KB | Output is correct |
16 | Correct | 13 ms | 3008 KB | Output is correct |
17 | Correct | 13 ms | 3204 KB | Output is correct |
18 | Correct | 13 ms | 3168 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 19 ms | 2260 KB | Output is correct |
2 | Correct | 17 ms | 2260 KB | Output is correct |
3 | Execution timed out | 4078 ms | 2780 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 80 ms | 8796 KB | Output is correct |
2 | Correct | 80 ms | 8892 KB | Output is correct |
3 | Execution timed out | 4059 ms | 12276 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |