oj.uz

Submission #1002826

# Submission time Handle Problem Language Result Execution time Memory
1002826 2024-06-19T20:16:16 Z Tob Gap (APIO16_gap) C++14
89.0204 / 100
 48 ms 3276 KB 
#include <bits/stdc++.h>

#include "gap.h"

#define F first
#define S second
#define all(x) x.begin(), x.end()
#define pb push_back
#define FIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

using namespace std;

typedef long long ll;
typedef pair <ll, ll> pii;
/*
static void my_assert(int k){ if (!k) exit(1); }

static int subtask_num, N;
static long long A[100001];
static long long call_count;

long long findGap(int, int);

void MinMax(long long s, long long t, long long *mn, long long *mx)
{
	int lo = 1, hi = N, left = N+1, right = 0;
	my_assert(s <= t && mn != NULL && mx != NULL);
	while (lo <= hi){
		int mid = (lo+hi)>>1;
		if (A[mid] >= s) hi = mid - 1, left = mid;
		else lo = mid + 1;
	}
	lo = 1, hi = N;
	while (lo <= hi){
		int mid = (lo+hi)>>1;
		if (A[mid] <= t) lo = mid + 1, right = mid;
		else hi = mid - 1;
	}
	if (left > right) *mn = *mx = -1;
	else{
		*mn = A[left];
		*mx = A[right];
	}
	if (subtask_num == 1) call_count++;
	else if (subtask_num == 2) call_count += right-left+2;
}*/

//---------------------------

const ll inf = 1e18;

ll findGap(int t, int n) {
	if (t == 1) {
		ll x = 0, y = inf;
		ll mn=0, mx=inf;
		vector <ll> v;
		for (int i = 0; i < (n+1)/2; i++) {
			MinMax(x, y, &mn, &mx);
			v.pb(mn);
			v.pb(mx);
			x = mn+1; y = mx-1;
		}
		sort(all(v)); v.erase(unique(all(v)), v.end());
		ll res = 0;
		for (int i = 1; i < n; i++) res = max(res, v[i]-v[i-1]);
		return res;
	}
	ll lo=0, hi=0;
	MinMax(0, inf, &lo, &hi);
	ll d = (hi-lo)/(n-1);
	vector <ll> v;
	v = {lo, hi};
	for (ll i = lo; i < hi; i += d) {
		ll a=0, b=0;
		MinMax(i, i+d-1, &a, &b);
		if (a != -1) {v.pb(a); v.pb(b);}
	}
	sort(all(v)); v.erase(unique(all(v)), v.end());
	ll res = 0;
	for (int i = 1; i < v.size(); i++) res = max(res, v[i]-v[i-1]);
	return res;
}

//---------------------------
/*
int main()
{
	FILE *in = stdin, *out = stdout;
	my_assert(2 == fscanf(in, "%d%d", &subtask_num, &N));
	my_assert(1 <= subtask_num && subtask_num <= 2);
	my_assert(2 <= N && N <= 100000);
	for (int i=1;i<=N;i++) my_assert(1 == fscanf(in, "%lld", A+i));
	for (int i=1;i<N;i++) my_assert(A[i] < A[i+1]);
	fprintf(out, "%lld\n", findGap(subtask_num, N));
	fprintf(out, "%lld\n", call_count);
}*/

Compilation message

gap.cpp: In function 'll findGap(int, int)':
gap.cpp:80:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |  for (int i = 1; i < v.size(); i++) res = max(res, v[i]-v[i-1]);
      |                  ~~^~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 7 ms 980 KB Output is correct
17 Correct 7 ms 980 KB Output is correct
18 Correct 7 ms 980 KB Output is correct
19 Correct 8 ms 980 KB Output is correct
20 Correct 6 ms 980 KB Output is correct
21 Correct 29 ms 2276 KB Output is correct
22 Correct 31 ms 2256 KB Output is correct
23 Correct 29 ms 2192 KB Output is correct
24 Correct 29 ms 2196 KB Output is correct
25 Correct 32 ms 2288 KB Output is correct
26 Correct 34 ms 2280 KB Output is correct
27 Correct 39 ms 2248 KB Output is correct
28 Correct 29 ms 2256 KB Output is correct
29 Correct 32 ms 2256 KB Output is correct
30 Correct 23 ms 2256 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct

Subtask #2
59.0203916407 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Partially correct 0 ms 344 KB Partially correct
3 Partially correct 0 ms 344 KB Partially correct
4 Partially correct 0 ms 344 KB Partially correct
5 Correct 0 ms 344 KB Output is correct
6 Partially correct 0 ms 340 KB Partially correct
7 Partially correct 0 ms 344 KB Partially correct
8 Partially correct 0 ms 344 KB Partially correct
9 Partially correct 0 ms 340 KB Partially correct
10 Partially correct 1 ms 344 KB Partially correct
11 Partially correct 1 ms 344 KB Partially correct
12 Partially correct 1 ms 344 KB Partially correct
13 Partially correct 1 ms 344 KB Partially correct
14 Partially correct 0 ms 344 KB Partially correct
15 Correct 1 ms 344 KB Output is correct
16 Partially correct 11 ms 980 KB Partially correct
17 Partially correct 12 ms 976 KB Partially correct
18 Partially correct 9 ms 980 KB Partially correct
19 Partially correct 11 ms 1016 KB Partially correct
20 Partially correct 6 ms 600 KB Partially correct
21 Partially correct 39 ms 2172 KB Partially correct
22 Partially correct 37 ms 2256 KB Partially correct
23 Partially correct 37 ms 2256 KB Partially correct
24 Partially correct 42 ms 2324 KB Partially correct
25 Correct 36 ms 3276 KB Output is correct
26 Partially correct 38 ms 2256 KB Partially correct
27 Partially correct 48 ms 2248 KB Partially correct
28 Partially correct 39 ms 2256 KB Partially correct
29 Partially correct 38 ms 2256 KB Partially correct
30 Partially correct 26 ms 1624 KB Partially correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct