oj.uz

답안 #978512

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
978512 2024-05-09T09:22:29 Z IUA_Hasin Gap (APIO16_gap) C++17
89.0204 / 100
 46 ms 3632 KB 
#include "gap.h"

#include <bits/stdc++.h>

#define ll						long long

using namespace std;

long long findGap(int T, int N)
{
	if(T==1){
		ll tempa = 0;
		ll tempb = 1e18;
		ll arr[N];
		ll l = 0;
		ll r = N-1;

		// cout<<tempa<< " " << tempb<<endl;

		while(true){
			if(l<=r){
				ll mn, mx;
				MinMax(tempa, tempb, &mn, &mx);
				// cout<<mn<<" "<<mx<<endl;
				mn = (ll)mn;
				mx = (ll)mx;
				if(mn==-1 || mx==-1){
					break;
				} else if(mn==mx){
					arr[l] = mn;
					break;
				} else {
					tempa = (ll)(mn+1);
					tempb = (ll)(mx-1);
					arr[l] = (ll)mn;
					arr[r] = (ll)mx;
					l++;
					r--;
				}
			} else {
				break;
			}
		}

		ll ans = 0;

		// for(int i=0; i<N; i++){
		// 	cout << arr[i] << " ";
		// }
		// cout<<endl;

		for(int i=1; i<N; i++){
			ll temp = (ll)(arr[i]-arr[i-1]);
			ans = (ll)(max(temp, ans));
		}

		ans = (ll)(ans);
		
		return ans;
	} else if(T==2){
		ll mn, mx;
		ll a = 0;
		ll b = 1e18;
		MinMax(a, b, &mn, &mx);

		ll c = mx-mn;
		ll step;
		if(c%(N-1)==0){
			step = c/(N-1);
		} else {
			step = floor(c/N-1)+1;
		}
		
		ll ans = step;
		ll left = mn;
		ll l = mn+1;
		ll r = mx;
		ll x, y;
		while(true){
			ll templ = l;
			ll tempr = l+step;
			if(tempr<mx){
				MinMax(templ, tempr, &x, &y);
				if(x!=-1){
					ans = max(ans, x-left);
					left = y;
				}
			} else {
				break;
			}
			l = tempr+1;
		}

		ll templ = l;
		ll tempr = mx;
		MinMax(templ, tempr, &x, &y);
		if(x!=-1){
			ans = max(ans, x-left);
		}
		return ans;

	}

}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:77:6: warning: unused variable 'r' [-Wunused-variable]
   77 |   ll r = mx;
      |      ^
gap.cpp:104:1: warning: control reaches end of non-void function [-Wreturn-type]
  104 | }
      | ^

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 0 ms 2392 KB Output is correct
5 Correct 0 ms 2392 KB Output is correct
6 Correct 0 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 0 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 2648 KB Output is correct
17 Correct 7 ms 2580 KB Output is correct
18 Correct 8 ms 2584 KB Output is correct
19 Correct 10 ms 2584 KB Output is correct
20 Correct 8 ms 2580 KB Output is correct
21 Correct 30 ms 3620 KB Output is correct
22 Correct 30 ms 3448 KB Output is correct
23 Correct 29 ms 3624 KB Output is correct
24 Correct 29 ms 3628 KB Output is correct
25 Correct 27 ms 3616 KB Output is correct
26 Correct 29 ms 3628 KB Output is correct
27 Correct 30 ms 3632 KB Output is correct
28 Correct 30 ms 3624 KB Output is correct
29 Correct 31 ms 3624 KB Output is correct
30 Correct 25 ms 3624 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct

Subtask #2
59.0203916407 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Partially correct 1 ms 2392 KB Partially correct
4 Correct 0 ms 2392 KB Output is correct
5 Correct 0 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Partially correct 0 ms 2392 KB Partially correct
8 Partially correct 1 ms 2392 KB Partially correct
9 Partially correct 1 ms 2392 KB Partially 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 2 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 10 ms 2756 KB Output is correct
17 Correct 11 ms 2584 KB Output is correct
18 Correct 10 ms 2588 KB Output is correct
19 Correct 12 ms 2592 KB Output is correct
20 Correct 7 ms 2392 KB Output is correct
21 Correct 46 ms 3088 KB Output is correct
22 Correct 41 ms 2856 KB Output is correct
23 Correct 41 ms 2852 KB Output is correct
24 Correct 42 ms 2852 KB Output is correct
25 Correct 40 ms 2868 KB Output is correct
26 Correct 43 ms 2856 KB Output is correct
27 Correct 41 ms 2856 KB Output is correct
28 Correct 41 ms 2856 KB Output is correct
29 Correct 41 ms 2860 KB Output is correct
30 Correct 24 ms 3108 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 0 ms 2392 KB Output is correct