Submission #978514

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
978514	2024-05-09T09:24:21 Z	IUA_Hasin	Gap (APIO16_gap)	C++17	89.0204 / 100	44 ms	3868 KB

gap

#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;
		if(templ!=tempr){
			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:106:1: warning: control reaches end of non-void function [-Wreturn-type]
  106 | }
      | ^

Subtask #1

30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	2392 KB	Output is correct
3	Correct	0 ms	2392 KB	Output is correct
4	Correct	1 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	1 ms	2392 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	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	2820 KB	Output is correct
17	Correct	7 ms	2572 KB	Output is correct
18	Correct	8 ms	2584 KB	Output is correct
19	Correct	8 ms	2576 KB	Output is correct
20	Correct	6 ms	2548 KB	Output is correct
21	Correct	29 ms	3624 KB	Output is correct
22	Correct	35 ms	3416 KB	Output is correct
23	Correct	29 ms	3624 KB	Output is correct
24	Correct	29 ms	3644 KB	Output is correct
25	Correct	26 ms	3616 KB	Output is correct
26	Correct	29 ms	3624 KB	Output is correct
27	Correct	31 ms	3624 KB	Output is correct
28	Correct	30 ms	3868 KB	Output is correct
29	Correct	29 ms	3628 KB	Output is correct
30	Correct	25 ms	3620 KB	Output is correct
31	Correct	1 ms	2392 KB	Output is correct
32	Correct	0 ms	2392 KB	Output is correct

Subtask #2

59.0203916407 / 70.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	0 ms	2392 KB	Output is correct
3	Partially correct	0 ms	2392 KB	Partially correct
4	Correct	1 ms	2392 KB	Output is correct
5	Correct	1 ms	2392 KB	Output is correct
6	Correct	0 ms	2392 KB	Output is correct
7	Partially correct	1 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	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	10 ms	2752 KB	Output is correct
17	Correct	10 ms	2588 KB	Output is correct
18	Correct	10 ms	2592 KB	Output is correct
19	Correct	10 ms	2584 KB	Output is correct
20	Correct	5 ms	2576 KB	Output is correct
21	Correct	44 ms	3060 KB	Output is correct
22	Correct	40 ms	2856 KB	Output is correct
23	Correct	40 ms	2860 KB	Output is correct
24	Correct	44 ms	2864 KB	Output is correct
25	Correct	38 ms	3088 KB	Output is correct
26	Correct	42 ms	2852 KB	Output is correct
27	Correct	40 ms	2860 KB	Output is correct
28	Correct	41 ms	2852 KB	Output is correct
29	Correct	40 ms	3116 KB	Output is correct
30	Correct	24 ms	2848 KB	Output is correct
31	Correct	1 ms	2392 KB	Output is correct
32	Correct	1 ms	2392 KB	Output is correct