Submission #388993

# Submission time Handle Problem Language Result Execution time Memory
388993 2021-04-13T12:33:14 Z David_M Gap (APIO16_gap) C++14
100 / 100
72 ms 1264 KB
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll INF=1e18;
ll findGap(int T, int N){
	ll mn, mx;
	MinMax(0, INF, &mn, &mx);
	if(N==2)return mx-mn;
	if(T==1){
		ll MN, MX, Ans=0;
		N--;N/=2;
		while(N--)MinMax(mn+1, mx-1, &MN, &MX),Ans=max(Ans, max(mx-MX-(ll)(MX==-1)*INF, MN-mn)),mn=MN,mx=MX;
		return max(Ans, mx-mn);
	}
	ll l=mn, r=mx, ans=(mx-mn+1)/((ll)N)+1, Ans=0, MX=mn;
	for (ll i=0; i<N; i++)
		MinMax(l+1+i*ans, l+(i+1)*ans, &mn, &mx),
		Ans=max(Ans, mn-MX),
		MX=max(MX, mx);
	return Ans;
}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:16:11: warning: unused variable 'r' [-Wunused-variable]
   16 |  ll l=mn, r=mx, ans=(mx-mn+1)/((ll)N)+1, Ans=0, MX=mn;
      |           ^
# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 0 ms 200 KB Output is correct
5 Correct 0 ms 200 KB Output is correct
6 Correct 0 ms 200 KB Output is correct
7 Correct 0 ms 200 KB Output is correct
8 Correct 0 ms 200 KB Output is correct
9 Correct 0 ms 200 KB Output is correct
10 Correct 1 ms 200 KB Output is correct
11 Correct 1 ms 200 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 1 ms 200 KB Output is correct
14 Correct 1 ms 200 KB Output is correct
15 Correct 1 ms 200 KB Output is correct
16 Correct 12 ms 424 KB Output is correct
17 Correct 14 ms 388 KB Output is correct
18 Correct 12 ms 500 KB Output is correct
19 Correct 13 ms 456 KB Output is correct
20 Correct 11 ms 456 KB Output is correct
21 Correct 46 ms 1076 KB Output is correct
22 Correct 44 ms 1056 KB Output is correct
23 Correct 45 ms 1056 KB Output is correct
24 Correct 53 ms 956 KB Output is correct
25 Correct 45 ms 960 KB Output is correct
26 Correct 48 ms 1108 KB Output is correct
27 Correct 49 ms 960 KB Output is correct
28 Correct 48 ms 960 KB Output is correct
29 Correct 46 ms 960 KB Output is correct
30 Correct 35 ms 1064 KB Output is correct
31 Correct 0 ms 200 KB Output is correct
32 Correct 0 ms 200 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 200 KB Output is correct
2 Correct 0 ms 200 KB Output is correct
3 Correct 0 ms 200 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 200 KB Output is correct
6 Correct 0 ms 200 KB Output is correct
7 Correct 0 ms 200 KB Output is correct
8 Correct 0 ms 200 KB Output is correct
9 Correct 1 ms 200 KB Output is correct
10 Correct 1 ms 200 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 2 ms 328 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 1 ms 200 KB Output is correct
16 Correct 15 ms 456 KB Output is correct
17 Correct 15 ms 456 KB Output is correct
18 Correct 17 ms 504 KB Output is correct
19 Correct 15 ms 456 KB Output is correct
20 Correct 8 ms 456 KB Output is correct
21 Correct 63 ms 952 KB Output is correct
22 Correct 63 ms 1040 KB Output is correct
23 Correct 65 ms 960 KB Output is correct
24 Correct 64 ms 1052 KB Output is correct
25 Correct 58 ms 1084 KB Output is correct
26 Correct 72 ms 1264 KB Output is correct
27 Correct 60 ms 988 KB Output is correct
28 Correct 65 ms 960 KB Output is correct
29 Correct 68 ms 1072 KB Output is correct
30 Correct 36 ms 960 KB Output is correct
31 Correct 0 ms 200 KB Output is correct
32 Correct 0 ms 200 KB Output is correct