| # |
제출 시각 |
아이디 |
문제 |
언어 |
결과 |
실행 시간 |
메모리 |
| 30782 |
2017-07-26T13:19:13 Z |
inqr |
Gap (APIO16_gap) |
C++14 |
|
73 ms |
5804 KB |
#include "gap.h"
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define rt insert
#define st first
#define nd second
#define ll long long
#define pii pair < int , int >
#define DB printf("debug\n");
#define umax( x , y ) x = max( x , y )
#define umin( x , y ) x = min( x , y )
#define all(x) x.begin() , x.end()
using namespace std;
long long findGap(int T, int N)
{
if(T==1){
ll a[N];memset(a,0,sizeof(a));
ll l=0,r=N-1;
while(l<=r){
if(l==0 && r==N-1){
MinMax(0,1e18,&a[l],&a[r]);
}
else{
//printf("l=%d r=%d\n",l,r);
MinMax(a[l-1]+1,a[r+1]-1,&a[l],&a[r]);
//else MinMax(a[l-1]+1,1e18,&a[l],NULL);
}
l++,r--;
}
ll ans=0;
for(int i=0;i<N-1;i++){
//printf("i=%d a[i]=%lld a[i+1]=%lld\n",i,a[i],a[i+1]);
umax(ans,a[i+1]-a[i]);
}
return ans;
}
else if(T==2){
ll a[N];memset(a,0,sizeof(a));
ll l=0,r=N-1;
while(l<=r){
if(l==0 && r==N-1){
MinMax(0,1e18,&a[l],&a[r]);
}
else{
//printf("l=%d r=%d\n",l,r);
MinMax(a[l-1]+1,a[r+1]-1,&a[l],&a[r]);
//else MinMax(a[l-1]+1,1e18,&a[l],NULL);
}
l++,r--;
}
ll ans=0;
for(int i=0;i<N-1;i++){
//printf("i=%d a[i]=%lld a[i+1]=%lld\n",i,a[i],a[i+1]);
umax(ans,a[i+1]-a[i]);
}
return ans;
}
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 2 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 3 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 4 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 5 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 6 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 7 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 8 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 9 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 10 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 11 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 12 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 13 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 14 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 15 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 16 |
Correct |
13 ms |
5212 KB |
Output is correct |
| 17 |
Correct |
13 ms |
5212 KB |
Output is correct |
| 18 |
Correct |
16 ms |
5212 KB |
Output is correct |
| 19 |
Correct |
9 ms |
5216 KB |
Output is correct |
| 20 |
Correct |
13 ms |
5216 KB |
Output is correct |
| 21 |
Correct |
56 ms |
5804 KB |
Output is correct |
| 22 |
Correct |
59 ms |
5800 KB |
Output is correct |
| 23 |
Correct |
59 ms |
5804 KB |
Output is correct |
| 24 |
Correct |
63 ms |
5800 KB |
Output is correct |
| 25 |
Correct |
53 ms |
5800 KB |
Output is correct |
| 26 |
Correct |
56 ms |
5800 KB |
Output is correct |
| 27 |
Correct |
53 ms |
5804 KB |
Output is correct |
| 28 |
Correct |
66 ms |
5796 KB |
Output is correct |
| 29 |
Correct |
69 ms |
5800 KB |
Output is correct |
| 30 |
Correct |
39 ms |
5800 KB |
Output is correct |
| 31 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 32 |
Correct |
0 ms |
5144 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 2 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 3 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 4 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 5 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 6 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 7 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 8 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 9 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 10 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 11 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 12 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 13 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 14 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 15 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 16 |
Partially correct |
13 ms |
5212 KB |
Partially correct |
| 17 |
Partially correct |
13 ms |
5212 KB |
Partially correct |
| 18 |
Partially correct |
16 ms |
5212 KB |
Partially correct |
| 19 |
Partially correct |
13 ms |
5216 KB |
Partially correct |
| 20 |
Partially correct |
13 ms |
5216 KB |
Partially correct |
| 21 |
Incorrect |
66 ms |
5796 KB |
Expected int32, but "2500100000" found |
| 22 |
Incorrect |
69 ms |
5800 KB |
Expected int32, but "2500100000" found |
| 23 |
Incorrect |
56 ms |
5796 KB |
Expected int32, but "2500100000" found |
| 24 |
Incorrect |
53 ms |
5804 KB |
Expected int32, but "2500100000" found |
| 25 |
Incorrect |
46 ms |
5800 KB |
Expected int32, but "2500100000" found |
| 26 |
Incorrect |
49 ms |
5800 KB |
Expected int32, but "2500100000" found |
| 27 |
Incorrect |
73 ms |
5800 KB |
Expected int32, but "2500100000" found |
| 28 |
Incorrect |
59 ms |
5804 KB |
Expected int32, but "2500100000" found |
| 29 |
Incorrect |
63 ms |
5796 KB |
Expected int32, but "2500100000" found |
| 30 |
Incorrect |
46 ms |
5800 KB |
Expected int32, but "2500100000" found |
| 31 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 32 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
