Submission #107423

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
107423	2019-04-24T07:33:46 Z	OpenTheWindow	Gap (APIO16_gap)	C++14	Compilation error	0 ms	0 KB

gap

#include<iostream>
#include<string>
#include<set>
#include<utility>
#include<vector>
#include<map>
#include<algorithm>
#include<queue>
#include<stack>

#include"gap.h"

using namespace std;


long long findGap(int T, int N){
	long long ans = 0;

	if(T == 1){
		vector<long long> a;

		long long s = 0, t = 1000000000000000000LL;
		while (true)
		{
			long long mn, mx;

			if(a.size() == N) break;

			if(s > t) break;
			MinMax(s, t, &mn, &mx);

			if(mn == -1) break;

			if(mn < mx){
				a.push_back(mn);
				a.push_back(mx);

				s = mn + 1;
				t = mx - 1;

			}
			if(mn == mx){
				a.push_back(mn);
				break;
			}
		}

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

		ans = 0;

		for(int i=0; i<N-1; i++){
			ans = max(ans, a[i+1] - a[i]);
		}


	}
	else{

		vector<long long> a;

		long long ms = 0, mt = 1000000000000000000LL;
		long long mn, mx;

		MinMax(ms, mt, &mn, &mx);

		int tmp = (mx - mn)/N;

		a.push_back(mn);
		a.push_back(mx);

		long long s = mn + 1, t = s + tmp;
		while (true)
		{
			if(t >= mt) break;

			MinMax(s, t, &mn, &mx);

			if(mn < mx){
				a.push_back(mn);
				a.push_back(mx);
			}
			if(mn == mx){
				a.push_back(mn);

			}

			s = t + 1;
			t = s + mn;
			
		}

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

		for(int i=0; i<N-1; i++){
			ans = max(ans, a[i+1] - a[i]);
		}
	}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:27:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if(a.size() == N) break;
       ~~~~~~~~~^~~~
gap.cpp:98:2: error: expected '}' at end of input
  }
  ^
gap.cpp:98:2: warning: no return statement in function returning non-void [-Wreturn-type]