# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
419821 | 2021-06-07T13:27:29 Z | MohamedAhmed04 | Teams (IOI15_teams) | C++14 | 4000 ms | 53292 KB |
#include <bits/stdc++.h> #include "teams.h" //#include "grader.cpp" using namespace std ; const int MAX = 5e5 + 10 ; vector<int>v[MAX] ; int n ; void init(int N, int A[], int B[]) { n = N ; for(int i = 0 ; i < n ; ++i) v[A[i]].push_back(B[i]) ; } int can(int m, int K[]) { sort(K , K + m) ; multiset<int>s ; int last = 0 ; for(int i = 0 ; i < m ; ++i) { for(int j = last+1 ; j <= K[i] ; ++j) { for(auto &k : v[j]) s.insert(k) ; } while(s.size() && (*s.begin()) < K[i]) s.erase(s.begin()) ; if(s.size() < K[i]) return 0 ; for(int j = 0 ; j < K[i] ; ++j) s.erase(s.begin()) ; last = K[i] ; } return 1 ; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 7 ms | 11980 KB | Output is correct |
2 | Correct | 8 ms | 11980 KB | Output is correct |
3 | Correct | 7 ms | 11980 KB | Output is correct |
4 | Correct | 8 ms | 12036 KB | Output is correct |
5 | Correct | 8 ms | 11980 KB | Output is correct |
6 | Correct | 10 ms | 12048 KB | Output is correct |
7 | Correct | 10 ms | 11924 KB | Output is correct |
8 | Correct | 10 ms | 11980 KB | Output is correct |
9 | Correct | 8 ms | 11980 KB | Output is correct |
10 | Correct | 8 ms | 12040 KB | Output is correct |
11 | Correct | 7 ms | 11980 KB | Output is correct |
12 | Correct | 9 ms | 12036 KB | Output is correct |
13 | Correct | 8 ms | 11980 KB | Output is correct |
14 | Correct | 9 ms | 11980 KB | Output is correct |
15 | Correct | 8 ms | 12032 KB | Output is correct |
16 | Correct | 11 ms | 11980 KB | Output is correct |
17 | Correct | 8 ms | 11980 KB | Output is correct |
18 | Correct | 8 ms | 11980 KB | Output is correct |
19 | Correct | 9 ms | 11980 KB | Output is correct |
20 | Correct | 8 ms | 11996 KB | Output is correct |
21 | Correct | 7 ms | 11980 KB | Output is correct |
22 | Correct | 8 ms | 11980 KB | Output is correct |
23 | Correct | 8 ms | 11980 KB | Output is correct |
24 | Correct | 8 ms | 12040 KB | Output is correct |
25 | Correct | 8 ms | 12028 KB | Output is correct |
26 | Correct | 8 ms | 11980 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 27 ms | 15764 KB | Output is correct |
2 | Correct | 25 ms | 15692 KB | Output is correct |
3 | Correct | 79 ms | 20040 KB | Output is correct |
4 | Correct | 31 ms | 16316 KB | Output is correct |
5 | Correct | 22 ms | 14284 KB | Output is correct |
6 | Correct | 23 ms | 14308 KB | Output is correct |
7 | Correct | 13 ms | 14312 KB | Output is correct |
8 | Correct | 13 ms | 14308 KB | Output is correct |
9 | Correct | 39 ms | 18788 KB | Output is correct |
10 | Correct | 38 ms | 18492 KB | Output is correct |
11 | Correct | 38 ms | 18376 KB | Output is correct |
12 | Correct | 37 ms | 18152 KB | Output is correct |
13 | Correct | 37 ms | 17104 KB | Output is correct |
14 | Correct | 46 ms | 19420 KB | Output is correct |
15 | Correct | 29 ms | 16076 KB | Output is correct |
16 | Correct | 22 ms | 15628 KB | Output is correct |
17 | Correct | 30 ms | 15748 KB | Output is correct |
18 | Correct | 31 ms | 15596 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 34 ms | 16412 KB | Output is correct |
2 | Correct | 33 ms | 16444 KB | Output is correct |
3 | Execution timed out | 4051 ms | 20700 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 194 ms | 31808 KB | Output is correct |
2 | Correct | 197 ms | 31756 KB | Output is correct |
3 | Execution timed out | 4081 ms | 53292 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |