oj.uz

Submission #30918

# Submission time Handle Problem Language Result Execution time Memory
30918 2017-08-01T06:09:45 Z sean617 Gap (APIO16_gap) C++
46.7911 / 100
 76 ms 7552 KB 
#include "gap.h"
#define SZ 100005
#include <iostream>
#include <algorithm>
#include <vector>
typedef long long ll;

using namespace std;
ll n, x = -1, num = 5, a[SZ];
vector<ll> b;

void f(ll p, ll q) {
	ll mn1, mx1, mn2, mx2;
	mn1 = mx1 = mn2 = mx2 = -1;
	if (p > q || b.size() == n || q - p <= x) return;
	if (q - p <= num) {
		MinMax(p, q, &mn1, &mx1);
		if (mn1 == -1) return;
		b.push_back(mn1);
		if (mn1 != mx1) b.push_back(mx1);
		f(mn1 + 1, mx1 - 1);
	} else {
		ll md = (p + q) / 2;
		MinMax(p, md, &mn1, &mx1);
		if (p < q) MinMax(md + 1, q, &mn2, &mx2);
		if (mn1 == -1 && mx1 == -1 && mn2 == -1 && mx2 == -1) x = max(x, (q + 1) - (p - 1));
		if (mn1 != -1) {
			b.push_back(mn1);
			if (mn1 != mx1) b.push_back(mx1);
			f(mn1 + 1, mx1 - 1);
		}
		if (p < q && mn2 != -1) {
			b.push_back(mn2);
			if (mn2 != mx2) b.push_back(mx2);
			f(mn2 + 1, mx2 - 1);
		}
	}
}

long long findGap(int T, int N)
{
	ll st = 0, en = 1e18, i = 0, j = N - 1, mn, mx, ans;
	n = N;
	if (T == 1) {
		while (i <= j) {
			MinMax(st, en, &mn, &mx);
			a[i] = mn;
			a[j] = mx;
			st = mn + 1;
			en = mx - 1;
			i++;
			j--;
		}
		ans = a[1] - a[0];
		for (i = 1; i < N - 1; i++) {
			ans = max(ans, a[i + 1] - a[i]);
		}
	} else {
		f(st, en);
		sort(b.begin(), b.end());
		ans = 0;
		for (i = 0; i < b.size() - 1; i++) {
			ans = max(ans, b[i + 1] - b[i]);
		}
	}
	return ans;
}

Compilation message

gap.cpp: In function 'void f(ll, ll)':
gap.cpp:15:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if (p > q || b.size() == n || q - p <= x) return;
                        ^
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:62:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (i = 0; i < b.size() - 1; i++) {
                 ^

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 5928 KB Output is correct
2 Correct 0 ms 5928 KB Output is correct
3 Correct 0 ms 5928 KB Output is correct
4 Correct 0 ms 5928 KB Output is correct
5 Correct 0 ms 5928 KB Output is correct
6 Correct 0 ms 5928 KB Output is correct
7 Correct 0 ms 5928 KB Output is correct
8 Correct 0 ms 5928 KB Output is correct
9 Correct 0 ms 5928 KB Output is correct
10 Correct 0 ms 5928 KB Output is correct
11 Correct 0 ms 5928 KB Output is correct
12 Correct 0 ms 5928 KB Output is correct
13 Correct 0 ms 5928 KB Output is correct
14 Correct 0 ms 5928 KB Output is correct
15 Correct 0 ms 5928 KB Output is correct
16 Correct 16 ms 5928 KB Output is correct
17 Correct 13 ms 5928 KB Output is correct
18 Correct 9 ms 5928 KB Output is correct
19 Correct 16 ms 5928 KB Output is correct
20 Correct 6 ms 5928 KB Output is correct
21 Correct 53 ms 5928 KB Output is correct
22 Correct 66 ms 5928 KB Output is correct
23 Correct 63 ms 5928 KB Output is correct
24 Correct 69 ms 5928 KB Output is correct
25 Correct 63 ms 5928 KB Output is correct
26 Correct 76 ms 5928 KB Output is correct
27 Correct 56 ms 5928 KB Output is correct
28 Correct 63 ms 5928 KB Output is correct
29 Correct 49 ms 5928 KB Output is correct
30 Correct 39 ms 5928 KB Output is correct
31 Correct 0 ms 5928 KB Output is correct
32 Correct 0 ms 5928 KB Output is correct

Subtask #2
16.7911082438 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 5928 KB Output is correct
2 Correct 0 ms 5928 KB Output is correct
3 Correct 0 ms 5928 KB Output is correct
4 Correct 0 ms 5928 KB Output is correct
5 Partially correct 0 ms 5928 KB Partially correct
6 Partially correct 0 ms 5928 KB Partially correct
7 Partially correct 0 ms 5928 KB Partially correct
8 Partially correct 0 ms 5928 KB Partially correct
9 Partially correct 0 ms 5928 KB Partially correct
10 Partially correct 0 ms 5928 KB Partially correct
11 Partially correct 0 ms 5928 KB Partially correct
12 Partially correct 0 ms 5928 KB Partially correct
13 Partially correct 0 ms 5928 KB Partially correct
14 Partially correct 0 ms 5928 KB Partially correct
15 Partially correct 0 ms 5928 KB Partially correct
16 Partially correct 9 ms 6400 KB Partially correct
17 Partially correct 13 ms 6204 KB Partially correct
18 Partially correct 13 ms 6204 KB Partially correct
19 Partially correct 13 ms 6400 KB Partially correct
20 Partially correct 13 ms 6400 KB Partially correct
21 Partially correct 39 ms 6784 KB Partially correct
22 Partially correct 63 ms 6784 KB Partially correct
23 Partially correct 49 ms 6784 KB Partially correct
24 Partially correct 53 ms 6784 KB Partially correct
25 Partially correct 56 ms 7552 KB Partially correct
26 Partially correct 66 ms 6784 KB Partially correct
27 Partially correct 59 ms 6784 KB Partially correct
28 Partially correct 56 ms 6784 KB Partially correct
29 Partially correct 56 ms 6784 KB Partially correct
30 Partially correct 59 ms 7552 KB Partially correct
31 Partially correct 0 ms 5928 KB Partially correct
32 Partially correct 0 ms 5928 KB Partially correct