Submission #61141

# Submission time Handle Problem Language Result Execution time Memory
61141 2018-07-25T08:49:31 Z dukati8 Gap (APIO16_gap) C++14
30 / 100
96 ms 3552 KB
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for (int i=a; i<int(b); i++)

long long findGap(int T, int N)
{
	if (T==1) {
		vector<long long> vals;
		long long hi=1e18;
		long long lo=0;
		long long ans1,ans2;
		rep (i,0,(N+1)/2) {
			assert(lo<=hi);
			MinMax(lo,hi,&ans1,&ans2);
			vals.push_back(ans1);
			vals.push_back(ans2);
			lo=ans1+1;
			hi=ans2-1;
		}
		sort(vals.begin(),vals.end());
		long long maxdist=0;
		rep (i,0,vals.size()-1) {
			maxdist=max(maxdist,vals[i+1]-vals[i]);
			//cout << maxdist << endl;
		}
		return maxdist;
	}
	if (T==2) {
		long long NL=N;
		long long one=1;
		vector<long long> vals;
		long long hi,lo;
		MinMax(0,1e18,&lo,&hi);
		//Vi har nu max och min för alla tal.
		long long expdist=(hi-lo)/(NL-one);
		vals.push_back(hi);
		vals.push_back(lo);
		for (long long i=0; i<NL-one;i++) {
			long long start,stop;
			start=lo+one+(i*(hi-lo))/(NL-one);
			stop=start+(hi-lo)/(NL-one);
			//stop=lo+((i+one)*(hi-lo))/(NL-one);
			assert(start<=stop);
			long long ans1,ans2;
			MinMax(start,stop,&ans1,&ans2);
			if (ans1!=-1) vals.push_back(ans1);
			if (ans2!=-1) vals.push_back(ans2);
		}
		sort(vals.begin(),vals.end());
		long long maxdist=0;
		rep (i,0,vals.size()-1) maxdist=max(maxdist,vals[i+1]-vals[i]);
		//assert(maxdist>=expdist);
		return maxdist;
	}

}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:36:13: warning: unused variable 'expdist' [-Wunused-variable]
   long long expdist=(hi-lo)/(NL-one);
             ^~~~~~~
gap.cpp:57:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 4 ms 488 KB Output is correct
3 Correct 3 ms 488 KB Output is correct
4 Correct 3 ms 488 KB Output is correct
5 Correct 2 ms 508 KB Output is correct
6 Correct 3 ms 548 KB Output is correct
7 Correct 3 ms 548 KB Output is correct
8 Correct 2 ms 548 KB Output is correct
9 Correct 3 ms 644 KB Output is correct
10 Correct 3 ms 644 KB Output is correct
11 Correct 4 ms 644 KB Output is correct
12 Correct 5 ms 644 KB Output is correct
13 Correct 5 ms 644 KB Output is correct
14 Correct 5 ms 644 KB Output is correct
15 Correct 4 ms 644 KB Output is correct
16 Correct 22 ms 1128 KB Output is correct
17 Correct 18 ms 1132 KB Output is correct
18 Correct 19 ms 1132 KB Output is correct
19 Correct 23 ms 1132 KB Output is correct
20 Correct 14 ms 1132 KB Output is correct
21 Correct 67 ms 2484 KB Output is correct
22 Correct 79 ms 2556 KB Output is correct
23 Correct 69 ms 2556 KB Output is correct
24 Correct 71 ms 2556 KB Output is correct
25 Correct 77 ms 2556 KB Output is correct
26 Correct 88 ms 2556 KB Output is correct
27 Correct 80 ms 2556 KB Output is correct
28 Correct 80 ms 2556 KB Output is correct
29 Correct 65 ms 2556 KB Output is correct
30 Correct 51 ms 2556 KB Output is correct
31 Correct 2 ms 2556 KB Output is correct
32 Correct 4 ms 2556 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2556 KB Output is correct
2 Incorrect 3 ms 2556 KB Output isn't correct
3 Incorrect 2 ms 2556 KB Output isn't correct
4 Correct 2 ms 2556 KB Output is correct
5 Correct 3 ms 2556 KB Output is correct
6 Incorrect 3 ms 2556 KB Output isn't correct
7 Incorrect 2 ms 2556 KB Output isn't correct
8 Incorrect 3 ms 2556 KB Output isn't correct
9 Incorrect 3 ms 2556 KB Output isn't correct
10 Correct 3 ms 2556 KB Output is correct
11 Incorrect 3 ms 2556 KB Output isn't correct
12 Incorrect 3 ms 2556 KB Output isn't correct
13 Incorrect 5 ms 2556 KB Output isn't correct
14 Incorrect 3 ms 2556 KB Output isn't correct
15 Correct 4 ms 2556 KB Output is correct
16 Incorrect 21 ms 2556 KB Output isn't correct
17 Incorrect 20 ms 2556 KB Output isn't correct
18 Incorrect 19 ms 2556 KB Output isn't correct
19 Incorrect 25 ms 2556 KB Output isn't correct
20 Partially correct 14 ms 2556 KB Partially correct
21 Incorrect 73 ms 2556 KB Output isn't correct
22 Incorrect 74 ms 2556 KB Output isn't correct
23 Incorrect 60 ms 2680 KB Output isn't correct
24 Incorrect 96 ms 2680 KB Output isn't correct
25 Correct 88 ms 3552 KB Output is correct
26 Incorrect 63 ms 3552 KB Output isn't correct
27 Incorrect 70 ms 3552 KB Output isn't correct
28 Incorrect 65 ms 3552 KB Output isn't correct
29 Incorrect 63 ms 3552 KB Output isn't correct
30 Partially correct 50 ms 3552 KB Partially correct
31 Incorrect 2 ms 3552 KB Output isn't correct
32 Incorrect 3 ms 3552 KB Output isn't correct