# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
106002 | 2019-04-16T07:17:43 Z | daniel920712 | Gap (APIO16_gap) | C++14 | 78 ms | 3720 KB |
#include <iostream> #include <algorithm> #include "gap.h" using namespace std; int now=0; long long all[100005]; void F(long l,long r) { long long a,b; if(l>r) return; MinMax(l,r,&a,&b); if(a==-1) return ; all[now++]=a; if(a!=b) all[now++]=b; F(a+1,(l+r)/2); F((l+r)/2+1,b); } bool cmp(long long a,long long b) { return a<b; } long long findGap(int T,int N) { long long a,b,l=0,r=N-1,x=0,y=1000000000000000000 ,ans=0; int i; F(x,y); sort(all,all+N,cmp); for(i=1;i<N;i++) ans=max(ans,all[i]-all[i-1]); return ans; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 3 ms | 256 KB | Output isn't correct |
2 | Incorrect | 2 ms | 384 KB | Output isn't correct |
3 | Incorrect | 2 ms | 384 KB | Output isn't correct |
4 | Incorrect | 2 ms | 384 KB | Output isn't correct |
5 | Incorrect | 2 ms | 384 KB | Output isn't correct |
6 | Incorrect | 3 ms | 384 KB | Output isn't correct |
7 | Incorrect | 2 ms | 384 KB | Output isn't correct |
8 | Incorrect | 3 ms | 384 KB | Output isn't correct |
9 | Incorrect | 2 ms | 384 KB | Output isn't correct |
10 | Incorrect | 2 ms | 384 KB | Output isn't correct |
11 | Incorrect | 7 ms | 512 KB | Output isn't correct |
12 | Incorrect | 5 ms | 512 KB | Output isn't correct |
13 | Incorrect | 5 ms | 512 KB | Output isn't correct |
14 | Incorrect | 6 ms | 512 KB | Output isn't correct |
15 | Incorrect | 5 ms | 384 KB | Output isn't correct |
16 | Runtime error | 30 ms | 2552 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
17 | Runtime error | 32 ms | 2524 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
18 | Runtime error | 30 ms | 2424 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
19 | Runtime error | 29 ms | 2424 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
20 | Incorrect | 22 ms | 896 KB | Output isn't correct |
21 | Runtime error | 51 ms | 3704 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
22 | Runtime error | 55 ms | 3720 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
23 | Runtime error | 55 ms | 3716 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
24 | Runtime error | 68 ms | 3644 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
25 | Runtime error | 47 ms | 3636 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
26 | Runtime error | 52 ms | 3588 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
27 | Runtime error | 78 ms | 3704 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
28 | Runtime error | 53 ms | 3572 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
29 | Runtime error | 51 ms | 3576 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
30 | Runtime error | 49 ms | 3660 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
31 | Incorrect | 2 ms | 384 KB | Output isn't correct |
32 | Incorrect | 2 ms | 384 KB | Output isn't correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Partially correct | 2 ms | 384 KB | Partially correct |
2 | Incorrect | 2 ms | 356 KB | Output isn't correct |
3 | Incorrect | 2 ms | 384 KB | Output isn't correct |
4 | Incorrect | 2 ms | 384 KB | Output isn't correct |
5 | Incorrect | 2 ms | 384 KB | Output isn't correct |
6 | Incorrect | 3 ms | 384 KB | Output isn't correct |
7 | Incorrect | 2 ms | 384 KB | Output isn't correct |
8 | Incorrect | 2 ms | 384 KB | Output isn't correct |
9 | Incorrect | 2 ms | 384 KB | Output isn't correct |
10 | Incorrect | 3 ms | 384 KB | Output isn't correct |
11 | Incorrect | 6 ms | 512 KB | Output isn't correct |
12 | Incorrect | 5 ms | 512 KB | Output isn't correct |
13 | Incorrect | 8 ms | 512 KB | Output isn't correct |
14 | Incorrect | 6 ms | 512 KB | Output isn't correct |
15 | Incorrect | 6 ms | 384 KB | Output isn't correct |
16 | Runtime error | 32 ms | 2680 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
17 | Runtime error | 26 ms | 2560 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
18 | Runtime error | 27 ms | 2396 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
19 | Runtime error | 25 ms | 2424 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
20 | Partially correct | 21 ms | 896 KB | Partially correct |
21 | Runtime error | 49 ms | 3704 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
22 | Runtime error | 55 ms | 3704 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
23 | Runtime error | 53 ms | 3704 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
24 | Runtime error | 51 ms | 3704 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
25 | Runtime error | 42 ms | 3676 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
26 | Runtime error | 57 ms | 3704 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
27 | Runtime error | 45 ms | 3704 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
28 | Runtime error | 58 ms | 3704 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
29 | Runtime error | 51 ms | 3680 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
30 | Runtime error | 49 ms | 3704 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
31 | Partially correct | 2 ms | 384 KB | Partially correct |
32 | Partially correct | 2 ms | 384 KB | Partially correct |