답안 #42897

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
42897 2018-03-06T08:02:58 Z PowerOfNinjaGo Gap (APIO16_gap) C++14
100 / 100
101 ms 1528 KB
#include <bits/stdc++.h>
#ifdef atom
#include "grader.cpp"
#else
#include "gap.h"
#endif
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
#define X first
#define Y second
#define vi vector<int>
#define vvi vector< vi >
#define vii vector< ii >
#define mp make_pair
#define pb push_back
long long findGap(int T, int n)
{
	ll left, right;
	MinMax(0, 1e18, &left, &right);
	ll best = 0;
	if(T == 1)
	{
		ll lmin = left, lmax = right;
		for(int i = 2; i< n; i+= 2)
		{
			ll mmin, mmax;
			MinMax(lmin+1, lmax-1, &mmin, &mmax);
			best = max(best, mmin-lmin);
			best = max(best, lmax-mmax);
			lmin = mmin;
			lmax = mmax;
		}
		best = max(best, lmax-lmin);
	}
	else
	{
		ll last = left;
		ll sz = (right-left+n-1)/n;
		for(ll s = left+1, e = left+sz, i = 0; i< n; s+= sz, e+=sz)
		{
			if(e>= right) e = right-1;
			if(s> e) break;
			ll mmin, mmax;
			MinMax(s, e, &mmin, &mmax);
			if(mmin != -1)
			{
				best = max(best, mmin-last);
				last = mmax;
			}
		}
		best = max(best, right-last);
	}
	return best;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 248 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 1 ms 404 KB Output is correct
4 Correct 2 ms 456 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 584 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 2 ms 600 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 728 KB Output is correct
11 Correct 2 ms 728 KB Output is correct
12 Correct 2 ms 728 KB Output is correct
13 Correct 2 ms 728 KB Output is correct
14 Correct 2 ms 728 KB Output is correct
15 Correct 2 ms 728 KB Output is correct
16 Correct 14 ms 732 KB Output is correct
17 Correct 14 ms 732 KB Output is correct
18 Correct 15 ms 732 KB Output is correct
19 Correct 14 ms 732 KB Output is correct
20 Correct 11 ms 732 KB Output is correct
21 Correct 60 ms 1452 KB Output is correct
22 Correct 53 ms 1452 KB Output is correct
23 Correct 54 ms 1452 KB Output is correct
24 Correct 78 ms 1452 KB Output is correct
25 Correct 46 ms 1452 KB Output is correct
26 Correct 53 ms 1452 KB Output is correct
27 Correct 55 ms 1516 KB Output is correct
28 Correct 52 ms 1516 KB Output is correct
29 Correct 52 ms 1516 KB Output is correct
30 Correct 41 ms 1516 KB Output is correct
31 Correct 1 ms 1516 KB Output is correct
32 Correct 1 ms 1516 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1516 KB Output is correct
2 Correct 1 ms 1516 KB Output is correct
3 Correct 1 ms 1516 KB Output is correct
4 Correct 2 ms 1516 KB Output is correct
5 Correct 1 ms 1516 KB Output is correct
6 Correct 1 ms 1516 KB Output is correct
7 Correct 2 ms 1516 KB Output is correct
8 Correct 1 ms 1516 KB Output is correct
9 Correct 1 ms 1516 KB Output is correct
10 Correct 2 ms 1516 KB Output is correct
11 Correct 3 ms 1516 KB Output is correct
12 Correct 2 ms 1516 KB Output is correct
13 Correct 3 ms 1516 KB Output is correct
14 Correct 2 ms 1516 KB Output is correct
15 Correct 2 ms 1516 KB Output is correct
16 Correct 18 ms 1516 KB Output is correct
17 Correct 19 ms 1516 KB Output is correct
18 Correct 19 ms 1516 KB Output is correct
19 Correct 22 ms 1516 KB Output is correct
20 Correct 9 ms 1516 KB Output is correct
21 Correct 92 ms 1516 KB Output is correct
22 Correct 71 ms 1516 KB Output is correct
23 Correct 73 ms 1516 KB Output is correct
24 Correct 100 ms 1516 KB Output is correct
25 Correct 65 ms 1516 KB Output is correct
26 Correct 71 ms 1516 KB Output is correct
27 Correct 70 ms 1516 KB Output is correct
28 Correct 83 ms 1528 KB Output is correct
29 Correct 101 ms 1528 KB Output is correct
30 Correct 38 ms 1528 KB Output is correct
31 Correct 2 ms 1528 KB Output is correct
32 Correct 1 ms 1528 KB Output is correct