| # |
제출 시각 |
아이디 |
문제 |
언어 |
결과 |
실행 시간 |
메모리 |
| 30807 |
2017-07-26T14:51:44 Z |
kavun |
Gap (APIO16_gap) |
C++14 |
|
1679 ms |
524288 KB |
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[100010], mx;
vector <ll> s;
int n, val, cnt = 2;
void search(int lo, int hi)
{
int m = (lo+hi)/2;
if(cnt == n || lo > hi)
return;
ll one,two;
MinMax(lo,hi,&one,&two);
if(one != -1)
s.push_back(one),cnt++;
if(two != -1 && two != one)
s.push_back(two),cnt++;
search(one+1,m);
search(m+1,two-1);
}
long long findGap(int T, int N)
{
n = N;
val = n % 2 ? n/2+1 : n/2;
if(T == 1)
{
MinMax(0,1e18,a,a + n-1);
for(int i = 1; i < val; i++)
MinMax(a[i-1]+1,a[n-i]-1,a + i,a + n-1-i);
for(int i = 0; i < n-1; i++)
mx = max(mx,a[i+1]-a[i]);
}
else if(T == 2)
{
ll fir,sec;
MinMax(0,1e18,&fir,&sec);
s.push_back(fir),s.push_back(sec);
search(fir+1,sec-1);
sort(s.begin(),s.end());
for(int i = 0; i < n-1; i++)
mx = max(mx,s[i+1]-s[i]);
}
return mx;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
5928 KB |
Output is correct |
| 2 |
Correct |
0 ms |
5928 KB |
Output is correct |
| 3 |
Correct |
0 ms |
5928 KB |
Output is correct |
| 4 |
Correct |
0 ms |
5928 KB |
Output is correct |
| 5 |
Correct |
0 ms |
5928 KB |
Output is correct |
| 6 |
Correct |
0 ms |
5928 KB |
Output is correct |
| 7 |
Correct |
0 ms |
5928 KB |
Output is correct |
| 8 |
Correct |
0 ms |
5928 KB |
Output is correct |
| 9 |
Correct |
0 ms |
5928 KB |
Output is correct |
| 10 |
Correct |
0 ms |
5928 KB |
Output is correct |
| 11 |
Correct |
0 ms |
5928 KB |
Output is correct |
| 12 |
Correct |
0 ms |
5928 KB |
Output is correct |
| 13 |
Correct |
0 ms |
5928 KB |
Output is correct |
| 14 |
Correct |
0 ms |
5928 KB |
Output is correct |
| 15 |
Correct |
0 ms |
5928 KB |
Output is correct |
| 16 |
Correct |
13 ms |
5928 KB |
Output is correct |
| 17 |
Correct |
6 ms |
5928 KB |
Output is correct |
| 18 |
Correct |
13 ms |
5928 KB |
Output is correct |
| 19 |
Correct |
13 ms |
5928 KB |
Output is correct |
| 20 |
Correct |
6 ms |
5928 KB |
Output is correct |
| 21 |
Correct |
69 ms |
5928 KB |
Output is correct |
| 22 |
Correct |
49 ms |
5928 KB |
Output is correct |
| 23 |
Correct |
39 ms |
5928 KB |
Output is correct |
| 24 |
Correct |
73 ms |
5928 KB |
Output is correct |
| 25 |
Correct |
49 ms |
5928 KB |
Output is correct |
| 26 |
Correct |
59 ms |
5928 KB |
Output is correct |
| 27 |
Correct |
56 ms |
5928 KB |
Output is correct |
| 28 |
Correct |
53 ms |
5928 KB |
Output is correct |
| 29 |
Correct |
66 ms |
5928 KB |
Output is correct |
| 30 |
Correct |
49 ms |
5928 KB |
Output is correct |
| 31 |
Correct |
0 ms |
5928 KB |
Output is correct |
| 32 |
Correct |
0 ms |
5928 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
5928 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
5928 KB |
Output isn't correct |
| 3 |
Incorrect |
0 ms |
5928 KB |
Output isn't correct |
| 4 |
Incorrect |
0 ms |
5928 KB |
Output isn't correct |
| 5 |
Memory limit exceeded |
343 ms |
524288 KB |
Memory limit exceeded |
| 6 |
Incorrect |
0 ms |
5928 KB |
Output isn't correct |
| 7 |
Incorrect |
0 ms |
5928 KB |
Output isn't correct |
| 8 |
Incorrect |
0 ms |
5928 KB |
Output isn't correct |
| 9 |
Memory limit exceeded |
566 ms |
524288 KB |
Memory limit exceeded |
| 10 |
Incorrect |
0 ms |
5928 KB |
Output isn't correct |
| 11 |
Incorrect |
0 ms |
5928 KB |
Output isn't correct |
| 12 |
Incorrect |
0 ms |
5928 KB |
Output isn't correct |
| 13 |
Incorrect |
0 ms |
5928 KB |
Output isn't correct |
| 14 |
Incorrect |
0 ms |
5928 KB |
Output isn't correct |
| 15 |
Incorrect |
0 ms |
5928 KB |
Output isn't correct |
| 16 |
Runtime error |
0 ms |
5928 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 17 |
Runtime error |
6 ms |
5928 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 18 |
Runtime error |
3 ms |
5928 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 19 |
Runtime error |
6 ms |
5928 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 20 |
Partially correct |
6 ms |
6400 KB |
Partially correct |
| 21 |
Runtime error |
19 ms |
5928 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 22 |
Memory limit exceeded |
1679 ms |
524288 KB |
Memory limit exceeded |
| 23 |
Runtime error |
19 ms |
5928 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 24 |
Runtime error |
19 ms |
5928 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 25 |
Runtime error |
19 ms |
5928 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 26 |
Memory limit exceeded |
1509 ms |
524288 KB |
Memory limit exceeded |
| 27 |
Runtime error |
26 ms |
5928 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 28 |
Runtime error |
26 ms |
5928 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 29 |
Runtime error |
26 ms |
5928 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 30 |
Partially correct |
63 ms |
7552 KB |
Partially correct |
| 31 |
Incorrect |
0 ms |
5928 KB |
Output isn't correct |
| 32 |
Incorrect |
0 ms |
5928 KB |
Output isn't correct |
