답안 #41257

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
41257 2018-02-15T07:41:55 Z Just_Solve_The_Problem Gap (APIO16_gap) C++11
30 / 100
86 ms 2160 KB
#include <gap.h>
#include <bits/stdc++.h> 

// #include "grader.cpp"

#define ll long long

using namespace std;

ll solve1(int n) {
	long long left;
	long long right;
	left = 0;
	right = 1e18;
	long long mn = 0, mx = 1e18;        
	long long vec[n];
	int cnt = 0;
	int cn = n - 1;
	while (cnt <= cn) {
		MinMax(left, right, &mn, &mx);
		vec[cnt++] = mn; 
		if (mn != mx)
			vec[cn--] = mx;
		left = mn + 1;
		right = mx - 1;	
	}                  
	long long ans = 0;
	for (int i = 1; i < n; i++) {         
		if (vec[i] - vec[i - 1] > ans) {
			ans = vec[i] - vec[i - 1];
		}
	}
	return ans;
}

ll findGap(int t, int n) {
	if (t == 1) {
		return solve1(n);
	}
	ll l, r;
	MinMax(0, 1e18, &l, &r);
	if (n == 2) {
		return r - l;
	} else if (r - l + 1 == n) {
		return 1;
	}
	if(r - l + 1 == n + 1) {
		return 2;
	}
	ll dif = (r - l + 1) / n;
	l++; r--;
	ll start = l;
	ll fin = start + dif - 1;
	ll fre = 0;
	ll mx = 0; 
	ll ans = 0;
	while (1) {
		ll l1, r1;
		MinMax(start, fin, &l1, &r1);
		if (l1 == -1) {
			fre += dif;
		} else {
			if (fre != 0) {
				ans = max(ans, fre + mx + (l1 - start + 1));
			}
			fre = 0;             
			mx = fin - r1;
		}
		if (fin == r) break;      
		start = fin + 1;
		fin = min(start + dif - 1, r);
	}
	return ans;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 248 KB Output is correct
2 Correct 2 ms 352 KB Output is correct
3 Correct 1 ms 404 KB Output is correct
4 Correct 2 ms 476 KB Output is correct
5 Correct 2 ms 528 KB Output is correct
6 Correct 1 ms 528 KB Output is correct
7 Correct 1 ms 528 KB Output is correct
8 Correct 2 ms 528 KB Output is correct
9 Correct 1 ms 532 KB Output is correct
10 Correct 1 ms 536 KB Output is correct
11 Correct 2 ms 548 KB Output is correct
12 Correct 2 ms 548 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 3 ms 620 KB Output is correct
15 Correct 2 ms 620 KB Output is correct
16 Correct 15 ms 1004 KB Output is correct
17 Correct 14 ms 1004 KB Output is correct
18 Correct 15 ms 1004 KB Output is correct
19 Correct 15 ms 1008 KB Output is correct
20 Correct 12 ms 1008 KB Output is correct
21 Correct 57 ms 2156 KB Output is correct
22 Correct 56 ms 2156 KB Output is correct
23 Correct 55 ms 2156 KB Output is correct
24 Correct 56 ms 2156 KB Output is correct
25 Correct 48 ms 2156 KB Output is correct
26 Correct 55 ms 2156 KB Output is correct
27 Correct 66 ms 2156 KB Output is correct
28 Correct 55 ms 2156 KB Output is correct
29 Correct 55 ms 2160 KB Output is correct
30 Correct 42 ms 2160 KB Output is correct
31 Correct 1 ms 2160 KB Output is correct
32 Correct 1 ms 2160 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2160 KB Output is correct
2 Correct 2 ms 2160 KB Output is correct
3 Correct 1 ms 2160 KB Output is correct
4 Correct 1 ms 2160 KB Output is correct
5 Correct 1 ms 2160 KB Output is correct
6 Correct 2 ms 2160 KB Output is correct
7 Correct 1 ms 2160 KB Output is correct
8 Correct 2 ms 2160 KB Output is correct
9 Correct 2 ms 2160 KB Output is correct
10 Correct 2 ms 2160 KB Output is correct
11 Correct 3 ms 2160 KB Output is correct
12 Correct 3 ms 2160 KB Output is correct
13 Correct 2 ms 2160 KB Output is correct
14 Correct 2 ms 2160 KB Output is correct
15 Correct 3 ms 2160 KB Output is correct
16 Correct 20 ms 2160 KB Output is correct
17 Correct 19 ms 2160 KB Output is correct
18 Correct 21 ms 2160 KB Output is correct
19 Correct 21 ms 2160 KB Output is correct
20 Partially correct 10 ms 2160 KB Partially correct
21 Correct 74 ms 2160 KB Output is correct
22 Correct 74 ms 2160 KB Output is correct
23 Correct 75 ms 2160 KB Output is correct
24 Correct 80 ms 2160 KB Output is correct
25 Correct 72 ms 2160 KB Output is correct
26 Correct 86 ms 2160 KB Output is correct
27 Correct 75 ms 2160 KB Output is correct
28 Correct 75 ms 2160 KB Output is correct
29 Correct 74 ms 2160 KB Output is correct
30 Partially correct 41 ms 2160 KB Partially correct
31 Incorrect 2 ms 2160 KB Output isn't correct
32 Correct 2 ms 2160 KB Output is correct