# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
412955 | 2021-05-27T20:54:29 Z | ScarletS | 팀들 (IOI15_teams) | C++17 | 224 ms | 16304 KB |
#include <bits/stdc++.h> using namespace std; const int N = 5e5+7; int n; array<int,2> a[N]; bool cmp(array<int,2>& x, array<int,2> &y) { return x[1] < y[1]; } void init(int N, int A[], int B[]) { n=N; for (int i=0;i<n;++i) a[i]={A[i],B[i]}; sort(a,a+n); } bool can(int m, int k[]) { sort(k,k+m); int c=0, x=0; for (int i=0;i<n&&c<m;++i) if (a[i][0]<=k[c]&&k[c]<=a[i][1]) if (++x==k[c]) x=0,++c; return c==m; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Correct | 1 ms | 204 KB | Output is correct |
3 | Correct | 1 ms | 304 KB | Output is correct |
4 | Correct | 1 ms | 204 KB | Output is correct |
5 | Correct | 1 ms | 204 KB | Output is correct |
6 | Correct | 1 ms | 332 KB | Output is correct |
7 | Correct | 1 ms | 204 KB | Output is correct |
8 | Correct | 1 ms | 296 KB | Output is correct |
9 | Correct | 1 ms | 308 KB | Output is correct |
10 | Incorrect | 1 ms | 204 KB | Output isn't correct |
11 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 22 ms | 3020 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 49 ms | 3692 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 224 ms | 16304 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |