# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
619433 | 2022-08-02T12:00:36 Z | A_D | Teams (IOI15_teams) | C++14 | 4000 ms | 17796 KB |
#include "teams.h" #include<bits/stdc++.h> using namespace std; const int N=1e5+100; int n; vector<pair<int,int>> vec[N]; vector<pair<int,int>> vec2[N]; void init(int N, int A[], int B[]) { n=N; for(int i=0;i<=n;i++){ vec[i].clear(); vec2[i].clear(); } for(int i=0;i<n;i++){ vec[A[i]].push_back({B[i],i}); vec2[B[i]].push_back({B[i],i}); } } int can(int M, int K[]) { set<pair<int,int>> st; sort(K,K+M); int j=0; for(int i=1;i<=n;i++){ for(auto x:vec[i]){ st.insert(x); } if(j==M)break; while(j!=M&&K[j]==i){ if(st.size()<K[j]){ return 0; } int h=K[j]; while(h--){ st.erase(*st.begin()); } j++; } for(auto x:vec2[i]){ if(st.find(x)!=st.end()){ st.erase(x); } } } if(j==M)return 1; else return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 4948 KB | Output is correct |
2 | Correct | 3 ms | 4968 KB | Output is correct |
3 | Correct | 3 ms | 4948 KB | Output is correct |
4 | Correct | 4 ms | 4948 KB | Output is correct |
5 | Correct | 4 ms | 4948 KB | Output is correct |
6 | Correct | 5 ms | 5020 KB | Output is correct |
7 | Correct | 4 ms | 4948 KB | Output is correct |
8 | Correct | 4 ms | 5008 KB | Output is correct |
9 | Correct | 4 ms | 5076 KB | Output is correct |
10 | Correct | 3 ms | 4948 KB | Output is correct |
11 | Correct | 4 ms | 4948 KB | Output is correct |
12 | Correct | 5 ms | 5012 KB | Output is correct |
13 | Correct | 4 ms | 5016 KB | Output is correct |
14 | Correct | 4 ms | 5000 KB | Output is correct |
15 | Correct | 4 ms | 5024 KB | Output is correct |
16 | Correct | 6 ms | 4948 KB | Output is correct |
17 | Correct | 3 ms | 4948 KB | Output is correct |
18 | Correct | 4 ms | 4984 KB | Output is correct |
19 | Correct | 4 ms | 4948 KB | Output is correct |
20 | Correct | 5 ms | 4948 KB | Output is correct |
21 | Correct | 4 ms | 4948 KB | Output is correct |
22 | Correct | 4 ms | 4948 KB | Output is correct |
23 | Correct | 4 ms | 4948 KB | Output is correct |
24 | Correct | 5 ms | 4948 KB | Output is correct |
25 | Correct | 4 ms | 4948 KB | Output is correct |
26 | Correct | 5 ms | 4948 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 43 ms | 9756 KB | Output is correct |
2 | Correct | 41 ms | 9704 KB | Output is correct |
3 | Correct | 95 ms | 12092 KB | Output is correct |
4 | Correct | 38 ms | 10136 KB | Output is correct |
5 | Correct | 27 ms | 8156 KB | Output is correct |
6 | Correct | 27 ms | 8856 KB | Output is correct |
7 | Correct | 11 ms | 8988 KB | Output is correct |
8 | Correct | 14 ms | 8928 KB | Output is correct |
9 | Correct | 42 ms | 12984 KB | Output is correct |
10 | Correct | 46 ms | 12640 KB | Output is correct |
11 | Correct | 43 ms | 12708 KB | Output is correct |
12 | Correct | 33 ms | 12456 KB | Output is correct |
13 | Correct | 54 ms | 11476 KB | Output is correct |
14 | Correct | 77 ms | 13860 KB | Output is correct |
15 | Correct | 40 ms | 11056 KB | Output is correct |
16 | Correct | 29 ms | 10668 KB | Output is correct |
17 | Correct | 32 ms | 9784 KB | Output is correct |
18 | Correct | 33 ms | 9928 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 36 ms | 10076 KB | Output is correct |
2 | Correct | 33 ms | 10124 KB | Output is correct |
3 | Execution timed out | 4030 ms | 12120 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 42 ms | 17796 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |