답안 #69191

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
69191 2018-08-20T08:53:01 Z FedericoS Gap (APIO16_gap) C++14
42.6852 / 100
635 ms 3756 KB
#include "gap.h"
#include <vector>
#include <iostream>
#include <assert.h>
#include <algorithm>
using namespace std;
typedef long long ll;

ll INF=1e18;
ll S=5e17;
ll K=100;

ll x,y;
vector<ll> V;

void F(ll a, ll b){

	MinMax(a,b,&x,&y);
	if(x==-1)return;

	a=x;
	b=y;
	V.push_back(a);
	V.push_back(b);
	a++;
	b--;

	//if(a==b)F(a,b);
	if(a>=b)
		return;

	ll p=(b-a+K-1)/K;
	for(ll i=a;i<=b;i+=p)
		F(i,min(i+p-1,b));

}

long long findGap(int T, int N)
{

	if(T==1){

		y=INF;
		for(int i=0;i<(N+1)/2;i++){
			MinMax(x,y,&x,&y);
			if(x==-1)break;
			V.push_back(x);
			V.push_back(y);
			x++;
			y--;
			if(x>y)break;
		}
	 
		sort(V.begin(),V.end());
	 
		x=0;
		for(int i=0;i<V.size()-1;i++)
			x=max(x,V[i+1]-V[i]);
	 
		return x;

	}	

	MinMax(INF,INF,&x,&y);
	if(x!=-1)
		V.push_back(INF);

	for(ll i=0;i<INF;i+=S)
		F(i,i+S-1);

	sort(V.begin(),V.end());

	x=0;
	for(int i=0;i<V.size()-1;i++)
		x=max(x,V[i+1]-V[i]);

	/*for(ll d:V)
		cout<<d<<" ";
	cout<<endl;*/

	return x;
}

/*
1 6
1 2 5 7 8 12
*/

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:57:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<V.size()-1;i++)
               ~^~~~~~~~~~~
gap.cpp:74:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<V.size()-1;i++)
              ~^~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 5 ms 488 KB Output is correct
3 Correct 3 ms 488 KB Output is correct
4 Correct 2 ms 492 KB Output is correct
5 Correct 3 ms 612 KB Output is correct
6 Correct 2 ms 624 KB Output is correct
7 Correct 3 ms 624 KB Output is correct
8 Correct 2 ms 624 KB Output is correct
9 Correct 3 ms 624 KB Output is correct
10 Correct 3 ms 624 KB Output is correct
11 Correct 4 ms 624 KB Output is correct
12 Correct 5 ms 624 KB Output is correct
13 Correct 3 ms 624 KB Output is correct
14 Correct 5 ms 624 KB Output is correct
15 Correct 3 ms 624 KB Output is correct
16 Correct 18 ms 1192 KB Output is correct
17 Correct 24 ms 1192 KB Output is correct
18 Correct 19 ms 1256 KB Output is correct
19 Correct 19 ms 1256 KB Output is correct
20 Correct 19 ms 1256 KB Output is correct
21 Correct 65 ms 2524 KB Output is correct
22 Correct 68 ms 2660 KB Output is correct
23 Correct 63 ms 2660 KB Output is correct
24 Correct 84 ms 2660 KB Output is correct
25 Correct 68 ms 2660 KB Output is correct
26 Correct 77 ms 2660 KB Output is correct
27 Correct 72 ms 2660 KB Output is correct
28 Correct 67 ms 2660 KB Output is correct
29 Correct 66 ms 2660 KB Output is correct
30 Correct 63 ms 2660 KB Output is correct
31 Correct 2 ms 2660 KB Output is correct
32 Correct 3 ms 2660 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 2660 KB Output is correct
2 Partially correct 3 ms 2660 KB Partially correct
3 Partially correct 3 ms 2660 KB Partially correct
4 Partially correct 3 ms 2660 KB Partially correct
5 Partially correct 4 ms 2660 KB Partially correct
6 Partially correct 3 ms 2660 KB Partially correct
7 Partially correct 2 ms 2660 KB Partially correct
8 Partially correct 3 ms 2660 KB Partially correct
9 Partially correct 2 ms 2660 KB Partially correct
10 Partially correct 2 ms 2660 KB Partially correct
11 Partially correct 7 ms 2660 KB Partially correct
12 Partially correct 7 ms 2660 KB Partially correct
13 Partially correct 7 ms 2660 KB Partially correct
14 Partially correct 7 ms 2660 KB Partially correct
15 Partially correct 5 ms 2660 KB Partially correct
16 Partially correct 142 ms 2660 KB Partially correct
17 Partially correct 146 ms 2660 KB Partially correct
18 Partially correct 164 ms 2660 KB Partially correct
19 Partially correct 164 ms 2660 KB Partially correct
20 Partially correct 22 ms 2660 KB Partially correct
21 Partially correct 590 ms 3652 KB Partially correct
22 Partially correct 564 ms 3652 KB Partially correct
23 Partially correct 635 ms 3720 KB Partially correct
24 Partially correct 511 ms 3720 KB Partially correct
25 Partially correct 307 ms 3720 KB Partially correct
26 Partially correct 611 ms 3748 KB Partially correct
27 Partially correct 535 ms 3756 KB Partially correct
28 Partially correct 526 ms 3756 KB Partially correct
29 Partially correct 528 ms 3756 KB Partially correct
30 Partially correct 71 ms 3756 KB Partially correct
31 Partially correct 4 ms 3756 KB Partially correct
32 Partially correct 3 ms 3756 KB Partially correct