oj.uz

답안 #30925

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
30925 2017-08-01T06:40:10 Z sean617 Gap (APIO16_gap) C++
100 / 100
 93 ms 7548 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 = -1, 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, tmx;
	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 {
		MinMax(st, en, &mn, &mx);
		x = (mx - mn) / (N - 1);
		if ((mx - mn) % (N - 1) > 0) x++;
		st = mn;
		en = mx;
//		b.push_back(mn);
		tmx = mx;
		for (i = st; i <= en; i += x + 1) {
			j = min(i + x, en);
			MinMax(i, j, &mn, &mx);
			if (mn != -1) {
				b.push_back(mn);
				if (mx != mn) b.push_back(mx);
			}
		}
//		b.push_back(tmx);
		ans = x;
		for (i = 0; i < b.size() - 1; i++) {
			ans = max(ans, b[i + 1] - b[i]);
		}
	}
	return ans;
}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:76:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (i = 0; i < b.size() - 1; i++) {
                 ^
gap.cpp:42:55: warning: variable 'tmx' set but not used [-Wunused-but-set-variable]
  ll st = 0, en = 1e18, i = 0, j = N - 1, mn, mx, ans, tmx;
                                                       ^

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 5924 KB Output is correct
2 Correct 0 ms 5924 KB Output is correct
3 Correct 0 ms 5924 KB Output is correct
4 Correct 0 ms 5924 KB Output is correct
5 Correct 0 ms 5924 KB Output is correct
6 Correct 0 ms 5924 KB Output is correct
7 Correct 0 ms 5924 KB Output is correct
8 Correct 0 ms 5924 KB Output is correct
9 Correct 0 ms 5924 KB Output is correct
10 Correct 0 ms 5924 KB Output is correct
11 Correct 0 ms 5924 KB Output is correct
12 Correct 0 ms 5924 KB Output is correct
13 Correct 0 ms 5924 KB Output is correct
14 Correct 0 ms 5924 KB Output is correct
15 Correct 0 ms 5924 KB Output is correct
16 Correct 9 ms 5924 KB Output is correct
17 Correct 9 ms 5924 KB Output is correct
18 Correct 13 ms 5924 KB Output is correct
19 Correct 16 ms 5924 KB Output is correct
20 Correct 9 ms 5924 KB Output is correct
21 Correct 56 ms 5924 KB Output is correct
22 Correct 69 ms 5924 KB Output is correct
23 Correct 49 ms 5924 KB Output is correct
24 Correct 53 ms 5924 KB Output is correct
25 Correct 43 ms 5924 KB Output is correct
26 Correct 59 ms 5924 KB Output is correct
27 Correct 63 ms 5924 KB Output is correct
28 Correct 53 ms 5924 KB Output is correct
29 Correct 66 ms 5924 KB Output is correct
30 Correct 39 ms 5924 KB Output is correct
31 Correct 0 ms 5924 KB Output is correct
32 Correct 0 ms 5924 KB Output is correct

Subtask #2
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 5924 KB Output is correct
2 Correct 0 ms 5924 KB Output is correct
3 Correct 0 ms 5924 KB Output is correct
4 Correct 0 ms 5924 KB Output is correct
5 Correct 0 ms 5924 KB Output is correct
6 Correct 0 ms 5924 KB Output is correct
7 Correct 0 ms 5924 KB Output is correct
8 Correct 0 ms 5924 KB Output is correct
9 Correct 0 ms 5924 KB Output is correct
10 Correct 0 ms 5924 KB Output is correct
11 Correct 0 ms 5924 KB Output is correct
12 Correct 0 ms 5924 KB Output is correct
13 Correct 0 ms 5924 KB Output is correct
14 Correct 0 ms 5924 KB Output is correct
15 Correct 0 ms 5924 KB Output is correct
16 Correct 19 ms 6396 KB Output is correct
17 Correct 16 ms 6396 KB Output is correct
18 Correct 19 ms 6396 KB Output is correct
19 Correct 19 ms 6396 KB Output is correct
20 Correct 6 ms 5924 KB Output is correct
21 Correct 89 ms 7548 KB Output is correct
22 Correct 79 ms 7548 KB Output is correct
23 Correct 93 ms 7548 KB Output is correct
24 Correct 93 ms 7548 KB Output is correct
25 Correct 79 ms 7548 KB Output is correct
26 Correct 79 ms 7548 KB Output is correct
27 Correct 79 ms 7548 KB Output is correct
28 Correct 86 ms 7548 KB Output is correct
29 Correct 89 ms 7548 KB Output is correct
30 Correct 39 ms 6396 KB Output is correct
31 Correct 0 ms 5924 KB Output is correct
32 Correct 0 ms 5924 KB Output is correct