Submission #183975

# Submission time Handle Problem Language Result Execution time Memory
183975 2020-01-10T09:52:51 Z dndhk Gap (APIO16_gap) C++14
70 / 100
80 ms 4584 KB
#include "gap.h"
#include <bits/stdc++.h>

#define all(v) (v).begin(), (v).end()
#define sortv(v) sort(all(v))
#define uniqv(v) (v).erase(unique(all(v)), (v).end())
#define pb push_back
#define FI first
#define SE second
#define lb lower_bound
#define ub upper_bound
#define mp make_pair
#define test 1
#define TEST if(test)

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

const int MOD = 1000000007; // 998244353
const int INF = 2e9;
const ll INFLL = 1e18;
const int MAX_N = 1;


pll query(ll x, ll y){
	pll p;
	//cout<<x<<" "<<y<<endl;
	MinMax(x, y, &p.first, &p.second);
	return p;
}

vector<pll> vt;

long long findGap(int T, int N){
	pll p1 = query(0, 1e18);
	if(N==2){
		return p1.second-p1.first;
	}
	ll s = p1.first, e = p1.second;
	if(e-s==2){
		return 1LL;
	}
	ll L = (e-s-2)/N;
	ll ans = L;
	vt.pb({s, s});
	ll n = s+1;
	for(int i=0; i<N; i++){
		if(n>=e)	break;
		pll p = query(n, min(n+L, e));
		if(p.first!=-1){
			vt.pb({p.first, p.second});
		}
		n+=L+1;
	}
	vt.pb({e, e});
	for(int i=0; i<vt.size()-1; i++){
		ans = max(ans, vt[i+1].first-vt[i].second);
	}
	return ans;
}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:60:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0; i<vt.size()-1; i++){
               ~^~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Incorrect 2 ms 376 KB Output isn't correct
4 Incorrect 2 ms 376 KB Output isn't correct
5 Incorrect 2 ms 348 KB Output isn't correct
6 Incorrect 2 ms 376 KB Output isn't correct
7 Incorrect 2 ms 376 KB Output isn't correct
8 Incorrect 3 ms 376 KB Output isn't correct
9 Incorrect 2 ms 376 KB Output isn't correct
10 Incorrect 2 ms 376 KB Output isn't correct
11 Incorrect 3 ms 380 KB Output isn't correct
12 Incorrect 3 ms 376 KB Output isn't correct
13 Incorrect 3 ms 380 KB Output isn't correct
14 Incorrect 3 ms 376 KB Output isn't correct
15 Incorrect 3 ms 376 KB Output isn't correct
16 Incorrect 20 ms 1400 KB Output isn't correct
17 Incorrect 20 ms 1400 KB Output isn't correct
18 Incorrect 21 ms 1400 KB Output isn't correct
19 Incorrect 21 ms 1400 KB Output isn't correct
20 Incorrect 11 ms 760 KB Output isn't correct
21 Incorrect 80 ms 4180 KB Output isn't correct
22 Incorrect 77 ms 4080 KB Output isn't correct
23 Incorrect 78 ms 4080 KB Output isn't correct
24 Incorrect 76 ms 4196 KB Output isn't correct
25 Incorrect 71 ms 4556 KB Output isn't correct
26 Incorrect 76 ms 4208 KB Output isn't correct
27 Incorrect 77 ms 4252 KB Output isn't correct
28 Incorrect 76 ms 4080 KB Output isn't correct
29 Incorrect 75 ms 4080 KB Output isn't correct
30 Incorrect 41 ms 2260 KB Output isn't correct
31 Incorrect 2 ms 376 KB Output isn't correct
32 Incorrect 2 ms 376 KB Output isn't correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 2 ms 380 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 380 KB Output is correct
16 Correct 17 ms 1400 KB Output is correct
17 Correct 20 ms 1400 KB Output is correct
18 Correct 20 ms 1400 KB Output is correct
19 Correct 20 ms 1400 KB Output is correct
20 Correct 10 ms 760 KB Output is correct
21 Correct 76 ms 4208 KB Output is correct
22 Correct 75 ms 4076 KB Output is correct
23 Correct 76 ms 4180 KB Output is correct
24 Correct 74 ms 4212 KB Output is correct
25 Correct 72 ms 4584 KB Output is correct
26 Correct 76 ms 4080 KB Output is correct
27 Correct 67 ms 4080 KB Output is correct
28 Correct 75 ms 4156 KB Output is correct
29 Correct 78 ms 4128 KB Output is correct
30 Correct 43 ms 2204 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct