oj.uz

답안 #974181

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
974181 2024-05-03T04:51:07 Z Halym2007 Gap (APIO16_gap) C++17
30 / 100
 52 ms 5520 KB 
#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
#define ll long long 
#define pb push_back
#define sz size()



//static void my_assert(int k){ 
//	if (!k) exit(1); 
//}
//
//static int subtask_num, N;
//static long long A[100001];
//static long long call_count;

//long long findGap(int, int);

//void MinMax(long long s, long long t, long long *mn, long long *mx) {
//	int lo = 1, hi = N, left = N+1, right = 0;
//	my_assert(s <= t && mn != NULL && mx != NULL);
//	while (lo <= hi){
//		int mid = (lo+hi)>>1;
//		if (A[mid] >= s) hi = mid - 1, left = mid;
//		else lo = mid + 1;
//	}
//	lo = 1, hi = N;
//	while (lo <= hi){
//		int mid = (lo+hi)>>1;
//		if (A[mid] <= t) lo = mid + 1, right = mid;
//		else hi = mid - 1;
//	}
//	if (left > right) *mn = *mx = -1;
//	else{
//		*mn = A[left];
//		*mx = A[right];
//	}
//	if (subtask_num == 1) call_count++;
//	else if (subtask_num == 2) call_count += right-left+2;
//}

ll findGap(int T, int N) {
	vector <ll> v;
	ll l = 0, r = 1e18, mn = 100, mx = 100;
	if (T == 1 or N <= 2) {
		while (1) {
			if ((int)v.sz == N) break;
			MinMax (l, r, &mn, &mx);
			ll x = mn, y = mx;
			if (x == y) {
				v.pb (x);
				break;
			}
			else {
				v.pb (x);v.pb (y);
			}
			l = x + 1;r = y - 1;
		}
	}
	else {
		MinMax (l, r, &mn, &mx);
		ll gosh = mx - mn - 1;
		v.pb (mn);
		gosh = (gosh + N - 2) / (N - 1);
		v.pb (mx);
		ll ok = mn, ko = mx;
		for (ll i = ok + 1; i <= ko - 1; i += gosh) {
			l = i;r = min (gosh + i - 1, ko - 1);
			MinMax (l, r, &mn, &mx);
			v.pb (mn);v.pb (mx);
		}
	}
	ll jog = 0;
	sort (v.begin(), v.end());
	for (int i = 1; i < (int)v.sz; ++i) {
		jog = max (jog, v[i] - v[i - 1]);
	}
	return jog;
}
/*
1  4
2 3 6 8
*/
//int main() {
//	freopen ("input.txt", "r", stdin);
//	FILE *in = stdin, *out = stdout;
//	my_assert(2 == fscanf(in, "%d%d", &subtask_num, &N));
//	my_assert(1 <= subtask_num && subtask_num <= 2);
//	my_assert(2 <= N && N <= 100000);
//	for (int i=1;i<=N;i++) my_assert(1 == fscanf(in, "%lld", A+i));
//	for (int i=1;i<N;i++) my_assert(A[i] < A[i+1]);
//	fprintf(out, "%lld\n", findGap(subtask_num, N));
//	fprintf(out, "%lld\n", call_count);
//}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 0 ms 2392 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 8 ms 2836 KB Output is correct
17 Correct 9 ms 2848 KB Output is correct
18 Correct 10 ms 2992 KB Output is correct
19 Correct 9 ms 2844 KB Output is correct
20 Correct 7 ms 2828 KB Output is correct
21 Correct 31 ms 4152 KB Output is correct
22 Correct 32 ms 3988 KB Output is correct
23 Correct 32 ms 3984 KB Output is correct
24 Correct 32 ms 3860 KB Output is correct
25 Correct 29 ms 3824 KB Output is correct
26 Correct 35 ms 3852 KB Output is correct
27 Correct 32 ms 4008 KB Output is correct
28 Correct 32 ms 3840 KB Output is correct
29 Correct 33 ms 4000 KB Output is correct
30 Correct 27 ms 3992 KB Output is correct
31 Correct 0 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct

Subtask #2
0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 0 ms 2392 KB Output is correct
5 Incorrect 1 ms 2392 KB Output isn't correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2548 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 0 ms 2392 KB Output is correct
10 Correct 0 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Incorrect 1 ms 2392 KB Output isn't correct
16 Correct 11 ms 3228 KB Output is correct
17 Correct 11 ms 3268 KB Output is correct
18 Correct 13 ms 3232 KB Output is correct
19 Correct 11 ms 3224 KB Output is correct
20 Correct 8 ms 3212 KB Output is correct
21 Correct 48 ms 5016 KB Output is correct
22 Correct 47 ms 5004 KB Output is correct
23 Correct 50 ms 5520 KB Output is correct
24 Correct 47 ms 5008 KB Output is correct
25 Incorrect 42 ms 4980 KB Output isn't correct
26 Correct 47 ms 5012 KB Output is correct
27 Correct 46 ms 5012 KB Output is correct
28 Correct 52 ms 4996 KB Output is correct
29 Correct 50 ms 4992 KB Output is correct
30 Correct 31 ms 4996 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 0 ms 2392 KB Output is correct