답안 #61085

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
61085 2018-07-25T07:48:50 Z Flugan42 Gap (APIO16_gap) C++14
30 / 100
91 ms 2284 KB
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> ii;
typedef vector<ii> vii;
typedef long double lld;
#define rep(i,a,b) for(ll i = a; i < b; i++)
#define per(i,a,b) for(ll i = a; i >= b; i--)
#define inf 1000000000000000000
#define all(x) x.begin(),x.end()
#define sz(x) (ll)(x).size()
#define trav(a,x) for(auto a : x)

long long findGap(int T, int N)
{
	if (T == 1 || T == 2){
		vi a; a.assign(N,0);
		MinMax(0,inf,&a[0],&a[N-1]);
		ll f=1,l=N-2;
		while (f<=l){
			MinMax(a[f-1]+1,a[l+1]-1,&a[f],&a[l]);
			f++; l--;
		}
		ll best = 0;
		rep(i,1,N) if (a[i]-a[i-1] > best) best = a[i]-a[i-1];
		return best;
	} else {
		return 0;
	}
}
# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 412 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 2 ms 460 KB Output is correct
6 Correct 3 ms 464 KB Output is correct
7 Correct 3 ms 540 KB Output is correct
8 Correct 2 ms 540 KB Output is correct
9 Correct 3 ms 664 KB Output is correct
10 Correct 2 ms 664 KB Output is correct
11 Correct 3 ms 664 KB Output is correct
12 Correct 3 ms 664 KB Output is correct
13 Correct 4 ms 664 KB Output is correct
14 Correct 3 ms 664 KB Output is correct
15 Correct 3 ms 664 KB Output is correct
16 Correct 16 ms 976 KB Output is correct
17 Correct 18 ms 976 KB Output is correct
18 Correct 21 ms 1072 KB Output is correct
19 Correct 16 ms 1072 KB Output is correct
20 Correct 16 ms 1072 KB Output is correct
21 Correct 72 ms 2128 KB Output is correct
22 Correct 64 ms 2128 KB Output is correct
23 Correct 63 ms 2128 KB Output is correct
24 Correct 88 ms 2256 KB Output is correct
25 Correct 59 ms 2256 KB Output is correct
26 Correct 79 ms 2256 KB Output is correct
27 Correct 62 ms 2256 KB Output is correct
28 Correct 65 ms 2256 KB Output is correct
29 Correct 75 ms 2284 KB Output is correct
30 Correct 49 ms 2284 KB Output is correct
31 Correct 3 ms 2284 KB Output is correct
32 Correct 3 ms 2284 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2284 KB Output is correct
2 Partially correct 2 ms 2284 KB Partially correct
3 Partially correct 2 ms 2284 KB Partially correct
4 Partially correct 3 ms 2284 KB Partially correct
5 Partially correct 3 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 3 ms 2284 KB Partially correct
9 Partially correct 3 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 4 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 4 ms 2284 KB Partially correct
16 Partially correct 16 ms 2284 KB Partially correct
17 Partially correct 17 ms 2284 KB Partially correct
18 Partially correct 17 ms 2284 KB Partially correct
19 Partially correct 17 ms 2284 KB Partially correct
20 Partially correct 13 ms 2284 KB Partially correct
21 Incorrect 58 ms 2284 KB Expected int32, but "2500100000" found
22 Incorrect 63 ms 2284 KB Expected int32, but "2500100000" found
23 Incorrect 91 ms 2284 KB Expected int32, but "2500100000" found
24 Incorrect 70 ms 2284 KB Expected int32, but "2500100000" found
25 Incorrect 61 ms 2284 KB Expected int32, but "2500100000" found
26 Incorrect 62 ms 2284 KB Expected int32, but "2500100000" found
27 Incorrect 66 ms 2284 KB Expected int32, but "2500100000" found
28 Incorrect 88 ms 2284 KB Expected int32, but "2500100000" found
29 Incorrect 64 ms 2284 KB Expected int32, but "2500100000" found
30 Incorrect 45 ms 2284 KB Expected int32, but "2500100000" found
31 Partially correct 2 ms 2284 KB Partially correct
32 Partially correct 2 ms 2284 KB Partially correct