oj.uz

Submission #102821

# Submission time Handle Problem Language Result Execution time Memory
102821 2019-03-27T15:59:46 Z CorneliuVadimTudor Gap (APIO16_gap) C++14
100 / 100
 84 ms 2412 KB 
#include <bits/stdc++.h>

#include "gap.h"

std::vector <long long> V;
long long findGap(int T, int N){
    if(T == 1){
        long long st = 0, dr = 1000000000000000000LL;
        int found = 0;
        while(found < N){
            long long a, b;
            MinMax(st, dr, &a, &b);
            V.push_back(a);
            V.push_back(b);
            found += 2;
            st = a + 1, dr = b - 1;
        }

        std::sort(V.begin(), V.end());
        long long maxx = 0;
        for(int i = 0; i + 1 < V.size(); i++)
            if(V[i] != -1 && V[i + 1] - V[i] > maxx) maxx = V[i + 1] - V[i];
        return maxx;
    }

    long long A, B;
    MinMax(0, 1000000000000000000LL, &A, &B);

    long long Dmax = B - A;
    long long dist = (Dmax + N - 2) / (N - 1) + 1;
    long long st;
    for(st = A; st + dist <= B; st += dist){
        long long a, b;
        MinMax(st, st + dist - 1, &a, &b);
        V.push_back(a);
        if(b != a) V.push_back(b);
    }
    long long a, b;
    MinMax(st, B, &a, &b);
    V.push_back(a);
    if(b != a) V.push_back(b);

    std::sort(V.begin(), V.end());
    long long maxx = 0;
    for(int i = 0; i + 1 < V.size(); i++)
        if(V[i] != -1 && V[i + 1] - V[i] > maxx) maxx = V[i + 1] - V[i];
    return maxx;
};

/*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;
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;
}

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 'long long int findGap(int, int)':
gap.cpp:21:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i = 0; i + 1 < V.size(); i++)
                        ~~~~~~^~~~~~~~~~
gap.cpp:45:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i + 1 < V.size(); i++)
                    ~~~~~~^~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 19 ms 924 KB Output is correct
17 Correct 15 ms 896 KB Output is correct
18 Correct 16 ms 1024 KB Output is correct
19 Correct 22 ms 888 KB Output is correct
20 Correct 15 ms 1024 KB Output is correct
21 Correct 62 ms 2264 KB Output is correct
22 Correct 62 ms 2260 KB Output is correct
23 Correct 54 ms 2288 KB Output is correct
24 Correct 51 ms 2288 KB Output is correct
25 Correct 52 ms 2288 KB Output is correct
26 Correct 52 ms 2288 KB Output is correct
27 Correct 58 ms 2308 KB Output is correct
28 Correct 61 ms 2288 KB Output is correct
29 Correct 74 ms 2288 KB Output is correct
30 Correct 44 ms 2288 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 3 ms 384 KB Output is correct

Subtask #2
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 4 ms 384 KB Output is correct
12 Correct 3 ms 412 KB Output is correct
13 Correct 4 ms 356 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 22 ms 896 KB Output is correct
17 Correct 18 ms 1024 KB Output is correct
18 Correct 20 ms 1024 KB Output is correct
19 Correct 20 ms 896 KB Output is correct
20 Correct 11 ms 896 KB Output is correct
21 Correct 67 ms 2412 KB Output is correct
22 Correct 67 ms 2288 KB Output is correct
23 Correct 69 ms 2288 KB Output is correct
24 Correct 67 ms 2288 KB Output is correct
25 Correct 62 ms 2288 KB Output is correct
26 Correct 77 ms 2352 KB Output is correct
27 Correct 71 ms 2260 KB Output is correct
28 Correct 84 ms 2288 KB Output is correct
29 Correct 77 ms 2288 KB Output is correct
30 Correct 54 ms 2284 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct