oj.uz

답안 #30790

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
30790 2017-07-26T13:54:46 Z inqr Gap (APIO16_gap) C++14
30 / 100
 99 ms 8964 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));
		MinMax(0,1e18,&a[0],&a[N-1]);
		ll inter=(a[N-1]-a[0])/(N-1);
		//printf("N %d inter %d \n",N,inter);
		vector < pair < ll,ll > > res;
		ll x,y;
		ll ans=0;
		for(ll i=a[0];i<a[N-1];i+=inter+1){
			//printf("%d %d\n",i,i+inter);
			MinMax(i,i+inter,&x,&y);
			if(x!=-1)res.pb(mp(x,y));
		}
		for(ll i=1;i<res.size();i++){
			//printf("i=%d st %lld nd %lld \n",i,res[i].st,res[i].nd);
			ans=max(ans,res[i].st-res[i-1].nd);
		}
		return ans;
	}
}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:51:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(ll i=1;i<res.size();i++){
               ^
gap.cpp:57:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

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 16 ms 5212 KB Output is correct
17 Correct 9 ms 5216 KB Output is correct
18 Correct 9 ms 5212 KB Output is correct
19 Correct 13 ms 5212 KB Output is correct
20 Correct 6 ms 5216 KB Output is correct
21 Correct 49 ms 5800 KB Output is correct
22 Correct 49 ms 5804 KB Output is correct
23 Correct 63 ms 5796 KB Output is correct
24 Correct 56 ms 5800 KB Output is correct
25 Correct 46 ms 5800 KB Output is correct
26 Correct 46 ms 5804 KB Output is correct
27 Correct 56 ms 5800 KB Output is correct
28 Correct 53 ms 5804 KB Output is correct
29 Correct 49 ms 5800 KB Output is correct
30 Correct 36 ms 5804 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 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 5288 KB Output is correct
16 Correct 19 ms 5684 KB Output is correct
17 Correct 16 ms 5684 KB Output is correct
18 Correct 16 ms 5688 KB Output is correct
19 Correct 19 ms 5684 KB Output is correct
20 Correct 6 ms 5216 KB Output is correct
21 Correct 69 ms 7428 KB Output is correct
22 Correct 66 ms 7424 KB Output is correct
23 Correct 69 ms 7420 KB Output is correct
24 Correct 66 ms 7424 KB Output is correct
25 Correct 79 ms 8964 KB Output is correct
26 Correct 69 ms 7420 KB Output is correct
27 Correct 76 ms 7424 KB Output is correct
28 Correct 73 ms 7424 KB Output is correct
29 Correct 99 ms 7420 KB Output is correct
30 Correct 29 ms 6272 KB Output is correct
31 Correct 0 ms 5144 KB Output is correct
32 Correct 0 ms 5144 KB Output is correct