Submission #49813

# Submission time Handle Problem Language Result Execution time Memory
49813 2018-06-03T09:52:25 Z hamzqq9 Gap (APIO16_gap) C++14
0 / 100
114 ms 3588 KB
#include "gap.h"
#include<bits/stdc++.h>
#define lf double
#define ll long long
#define cc pair<char,char>
#define ull unsigned ll
#define ii pair<int,int>
#define li pair<ll,int>
#define iii pair<int,ii>
#define iiii pair<ii,ii>
#define iiii2 pair<int,iii>
#define lii pair<ll,ii>
#define lolo pair<ll,ll>
#define heap priority_queue
#define mp make_pair
#define st first
#define nd second
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define all(x) x.begin(),x.end()
#define len(x) strlen(x)
#define sz(x) (int) x.size()
#define orta ((bas+son)/2)
#define min3(x,y,z) min(min(x,y),z)
#define max3(x,y,z) max(max(x,y),z)
#define umin(x,y) x=min(x,y)
#define umax(x,y) x=max(x,y)
#define dbgs(x) cerr<<(#x)<<" --> "<<(x)<<" "
#define dbg(x) cerr<<(#x)<<" --> "<<(x)<<endl;getchar()
#define MOD 998244353
#define inf 1000000000000000000ll
#define M 10000002
#define LOG 40
#define magic 100
#define KOK 250
#define EPS 0.0025
#define pw(x) ((1ll)<<(x))
#define PI 3.1415926535
using namespace std;

long long findGap(int T, int N) {

	ll ans=0;
	ll bas,son;

	MinMax(0,inf,&bas,&son);	

	ll ratio=(son-bas-1)/(N-1);

	vector<ll> possible;

	possible.pb(bas);

	for(int i=1;i<N;i++) {

		ll v1,v2;

		MinMax(bas+ratio*(i-1)+1,max(bas+ratio*i,bas+ratio*(i-1)+1),&v1,&v2);

		if(v1!=-1) {

			if(v1!=v2 || (sz(possible) && possible.back()!=v1)) possible.pb(v1);

			possible.pb(v2);

		}

	}

	if(possible.back()!=son) possible.pb(son);

	for(int i=0;i<sz(possible)-1;i++) {

		umax(ans,possible[i+1]-possible[i]);

	}

	return ans;

}
# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 376 KB Output isn't correct
2 Incorrect 2 ms 488 KB Output isn't correct
3 Incorrect 2 ms 488 KB Output isn't correct
4 Incorrect 3 ms 488 KB Output isn't correct
5 Incorrect 2 ms 488 KB Output isn't correct
6 Incorrect 2 ms 488 KB Output isn't correct
7 Incorrect 2 ms 488 KB Output isn't correct
8 Incorrect 2 ms 596 KB Output isn't correct
9 Incorrect 2 ms 596 KB Output isn't correct
10 Incorrect 2 ms 596 KB Output isn't correct
11 Incorrect 3 ms 596 KB Output isn't correct
12 Incorrect 3 ms 596 KB Output isn't correct
13 Incorrect 3 ms 596 KB Output isn't correct
14 Incorrect 3 ms 596 KB Output isn't correct
15 Incorrect 3 ms 608 KB Output isn't correct
16 Incorrect 32 ms 1048 KB Output isn't correct
17 Incorrect 19 ms 1048 KB Output isn't correct
18 Incorrect 20 ms 1048 KB Output isn't correct
19 Incorrect 21 ms 1048 KB Output isn't correct
20 Incorrect 10 ms 1048 KB Output isn't correct
21 Incorrect 82 ms 2592 KB Output isn't correct
22 Incorrect 83 ms 2592 KB Output isn't correct
23 Incorrect 87 ms 2592 KB Output isn't correct
24 Incorrect 74 ms 2592 KB Output isn't correct
25 Incorrect 68 ms 3528 KB Output isn't correct
26 Incorrect 89 ms 3528 KB Output isn't correct
27 Incorrect 83 ms 3528 KB Output isn't correct
28 Incorrect 77 ms 3528 KB Output isn't correct
29 Incorrect 73 ms 3528 KB Output isn't correct
30 Incorrect 38 ms 3528 KB Output isn't correct
31 Incorrect 2 ms 3528 KB Output isn't correct
32 Incorrect 2 ms 3528 KB Output isn't correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 3528 KB Output is correct
2 Correct 3 ms 3528 KB Output is correct
3 Correct 3 ms 3528 KB Output is correct
4 Correct 2 ms 3528 KB Output is correct
5 Correct 2 ms 3528 KB Output is correct
6 Correct 2 ms 3528 KB Output is correct
7 Correct 2 ms 3528 KB Output is correct
8 Correct 2 ms 3528 KB Output is correct
9 Correct 2 ms 3528 KB Output is correct
10 Correct 2 ms 3528 KB Output is correct
11 Correct 3 ms 3528 KB Output is correct
12 Correct 4 ms 3528 KB Output is correct
13 Correct 3 ms 3528 KB Output is correct
14 Correct 4 ms 3528 KB Output is correct
15 Correct 3 ms 3528 KB Output is correct
16 Correct 19 ms 3528 KB Output is correct
17 Correct 20 ms 3528 KB Output is correct
18 Correct 19 ms 3528 KB Output is correct
19 Correct 21 ms 3528 KB Output is correct
20 Incorrect 10 ms 3528 KB Output isn't correct
21 Correct 74 ms 3528 KB Output is correct
22 Correct 72 ms 3528 KB Output is correct
23 Correct 72 ms 3528 KB Output is correct
24 Correct 99 ms 3528 KB Output is correct
25 Correct 68 ms 3588 KB Output is correct
26 Correct 75 ms 3588 KB Output is correct
27 Correct 114 ms 3588 KB Output is correct
28 Correct 73 ms 3588 KB Output is correct
29 Correct 81 ms 3588 KB Output is correct
30 Incorrect 36 ms 3588 KB Output isn't correct
31 Correct 2 ms 3588 KB Output is correct
32 Correct 2 ms 3588 KB Output is correct