답안 #1027393

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1027393 2024-07-19T05:41:08 Z Muhammet Gap (APIO16_gap) C++17
30 / 100
39 ms 4408 KB
#include <bits/stdc++.h>
#include "gap.h"

using namespace std;

#define ll long long
#define sz(s) (int)s.size()

ll findGap(int T, int n){
	vector <ll> v, v1;
	for(int i = 0; i < (n+1)/2; i++){
		ll s, t, mn, mx;
		if(i == 0) s = 0, t = 1e18;
		else s = v.back()+1, t = v1.back()-1;
		if(s > t) break;
		MinMax(s, t, &mn, &mx);
		v.push_back(mn);
		v1.push_back(mx);
	}
	if(n % 2 == 1) v1.pop_back();
	while(sz(v1) > 0){
		v.push_back(v1.back());
		v1.pop_back();
	}
	ll ans = 0;
	for(int i = 0; i < n-1; i++){
		ll x = (v[i+1] - v[i]);
		ans = max(ans, x);
	}
	return ans;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 6 ms 1112 KB Output is correct
17 Correct 7 ms 1112 KB Output is correct
18 Correct 8 ms 1112 KB Output is correct
19 Correct 7 ms 964 KB Output is correct
20 Correct 6 ms 1112 KB Output is correct
21 Correct 37 ms 2676 KB Output is correct
22 Correct 29 ms 2676 KB Output is correct
23 Correct 28 ms 4220 KB Output is correct
24 Correct 27 ms 4212 KB Output is correct
25 Correct 39 ms 4212 KB Output is correct
26 Correct 29 ms 4212 KB Output is correct
27 Correct 29 ms 4376 KB Output is correct
28 Correct 38 ms 4344 KB Output is correct
29 Correct 27 ms 4220 KB Output is correct
30 Correct 33 ms 4212 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Partially correct 1 ms 2392 KB Partially correct
3 Partially correct 0 ms 2392 KB Partially correct
4 Partially correct 0 ms 2392 KB Partially correct
5 Partially correct 1 ms 2392 KB Partially correct
6 Partially correct 0 ms 344 KB Partially correct
7 Partially correct 0 ms 344 KB Partially correct
8 Partially correct 1 ms 344 KB Partially correct
9 Partially correct 1 ms 344 KB Partially correct
10 Partially correct 0 ms 344 KB Partially correct
11 Partially correct 1 ms 344 KB Partially correct
12 Partially correct 1 ms 344 KB Partially correct
13 Partially correct 1 ms 344 KB Partially correct
14 Partially correct 1 ms 344 KB Partially correct
15 Partially correct 1 ms 344 KB Partially correct
16 Partially correct 9 ms 944 KB Partially correct
17 Partially correct 10 ms 1112 KB Partially correct
18 Partially correct 9 ms 1076 KB Partially correct
19 Partially correct 8 ms 1112 KB Partially correct
20 Partially correct 5 ms 1112 KB Partially correct
21 Incorrect 26 ms 2684 KB Expected int32, but "2500100000" found
22 Incorrect 27 ms 4408 KB Expected int32, but "2500100000" found
23 Incorrect 27 ms 2684 KB Expected int32, but "2500100000" found
24 Incorrect 27 ms 2680 KB Expected int32, but "2500100000" found
25 Incorrect 31 ms 2684 KB Expected int32, but "2500100000" found
26 Incorrect 35 ms 2684 KB Expected int32, but "2500100000" found
27 Incorrect 26 ms 2684 KB Expected int32, but "2500100000" found
28 Incorrect 36 ms 2660 KB Expected int32, but "2500100000" found
29 Incorrect 26 ms 2684 KB Expected int32, but "2500100000" found
30 Incorrect 22 ms 4220 KB Expected int32, but "2500100000" found
31 Partially correct 0 ms 344 KB Partially correct
32 Partially correct 0 ms 344 KB Partially correct