답안 #80659

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
80659 2018-10-22T01:03:12 Z AngelKnows Gap (APIO16_gap) C++14
30 / 100
69 ms 2156 KB
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;

#define ll long long
ll mn,mx;
ll l,r,mid;
ll a[100005];
int h,t;
ll ans;
unsigned long long now,pre;
unsigned long long len;
long long findGap(int T, int N)
{
	if (T==1) {
		h=0,t=N+1;
		l=0,r=1e18+1;
		for (;;) {
			MinMax(l,r,&mn,&mx);
			a[++h]=mn,a[--t]=mx;
			l=mn+1,r=mx-1;
			if (h>=t-1) break;
		}
		for (int i=1;i<=N-1;i++) {
			ll t=a[i+1]-a[i];
			if (t>ans) ans=t;
		}
	} else {
		MinMax(0,1e18+1,&mn,&mx);
		now=mn;
		len=1;
		pre=now;
		ll top=mx;
		while (now+1<=top) {
			ll t=top;
			if (now+len<t) t=now+len; 
			MinMax(now+1,t,&mn,&mx);
			if (mn==-1) {
				now+=len;
				len*=2;
			} else {
				ans=max(ans,mn-(ll)pre);
				now=mx;
				pre=mx;
			}
		}
	}
	return ans;
}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:34:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while (now+1<=top) {
          ~~~~~^~~~~
gap.cpp:36:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if (now+len<t) t=now+len; 
        ~~~~~~~^~
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 440 KB Output is correct
4 Correct 2 ms 488 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 508 KB Output is correct
7 Correct 2 ms 632 KB Output is correct
8 Correct 2 ms 632 KB Output is correct
9 Correct 2 ms 632 KB Output is correct
10 Correct 2 ms 632 KB Output is correct
11 Correct 3 ms 632 KB Output is correct
12 Correct 3 ms 632 KB Output is correct
13 Correct 3 ms 632 KB Output is correct
14 Correct 3 ms 632 KB Output is correct
15 Correct 3 ms 632 KB Output is correct
16 Correct 15 ms 976 KB Output is correct
17 Correct 15 ms 996 KB Output is correct
18 Correct 15 ms 1004 KB Output is correct
19 Correct 16 ms 1004 KB Output is correct
20 Correct 11 ms 1004 KB Output is correct
21 Correct 57 ms 2156 KB Output is correct
22 Correct 60 ms 2156 KB Output is correct
23 Correct 56 ms 2156 KB Output is correct
24 Correct 58 ms 2156 KB Output is correct
25 Correct 49 ms 2156 KB Output is correct
26 Correct 57 ms 2156 KB Output is correct
27 Correct 57 ms 2156 KB Output is correct
28 Correct 57 ms 2156 KB Output is correct
29 Correct 60 ms 2156 KB Output is correct
30 Correct 43 ms 2156 KB Output is correct
31 Correct 2 ms 2156 KB Output is correct
32 Correct 2 ms 2156 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Partially correct 2 ms 2156 KB Partially correct
2 Partially correct 2 ms 2156 KB Partially correct
3 Partially correct 2 ms 2156 KB Partially correct
4 Partially correct 2 ms 2156 KB Partially correct
5 Partially correct 2 ms 2156 KB Partially correct
6 Correct 2 ms 2156 KB Output is correct
7 Correct 2 ms 2156 KB Output is correct
8 Correct 2 ms 2156 KB Output is correct
9 Correct 2 ms 2156 KB Output is correct
10 Correct 2 ms 2156 KB Output is correct
11 Correct 2 ms 2156 KB Output is correct
12 Correct 2 ms 2156 KB Output is correct
13 Correct 2 ms 2156 KB Output is correct
14 Incorrect 3 ms 2156 KB Output isn't correct
15 Partially correct 4 ms 2156 KB Partially correct
16 Incorrect 10 ms 2156 KB Output isn't correct
17 Correct 11 ms 2156 KB Output is correct
18 Correct 11 ms 2156 KB Output is correct
19 Correct 41 ms 2156 KB Output is correct
20 Correct 9 ms 2156 KB Output is correct
21 Correct 36 ms 2156 KB Output is correct
22 Correct 44 ms 2156 KB Output is correct
23 Correct 36 ms 2156 KB Output is correct
24 Correct 35 ms 2156 KB Output is correct
25 Partially correct 69 ms 2156 KB Partially correct
26 Correct 36 ms 2156 KB Output is correct
27 Correct 37 ms 2156 KB Output is correct
28 Correct 35 ms 2156 KB Output is correct
29 Correct 35 ms 2156 KB Output is correct
30 Correct 32 ms 2156 KB Output is correct
31 Partially correct 2 ms 2156 KB Partially correct
32 Correct 2 ms 2156 KB Output is correct