답안 #42645

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
42645 2018-03-01T17:24:01 Z MatheusLealV Gap (APIO16_gap) C++14
46.8129 / 100
82 ms 2660 KB
#include <bits/stdc++.h>
#include "gap.h"
#define N 100005
#define inf 1000000000000000000LL
using namespace std;
typedef long long ll;
 
ll n, v[N], ans[N];
 
vector<ll> val;
 
void solve(ll ini, ll fim)
{
  	if(fim < ini) return;
  
	if(ini == fim)
	{
		val.push_back(ini);
 
		return;
	}
 
	ll mid = (ini + fim)/2;
 
	ll a, b;
 
	MinMax(mid + 1, fim, &a, &b);
 
	if(a != -1 && b != -1)
	{
		val.push_back(a);

		if(a != b) val.push_back(b);

		solve(a + 1, b - 1);
	}
 
	MinMax(ini, mid, &a, &b);
  
	if(a != -1 && b != -1)
	{
		val.push_back(a);

		if(a != b) val.push_back(b);
		
		solve(a + 1, b - 1);
	}
}
 
ll findGap(int T, int N_)
{
	ll best = 0;
 
	if(T == 1)
	{
		n = N_;
 
		ll esq = 0, dir = inf;
 
		for(int i = 1, st = 1, en = n; i <= (n + 1)/2; i++, st ++, en --)
		{
			ll a, b;
 
			MinMax(esq, dir, &a, &b);
 
			esq = a + 1, dir = b - 1;
 
			if(a != -1 && b != -1) ans[st] = a, ans[en] = b;
		}
 
		for(int i = 2; i <= n; i++) best = max(best, ans[i] - ans[i - 1]);
 
		return best;
	}
 
	else
	{
		solve(0, inf);
 
		sort(val.begin(), val.end());
 
		for(int i = 1; i < val.size(); i++) best = max(best, val[i] - val[i - 1]);
 
		return best;
	}
 
}

Compilation message

gap.cpp: In function 'll findGap(int, int)':
gap.cpp:82:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 1; i < val.size(); i++) best = max(best, val[i] - val[i - 1]);
                    ^
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 248 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 2 ms 552 KB Output is correct
4 Correct 1 ms 552 KB Output is correct
5 Correct 2 ms 552 KB Output is correct
6 Correct 2 ms 552 KB Output is correct
7 Correct 2 ms 552 KB Output is correct
8 Correct 2 ms 552 KB Output is correct
9 Correct 1 ms 576 KB Output is correct
10 Correct 2 ms 576 KB Output is correct
11 Correct 2 ms 580 KB Output is correct
12 Correct 2 ms 580 KB Output is correct
13 Correct 2 ms 584 KB Output is correct
14 Correct 2 ms 600 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 15 ms 1004 KB Output is correct
17 Correct 15 ms 1004 KB Output is correct
18 Correct 16 ms 1004 KB Output is correct
19 Correct 15 ms 1108 KB Output is correct
20 Correct 11 ms 1108 KB Output is correct
21 Correct 56 ms 2156 KB Output is correct
22 Correct 54 ms 2192 KB Output is correct
23 Correct 57 ms 2192 KB Output is correct
24 Correct 57 ms 2192 KB Output is correct
25 Correct 45 ms 2232 KB Output is correct
26 Correct 57 ms 2232 KB Output is correct
27 Correct 61 ms 2232 KB Output is correct
28 Correct 61 ms 2232 KB Output is correct
29 Correct 54 ms 2232 KB Output is correct
30 Correct 41 ms 2284 KB Output is correct
31 Correct 2 ms 2284 KB Output is correct
32 Correct 2 ms 2284 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2284 KB Output is correct
2 Correct 2 ms 2284 KB Output is correct
3 Correct 1 ms 2284 KB Output is correct
4 Correct 2 ms 2284 KB Output is correct
5 Partially correct 2 ms 2284 KB Partially correct
6 Partially correct 2 ms 2284 KB Partially correct
7 Partially correct 2 ms 2284 KB Partially correct
8 Partially correct 1 ms 2284 KB Partially correct
9 Partially correct 1 ms 2284 KB Partially correct
10 Partially correct 2 ms 2284 KB Partially correct
11 Partially correct 3 ms 2284 KB Partially correct
12 Partially correct 3 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 3 ms 2284 KB Partially correct
16 Partially correct 21 ms 2284 KB Partially correct
17 Partially correct 21 ms 2284 KB Partially correct
18 Partially correct 21 ms 2284 KB Partially correct
19 Partially correct 22 ms 2284 KB Partially correct
20 Partially correct 13 ms 2284 KB Partially correct
21 Partially correct 77 ms 2532 KB Partially correct
22 Partially correct 79 ms 2564 KB Partially correct
23 Partially correct 76 ms 2604 KB Partially correct
24 Partially correct 80 ms 2604 KB Partially correct
25 Partially correct 63 ms 2604 KB Partially correct
26 Partially correct 81 ms 2660 KB Partially correct
27 Partially correct 82 ms 2660 KB Partially correct
28 Partially correct 79 ms 2660 KB Partially correct
29 Partially correct 78 ms 2660 KB Partially correct
30 Partially correct 49 ms 2660 KB Partially correct
31 Partially correct 2 ms 2660 KB Partially correct
32 Partially correct 1 ms 2660 KB Partially correct