# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
619123 | 2022-08-02T10:00:54 Z | mdn2002 | 팀들 (IOI15_teams) | C++14 | 4000 ms | 49312 KB |
#include "teams.h" #include<bits/stdc++.h> using namespace std; int n , a [500005] , b [500005] , m , k [500005] , num [500005]; vector < int > l [500005]; void init(int N, int A[], int B[]) { n = N; for ( int i = 0 ; i < n ; i ++ ) { a [i] = A [i] , b [i] = B [i]; l [ a [i] ] . push_back ( b [i] ); } } int can(int M, int K[]) { m = M; vector < int > v; for ( int i = 0 ; i < m ; i ++ ) { k [i] = K [i]; num [ k [i] ] ++; } multiset < int > s; int f = 1; for ( int i = 0 ; i <= n ; i ++ ) { while ( s . size () ) { if ( * s . begin () < i ) s . erase ( s . begin () ); else break; } for ( auto x : l [i] ) s . insert ( x ); while ( num [i] -- ) { int k = i; while ( k -- ) { if ( s . size () == 0 ) f = 0; if ( f == 0 ) break; s . erase ( s . begin () ); } if ( f == 0 ) break; } if ( f == 0 ) break; } for ( int i = 0 ; i <= n ; i ++ ) num [i] = 0; return f; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 11988 KB | Output is correct |
2 | Correct | 7 ms | 11988 KB | Output is correct |
3 | Correct | 7 ms | 11988 KB | Output is correct |
4 | Correct | 7 ms | 12100 KB | Output is correct |
5 | Correct | 7 ms | 11988 KB | Output is correct |
6 | Correct | 7 ms | 12116 KB | Output is correct |
7 | Correct | 9 ms | 12152 KB | Output is correct |
8 | Correct | 9 ms | 11992 KB | Output is correct |
9 | Correct | 7 ms | 11988 KB | Output is correct |
10 | Correct | 8 ms | 11988 KB | Output is correct |
11 | Correct | 8 ms | 12060 KB | Output is correct |
12 | Correct | 9 ms | 12028 KB | Output is correct |
13 | Correct | 9 ms | 12032 KB | Output is correct |
14 | Correct | 8 ms | 12072 KB | Output is correct |
15 | Correct | 9 ms | 12012 KB | Output is correct |
16 | Correct | 7 ms | 12060 KB | Output is correct |
17 | Correct | 7 ms | 11988 KB | Output is correct |
18 | Correct | 8 ms | 12052 KB | Output is correct |
19 | Correct | 8 ms | 11968 KB | Output is correct |
20 | Correct | 7 ms | 12052 KB | Output is correct |
21 | Correct | 7 ms | 11988 KB | Output is correct |
22 | Correct | 6 ms | 11988 KB | Output is correct |
23 | Correct | 7 ms | 12084 KB | Output is correct |
24 | Correct | 7 ms | 11988 KB | Output is correct |
25 | Correct | 7 ms | 12048 KB | Output is correct |
26 | Correct | 6 ms | 12052 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 20 ms | 16928 KB | Output is correct |
2 | Correct | 21 ms | 17064 KB | Output is correct |
3 | Correct | 46 ms | 19208 KB | Output is correct |
4 | Correct | 22 ms | 17952 KB | Output is correct |
5 | Correct | 22 ms | 15436 KB | Output is correct |
6 | Correct | 20 ms | 15444 KB | Output is correct |
7 | Correct | 12 ms | 15500 KB | Output is correct |
8 | Correct | 12 ms | 15500 KB | Output is correct |
9 | Correct | 36 ms | 20212 KB | Output is correct |
10 | Correct | 33 ms | 19800 KB | Output is correct |
11 | Correct | 32 ms | 19664 KB | Output is correct |
12 | Correct | 29 ms | 19472 KB | Output is correct |
13 | Correct | 31 ms | 18332 KB | Output is correct |
14 | Correct | 40 ms | 20496 KB | Output is correct |
15 | Correct | 43 ms | 18700 KB | Output is correct |
16 | Correct | 20 ms | 16768 KB | Output is correct |
17 | Correct | 28 ms | 16748 KB | Output is correct |
18 | Correct | 29 ms | 16840 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 28 ms | 17660 KB | Output is correct |
2 | Correct | 28 ms | 17692 KB | Output is correct |
3 | Execution timed out | 4053 ms | 19592 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 160 ms | 39008 KB | Output is correct |
2 | Correct | 136 ms | 38980 KB | Output is correct |
3 | Execution timed out | 4008 ms | 49312 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |