Submission #69190

# Submission time Handle Problem Language Result Execution time Memory
69190 2018-08-20T08:52:29 Z FedericoS Gap (APIO16_gap) C++14
52.417 / 100
198 ms 3740 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=10;

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++)
              ~^~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 412 KB Output is correct
4 Correct 3 ms 412 KB Output is correct
5 Correct 3 ms 412 KB Output is correct
6 Correct 3 ms 500 KB Output is correct
7 Correct 4 ms 500 KB Output is correct
8 Correct 3 ms 500 KB Output is correct
9 Correct 4 ms 612 KB Output is correct
10 Correct 3 ms 612 KB Output is correct
11 Correct 3 ms 664 KB Output is correct
12 Correct 3 ms 664 KB Output is correct
13 Correct 3 ms 664 KB Output is correct
14 Correct 4 ms 664 KB Output is correct
15 Correct 4 ms 664 KB Output is correct
16 Correct 21 ms 1132 KB Output is correct
17 Correct 23 ms 1232 KB Output is correct
18 Correct 20 ms 1232 KB Output is correct
19 Correct 25 ms 1232 KB Output is correct
20 Correct 14 ms 1232 KB Output is correct
21 Correct 69 ms 2532 KB Output is correct
22 Correct 88 ms 2532 KB Output is correct
23 Correct 74 ms 2656 KB Output is correct
24 Correct 70 ms 2656 KB Output is correct
25 Correct 80 ms 2656 KB Output is correct
26 Correct 80 ms 2656 KB Output is correct
27 Correct 64 ms 2656 KB Output is correct
28 Correct 86 ms 2656 KB Output is correct
29 Correct 78 ms 2656 KB Output is correct
30 Correct 56 ms 2656 KB Output is correct
31 Correct 3 ms 2656 KB Output is correct
32 Correct 4 ms 2656 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 2656 KB Output is correct
2 Partially correct 3 ms 2656 KB Partially correct
3 Partially correct 5 ms 2656 KB Partially correct
4 Partially correct 3 ms 2656 KB Partially correct
5 Partially correct 2 ms 2656 KB Partially correct
6 Partially correct 2 ms 2656 KB Partially correct
7 Partially correct 2 ms 2656 KB Partially correct
8 Partially correct 3 ms 2656 KB Partially correct
9 Partially correct 2 ms 2656 KB Partially correct
10 Partially correct 4 ms 2656 KB Partially correct
11 Partially correct 6 ms 2656 KB Partially correct
12 Partially correct 7 ms 2656 KB Partially correct
13 Partially correct 4 ms 2656 KB Partially correct
14 Partially correct 5 ms 2656 KB Partially correct
15 Partially correct 4 ms 2656 KB Partially correct
16 Partially correct 43 ms 2656 KB Partially correct
17 Partially correct 34 ms 2656 KB Partially correct
18 Partially correct 35 ms 2656 KB Partially correct
19 Partially correct 37 ms 2656 KB Partially correct
20 Partially correct 20 ms 2656 KB Partially correct
21 Partially correct 176 ms 3740 KB Partially correct
22 Partially correct 133 ms 3740 KB Partially correct
23 Partially correct 134 ms 3740 KB Partially correct
24 Partially correct 142 ms 3740 KB Partially correct
25 Partially correct 112 ms 3740 KB Partially correct
26 Partially correct 198 ms 3740 KB Partially correct
27 Partially correct 131 ms 3740 KB Partially correct
28 Partially correct 155 ms 3740 KB Partially correct
29 Partially correct 159 ms 3740 KB Partially correct
30 Partially correct 59 ms 3740 KB Partially correct
31 Partially correct 3 ms 3740 KB Partially correct
32 Partially correct 2 ms 3740 KB Partially correct