oj.uz

Submission #61196

# Submission time Handle Problem Language Result Execution time Memory
61196 2018-07-25T10:47:09 Z Eae02 Gap (APIO16_gap) C++14
49.7181 / 100
 105 ms 6124 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;
	if (max == min + 1)
	{
		gMaxDiff = std::max(gMaxDiff, max - min);
		return;
	}
	
	ll mid = min + (max - min) / 2;
	
	ll s1Min, s1Max;
	MinMax(min + 1, mid - 1, &s1Min, &s1Max);
	bool s1Pop = s1Min != -1;
	
	ll s2Min, s2Max;
	MinMax(mid, 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;
	
	ll s1Diff = s1Max - s1Min;
	ll s2Diff = s2Max - s2Min;
	
	bool travS1 = s1Pop && s1Diff > gMaxDiff;
	bool travS2 = s2Pop && s2Diff > gMaxDiff;
	
	if (travS1 && travS2)
	{
		if (s1Diff > s2Diff)
		{
			maxDiff(s1Min, s1Max);
			if (s2Diff > gMaxDiff)
				maxDiff(s2Min, s2Max);
		}
		else
		{
			maxDiff(s2Min, s2Max);
			if (s1Diff > gMaxDiff)
				maxDiff(s1Min, s1Max);
		}
	}
	else
	{
		if (travS1)
			maxDiff(s1Min, s1Max);
		if (travS2)
			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 2 ms 376 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 2 ms 544 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 3 ms 596 KB Output is correct
8 Correct 2 ms 656 KB Output is correct
9 Correct 3 ms 664 KB Output is correct
10 Correct 2 ms 664 KB Output is correct
11 Correct 4 ms 664 KB Output is correct
12 Correct 3 ms 664 KB Output is correct
13 Correct 4 ms 664 KB Output is correct
14 Correct 4 ms 664 KB Output is correct
15 Correct 5 ms 664 KB Output is correct
16 Correct 20 ms 1004 KB Output is correct
17 Correct 19 ms 1004 KB Output is correct
18 Correct 23 ms 1004 KB Output is correct
19 Correct 18 ms 1100 KB Output is correct
20 Correct 14 ms 1100 KB Output is correct
21 Correct 75 ms 2156 KB Output is correct
22 Correct 69 ms 2156 KB Output is correct
23 Correct 65 ms 2228 KB Output is correct
24 Correct 67 ms 2256 KB Output is correct
25 Correct 67 ms 2256 KB Output is correct
26 Correct 72 ms 2256 KB Output is correct
27 Correct 72 ms 2256 KB Output is correct
28 Correct 84 ms 2256 KB Output is correct
29 Correct 64 ms 2256 KB Output is correct
30 Correct 53 ms 2256 KB Output is correct
31 Correct 3 ms 2256 KB Output is correct
32 Correct 3 ms 2256 KB Output is correct

Subtask #2
19.7180885677 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2256 KB Output is correct
2 Correct 3 ms 2256 KB Output is correct
3 Correct 3 ms 2256 KB Output is correct
4 Correct 3 ms 2256 KB Output is correct
5 Partially correct 3 ms 2256 KB Partially correct
6 Partially correct 4 ms 2256 KB Partially correct
7 Partially correct 4 ms 2256 KB Partially correct
8 Partially correct 2 ms 2256 KB Partially correct
9 Partially correct 2 ms 2256 KB Partially correct
10 Correct 3 ms 2256 KB Output is correct
11 Partially correct 3 ms 2256 KB Partially correct
12 Partially correct 3 ms 2256 KB Partially correct
13 Partially correct 3 ms 2256 KB Partially correct
14 Partially correct 4 ms 2256 KB Partially correct
15 Partially correct 4 ms 2256 KB Partially correct
16 Partially correct 22 ms 2256 KB Partially correct
17 Partially correct 18 ms 2256 KB Partially correct
18 Partially correct 17 ms 2256 KB Partially correct
19 Partially correct 18 ms 2256 KB Partially correct
20 Correct 7 ms 2256 KB Output is correct
21 Partially correct 72 ms 3068 KB Partially correct
22 Partially correct 52 ms 3068 KB Partially correct
23 Partially correct 59 ms 3080 KB Partially correct
24 Partially correct 59 ms 3080 KB Partially correct
25 Partially correct 105 ms 6124 KB Partially correct
26 Partially correct 76 ms 6124 KB Partially correct
27 Partially correct 82 ms 6124 KB Partially correct
28 Partially correct 61 ms 6124 KB Partially correct
29 Partially correct 62 ms 6124 KB Partially correct
30 Correct 20 ms 6124 KB Output is correct
31 Correct 2 ms 6124 KB Output is correct
32 Correct 3 ms 6124 KB Output is correct