# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
782755 | 2023-07-14T08:58:29 Z | Lyrically | 팀들 (IOI15_teams) | C++17 | 4000 ms | 11476 KB |
#include<bits/stdc++.h> using namespace std; #define pii pair<int,int> #define pb push_back #define rep(i,n) for(int i=0;i<n;i++) #define rep1(i,n) for(int i=1;i<=n;i++) int read(){int x;scanf("%d",&x);return x;} void print(int x){printf("%d\n",x);} void file(string s) { freopen((s+".in").c_str(),"r",stdin); freopen((s+".out").c_str(),"w",stdout); } const int mod=998244353; int n; struct Item { int a,b; bool operator < (Item c) const { return b<c.b; } }p[200005]; void init(int N,int A[],int B[]) { n=N; rep(i,n){p[i+1].a=A[i];} rep(i,n){p[i+1].b=B[i];} sort(p+1,p+n+1); } bool fl[200005]; bool can(int m,int t[]) { sort(t,t+m); rep1(i,n){fl[i]=0;} rep(i,m) { int cnt=0; rep1(j,n) { if(cnt==t[i]){break;} if(!fl[j]) { if(p[j].a<=t[i]&&t[i]<=p[j].b) { fl[j]=1;cnt++; } } } if(cnt!=t[i]){return 0;} } return 1; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 312 KB | Output is correct |
3 | Correct | 0 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 | 320 KB | Output is correct |
7 | Correct | 1 ms | 212 KB | Output is correct |
8 | Correct | 1 ms | 212 KB | Output is correct |
9 | Correct | 1 ms | 212 KB | Output is correct |
10 | Correct | 1 ms | 212 KB | Output is correct |
11 | Correct | 1 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 | 212 KB | Output is correct |
15 | Correct | 1 ms | 212 KB | Output is correct |
16 | Correct | 1 ms | 212 KB | Output is correct |
17 | Correct | 0 ms | 212 KB | Output is correct |
18 | Correct | 1 ms | 212 KB | Output is correct |
19 | Correct | 1 ms | 316 KB | Output is correct |
20 | Correct | 1 ms | 312 KB | Output is correct |
21 | Correct | 0 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 | 316 KB | Output is correct |
26 | Correct | 1 ms | 308 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 14 ms | 2380 KB | Output is correct |
2 | Correct | 16 ms | 2376 KB | Output is correct |
3 | Correct | 12 ms | 2340 KB | Output is correct |
4 | Correct | 14 ms | 2780 KB | Output is correct |
5 | Correct | 18 ms | 2380 KB | Output is correct |
6 | Correct | 17 ms | 2284 KB | Output is correct |
7 | Correct | 10 ms | 2296 KB | Output is correct |
8 | Correct | 9 ms | 2304 KB | Output is correct |
9 | Correct | 1178 ms | 2484 KB | Output is correct |
10 | Correct | 404 ms | 2416 KB | Output is correct |
11 | Correct | 58 ms | 2340 KB | Output is correct |
12 | Correct | 12 ms | 2456 KB | Output is correct |
13 | Correct | 9 ms | 2424 KB | Output is correct |
14 | Correct | 10 ms | 2504 KB | Output is correct |
15 | Correct | 12 ms | 2416 KB | Output is correct |
16 | Correct | 13 ms | 2488 KB | Output is correct |
17 | Correct | 10 ms | 2372 KB | Output is correct |
18 | Correct | 12 ms | 2460 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 64 ms | 3032 KB | Output is correct |
2 | Correct | 81 ms | 3024 KB | Output is correct |
3 | Execution timed out | 4027 ms | 2988 KB | Time limit exceeded |
4 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 34 ms | 11476 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |