# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
831747 | 2023-08-20T13:09:45 Z | jlallas384 | 팀들 (IOI15_teams) | C++17 | 4000 ms | 38392 KB |
#include <bits/stdc++.h> #include "teams.h" using namespace std; vector<pair<int,int>> seg; void init(int N, int A[], int B[]) { for(int i = 0; i < N; i++){ seg.emplace_back(A[i], B[i]); } sort(seg.begin(), seg.end()); } int can(int m, int K[]) { vector<int> k; for(int i = 0; i < m; i++){ k.push_back(K[i]); } sort(k.begin(), k.end()); multiset<int> ms; int ptr = 0; for(int x: k){ while(ptr < seg.size() && seg[ptr].first <= x){ ms.insert(seg[ptr++].second); } while(ms.size() && *ms.begin() < x){ ms.erase(ms.find(*ms.begin())); } if(ms.size() < x) return 0; for(int it = 0; it < x; it++){ ms.erase(ms.find(*ms.begin())); } } return 1; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 300 KB | Output is correct |
3 | Correct | 1 ms | 212 KB | Output is correct |
4 | Correct | 1 ms | 212 KB | Output is correct |
5 | Correct | 1 ms | 212 KB | Output is correct |
6 | Correct | 1 ms | 436 KB | Output is correct |
7 | Correct | 1 ms | 212 KB | Output is correct |
8 | Correct | 1 ms | 212 KB | Output is correct |
9 | Correct | 0 ms | 212 KB | Output is correct |
10 | Correct | 1 ms | 212 KB | Output is correct |
11 | Correct | 0 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 | 300 KB | Output is correct |
15 | Correct | 1 ms | 212 KB | Output is correct |
16 | Correct | 1 ms | 228 KB | Output is correct |
17 | Correct | 1 ms | 212 KB | Output is correct |
18 | Correct | 1 ms | 212 KB | Output is correct |
19 | Correct | 1 ms | 212 KB | Output is correct |
20 | Correct | 0 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 | 1 ms | 212 KB | Output is correct |
24 | Correct | 1 ms | 212 KB | Output is correct |
25 | Correct | 1 ms | 212 KB | Output is correct |
26 | Correct | 1 ms | 300 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 15 ms | 3404 KB | Output is correct |
2 | Correct | 15 ms | 3292 KB | Output is correct |
3 | Correct | 33 ms | 7288 KB | Output is correct |
4 | Correct | 16 ms | 4456 KB | Output is correct |
5 | Correct | 15 ms | 3020 KB | Output is correct |
6 | Correct | 16 ms | 2992 KB | Output is correct |
7 | Correct | 9 ms | 3012 KB | Output is correct |
8 | Correct | 9 ms | 2988 KB | Output is correct |
9 | Correct | 26 ms | 7652 KB | Output is correct |
10 | Correct | 23 ms | 7140 KB | Output is correct |
11 | Correct | 23 ms | 7072 KB | Output is correct |
12 | Correct | 23 ms | 6776 KB | Output is correct |
13 | Correct | 24 ms | 5512 KB | Output is correct |
14 | Correct | 29 ms | 7428 KB | Output is correct |
15 | Correct | 17 ms | 3412 KB | Output is correct |
16 | Correct | 13 ms | 3376 KB | Output is correct |
17 | Correct | 20 ms | 4200 KB | Output is correct |
18 | Correct | 21 ms | 4168 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 18 ms | 3784 KB | Output is correct |
2 | Correct | 19 ms | 3716 KB | Output is correct |
3 | Execution timed out | 4040 ms | 8000 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 84 ms | 16432 KB | Output is correct |
2 | Correct | 82 ms | 16260 KB | Output is correct |
3 | Execution timed out | 4017 ms | 38392 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |