oj.uz

Submission #61161

# Submission time Handle Problem Language Result Execution time Memory
61161 2018-07-25T09:38:11 Z Eae02 Gap (APIO16_gap) C++14
49.7181 / 100
 104 ms 5996 KB 
#include "gap.h"

#include <bits/stdc++.h>

using ll = long long;

ll gMaxDiff = 0;

std::set<ll> found;
int targetCount;

bool checkDone(ll min, ll max)
{
	found.insert(min);
	found.insert(max);
	if (found.size() >= targetCount)
	{
		gMaxDiff = std::max(gMaxDiff, max - min);
		return true;
	}
	return false;
}

void maxDiff(ll min, ll max)
{
	if (checkDone(min, max))
		return;
	
	ll mid = min + (max - min) / 2;
	
	ll s1Min, s1Max;
	MinMax(min + 1, mid, &s1Min, &s1Max);
	bool s1Pop = s1Min != -1;
	
	ll s2Min, s2Max;
	MinMax(mid + 1, max - 1, &s2Min, &s2Max);
	bool s2Pop = s2Min != -1;
	
	if (s1Pop && s2Pop)
	{
		gMaxDiff = std::max(gMaxDiff, s2Min - s1Max);
		gMaxDiff = std::max(gMaxDiff, s1Min - min);
		gMaxDiff = std::max(gMaxDiff, max - s2Max);
	}
	else if (!s1Pop && s2Pop)
	{
		gMaxDiff = std::max(gMaxDiff, s2Min - min);
		gMaxDiff = std::max(gMaxDiff, max - s2Max);
	}
	else if (s1Pop && !s2Pop)
	{
		gMaxDiff = std::max(gMaxDiff, s1Min - min);
		gMaxDiff = std::max(gMaxDiff, max - s1Max);
	}
	else if (!s1Pop && !s2Pop)
	{
		gMaxDiff = std::max(gMaxDiff, max - min);
	}
	
	if (s1Pop && checkDone(s1Min, s1Max))
		return;
	if (s2Pop && checkDone(s2Min, s2Max))
		return;
	
	if (s1Pop && s1Max - s1Min > gMaxDiff)
		maxDiff(s1Min, s1Max);
	if (s2Pop && s2Max - s2Min > gMaxDiff)
		maxDiff(s2Min, s2Max);
}

long long findGap(int T, int N)
{
	if (T == 1)
	{
		ll min = 0;
		ll max = 1000000000000000000;
		
		std::vector<ll> numbers(N);
		for (int i = 0; 2 * i < N; i++)
		{
			ll nextMin, nextMax;
			MinMax(min, max, &nextMin, &nextMax);
			
			numbers[i] = nextMin;
			numbers[numbers.size() - i - 1] = nextMax;
			
			min = nextMin + 1;
			max = nextMax - 1;
		}
		
		for (int i = 1; i < N; i++)
		{
			gMaxDiff = std::max(gMaxDiff, numbers[i] - numbers[i - 1]);
		}
	}
	else
	{
		ll min, max;
		MinMax(0, 1000000000000000000, &min, &max);
		
		targetCount = N;
		
		maxDiff(min, max);
	}
	
	return gMaxDiff;
}

Compilation message

gap.cpp: In function 'bool checkDone(ll, ll)':
gap.cpp:16:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if (found.size() >= targetCount)
      ~~~~~~~~~~~~~^~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 3 ms 524 KB Output is correct
4 Correct 2 ms 524 KB Output is correct
5 Correct 1 ms 524 KB Output is correct
6 Correct 2 ms 524 KB Output is correct
7 Correct 3 ms 636 KB Output is correct
8 Correct 3 ms 656 KB Output is correct
9 Correct 3 ms 656 KB Output is correct
10 Correct 3 ms 656 KB Output is correct
11 Correct 2 ms 656 KB Output is correct
12 Correct 3 ms 656 KB Output is correct
13 Correct 4 ms 656 KB Output is correct
14 Correct 4 ms 656 KB Output is correct
15 Correct 5 ms 656 KB Output is correct
16 Correct 23 ms 1004 KB Output is correct
17 Correct 18 ms 1004 KB Output is correct
18 Correct 21 ms 1016 KB Output is correct
19 Correct 18 ms 1016 KB Output is correct
20 Correct 10 ms 1016 KB Output is correct
21 Correct 65 ms 2160 KB Output is correct
22 Correct 85 ms 2236 KB Output is correct
23 Correct 80 ms 2236 KB Output is correct
24 Correct 70 ms 2236 KB Output is correct
25 Correct 59 ms 2236 KB Output is correct
26 Correct 67 ms 2236 KB Output is correct
27 Correct 68 ms 2236 KB Output is correct
28 Correct 78 ms 2284 KB Output is correct
29 Correct 63 ms 2284 KB Output is correct
30 Correct 49 ms 2284 KB Output is correct
31 Correct 1 ms 2284 KB Output is correct
32 Correct 3 ms 2284 KB Output is correct

Subtask #2
19.7180885677 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2284 KB Output is correct
2 Correct 3 ms 2284 KB Output is correct
3 Correct 3 ms 2284 KB Output is correct
4 Correct 3 ms 2284 KB Output is correct
5 Partially correct 3 ms 2284 KB Partially correct
6 Partially correct 4 ms 2284 KB Partially correct
7 Partially correct 4 ms 2284 KB Partially correct
8 Partially correct 2 ms 2284 KB Partially correct
9 Partially correct 3 ms 2284 KB Partially correct
10 Correct 3 ms 2284 KB Output is correct
11 Partially correct 5 ms 2284 KB Partially correct
12 Partially correct 5 ms 2284 KB Partially correct
13 Partially correct 3 ms 2284 KB Partially correct
14 Partially correct 3 ms 2284 KB Partially correct
15 Partially correct 4 ms 2284 KB Partially correct
16 Partially correct 19 ms 2284 KB Partially correct
17 Partially correct 21 ms 2284 KB Partially correct
18 Partially correct 16 ms 2284 KB Partially correct
19 Partially correct 22 ms 2284 KB Partially correct
20 Correct 7 ms 2284 KB Output is correct
21 Partially correct 63 ms 2924 KB Partially correct
22 Partially correct 56 ms 3052 KB Partially correct
23 Partially correct 67 ms 3076 KB Partially correct
24 Partially correct 62 ms 3180 KB Partially correct
25 Partially correct 104 ms 5996 KB Partially correct
26 Partially correct 66 ms 5996 KB Partially correct
27 Partially correct 82 ms 5996 KB Partially correct
28 Partially correct 69 ms 5996 KB Partially correct
29 Partially correct 57 ms 5996 KB Partially correct
30 Correct 25 ms 5996 KB Output is correct
31 Correct 2 ms 5996 KB Output is correct
32 Correct 4 ms 5996 KB Output is correct