Submission #30737

# Submission time Handle Problem Language Result Execution time Memory
30737 2017-07-26T10:55:05 Z PrOAhMeT Gap (APIO16_gap) C++14
70 / 100
99 ms 6772 KB
#include "gap.h"
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define LL long long
#define st first
#define nd second
#define endl '\n'
using namespace std;

long long findGap(int T, int n)
{
	
	vector<LL> v;
	LL x=-1,y=1e18+1,nx,ny,ret=0,cnt=0;
	if(T==1) {

		while(cnt<n&&x!=y) {
			MinMax(x+1,y-1,&nx,&ny);
			x=nx; y=ny;
			cout<<x<<" "<<y<<endl;
			if(x==-1) break;
			v.pb(x);
			cnt+=2;
			v.pb(y);
		}
		sort(v.begin(),v.end());
		v.resize(unique(v.begin(),v.end())-v.begin());
		/*for(int i=0;i<v.size();++i)
			cout<<v[i]<<" ";
		cout<<endl;*/
		for(int i=1;i<v.size();++i)
			ret=max(ret,v[i]-v[i-1]);

	}
	else {

		LL mn,mx;
		MinMax(0,(LL)(1e18),&mn,&mx);
		LL dif=(mx-mn-1+n-2)/(n-1);
		v.pb(mn);
		v.pb(mx);
		if(dif==0)
			return 1LL;
		for(LL l=mn+1;l<mx;l+=dif) {
			MinMax(l,min(l+dif-1,mx-1),&nx,&ny);
			if(nx!=-1) {
				v.pb(nx);
				if(nx!=ny)
					v.pb(ny);
			}
		}
		sort(v.begin(),v.end());
		for(int i=1;i<v.size();++i)
			ret=max(ret,v[i]-v[i-1]);

	}
	return ret;

}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:33:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=1;i<v.size();++i)
                ^
gap.cpp:55:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=1;i<v.size();++i)
                ^
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 5148 KB Expected EOLN
2 Incorrect 0 ms 5148 KB Expected EOLN
3 Incorrect 0 ms 5148 KB Expected EOLN
4 Incorrect 0 ms 5148 KB Expected EOLN
5 Incorrect 0 ms 5148 KB Expected EOLN
6 Incorrect 0 ms 5148 KB Expected EOLN
7 Incorrect 0 ms 5148 KB Expected EOLN
8 Incorrect 0 ms 5148 KB Expected EOLN
9 Incorrect 0 ms 5148 KB Expected EOLN
10 Incorrect 0 ms 5148 KB Expected EOLN
11 Incorrect 0 ms 5148 KB Expected EOLN
12 Incorrect 0 ms 5148 KB Expected EOLN
13 Incorrect 0 ms 5148 KB Expected EOLN
14 Incorrect 0 ms 5148 KB Expected EOLN
15 Incorrect 0 ms 5148 KB Expected EOLN
16 Incorrect 13 ms 5620 KB Expected EOLN
17 Incorrect 13 ms 5620 KB Expected EOLN
18 Incorrect 16 ms 5620 KB Expected EOLN
19 Incorrect 16 ms 5620 KB Expected EOLN
20 Incorrect 13 ms 5620 KB Expected EOLN
21 Incorrect 73 ms 6772 KB Expected EOLN
22 Incorrect 99 ms 6772 KB Expected EOLN
23 Incorrect 89 ms 6772 KB Expected EOLN
24 Incorrect 86 ms 6772 KB Expected EOLN
25 Incorrect 69 ms 6772 KB Expected EOLN
26 Incorrect 76 ms 6772 KB Expected EOLN
27 Incorrect 73 ms 6772 KB Expected EOLN
28 Incorrect 89 ms 6772 KB Expected EOLN
29 Incorrect 63 ms 6772 KB Expected EOLN
30 Incorrect 53 ms 6772 KB Expected EOLN
31 Incorrect 0 ms 5148 KB Expected EOLN
32 Incorrect 0 ms 5148 KB Expected EOLN
# Verdict Execution time Memory Grader output
1 Correct 0 ms 5148 KB Output is correct
2 Correct 0 ms 5148 KB Output is correct
3 Correct 0 ms 5148 KB Output is correct
4 Correct 0 ms 5148 KB Output is correct
5 Correct 0 ms 5148 KB Output is correct
6 Correct 0 ms 5148 KB Output is correct
7 Correct 0 ms 5148 KB Output is correct
8 Correct 0 ms 5148 KB Output is correct
9 Correct 0 ms 5148 KB Output is correct
10 Correct 0 ms 5148 KB Output is correct
11 Correct 0 ms 5148 KB Output is correct
12 Correct 0 ms 5148 KB Output is correct
13 Correct 0 ms 5148 KB Output is correct
14 Correct 0 ms 5148 KB Output is correct
15 Correct 0 ms 5148 KB Output is correct
16 Correct 19 ms 5620 KB Output is correct
17 Correct 16 ms 5620 KB Output is correct
18 Correct 16 ms 5620 KB Output is correct
19 Correct 16 ms 5620 KB Output is correct
20 Correct 6 ms 5148 KB Output is correct
21 Correct 66 ms 6772 KB Output is correct
22 Correct 69 ms 6772 KB Output is correct
23 Correct 73 ms 6772 KB Output is correct
24 Correct 76 ms 6772 KB Output is correct
25 Correct 69 ms 6772 KB Output is correct
26 Correct 76 ms 6772 KB Output is correct
27 Correct 83 ms 6772 KB Output is correct
28 Correct 69 ms 6772 KB Output is correct
29 Correct 83 ms 6772 KB Output is correct
30 Correct 56 ms 5620 KB Output is correct
31 Correct 0 ms 5148 KB Output is correct
32 Correct 0 ms 5148 KB Output is correct