oj.uz

답안 #30742

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
30742 2017-07-26T11:05:34 Z inqr Gap (APIO16_gap) C++14
30 / 100
 2000 ms 5800 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){
		long long a[N];memset(a,0,sizeof(a));
		int 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--;
		}
		long long 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));
		int l=0,r=N-1;
		ll ans;
		MinMax(0,1e18,&a[l],&a[r]);l++,r--;
		MinMax(a[l-1]+1,a[r+1]-1,&a[l],&a[r]);l++,r--;
		umax(ans,max(a[1]-a[0],a[N-1]-a[N-2]));
		while(l<=r){
			ll x,y;
			MinMax(a[l-1]+1,a[l-1]+1+ans,&x,&y);
			if(x==-1&&y==-1){
				ans++;
			}
			else{
				a[l]=x;
				umax(ans,x-a[l-1]);
				l++;
			}
		}
		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;
}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:41:6: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
   ll ans;
      ^

Subtask #1
30.0 / 30.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 9 ms 5212 KB Output is correct
18 Correct 13 ms 5216 KB Output is correct
19 Correct 16 ms 5212 KB Output is correct
20 Correct 13 ms 5212 KB Output is correct
21 Correct 49 ms 5800 KB Output is correct
22 Correct 49 ms 5796 KB Output is correct
23 Correct 59 ms 5796 KB Output is correct
24 Correct 69 ms 5800 KB Output is correct
25 Correct 56 ms 5800 KB Output is correct
26 Correct 56 ms 5800 KB Output is correct
27 Correct 63 ms 5796 KB Output is correct
28 Correct 63 ms 5800 KB Output is correct
29 Correct 69 ms 5800 KB Output is correct
30 Correct 46 ms 5800 KB Output is correct
31 Correct 0 ms 5144 KB Output is correct
32 Correct 0 ms 5144 KB Output is correct

Subtask #2
0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 5144 KB Output isn't correct
2 Execution timed out 2000 ms 5144 KB Execution timed out
3 Execution timed out 2000 ms 5144 KB Execution timed out
4 Execution timed out 2000 ms 5144 KB Execution timed out
5 Partially correct 0 ms 5144 KB Partially correct
6 Execution timed out 2000 ms 5144 KB Execution timed out
7 Execution timed out 2000 ms 5144 KB Execution timed out
8 Execution timed out 2000 ms 5144 KB Execution timed out
9 Execution timed out 2000 ms 5144 KB Execution timed out
10 Partially correct 36 ms 5144 KB Partially correct
11 Execution timed out 2000 ms 5144 KB Execution timed out
12 Execution timed out 2000 ms 5144 KB Execution timed out
13 Execution timed out 2000 ms 5144 KB Execution timed out
14 Execution timed out 2000 ms 5144 KB Execution timed out
15 Partially correct 0 ms 5144 KB Partially correct
16 Execution timed out 2000 ms 5212 KB Execution timed out
17 Execution timed out 2000 ms 5212 KB Execution timed out
18 Execution timed out 2000 ms 5216 KB Execution timed out
19 Execution timed out 2000 ms 5212 KB Execution timed out
20 Partially correct 93 ms 5216 KB Partially correct
21 Execution timed out 2000 ms 5800 KB Execution timed out
22 Execution timed out 2000 ms 5800 KB Execution timed out
23 Execution timed out 2000 ms 5800 KB Execution timed out
24 Execution timed out 2000 ms 5796 KB Execution timed out
25 Partially correct 69 ms 5796 KB Partially correct
26 Execution timed out 2000 ms 5800 KB Execution timed out
27 Execution timed out 2000 ms 5800 KB Execution timed out
28 Execution timed out 2000 ms 5796 KB Execution timed out
29 Execution timed out 2000 ms 5800 KB Execution timed out
30 Partially correct 159 ms 5796 KB Partially correct
31 Partially correct 0 ms 5144 KB Partially correct
32 Partially correct 0 ms 5144 KB Partially correct