Submission #1018911

#	Time	Username	Problem	Language	Result	Execution time	Memory
1018911		coolboy19521	Gap (APIO16_gap)	C++17	30 / 100	38 ms	2000 KiB

gap

#include "bits/stdc++.h"
#include "gap.h"

using namespace std;

const int sz = 1e5 + 5;
long long a[sz];
long long findGap(int T, int N) {if (1 == T) {
		long long mn, mx;
		MinMax(0, 1e18, &mn, &mx);

		a[1] = mn;
		a[N] = mx;

		for (int i = 1; i <= (N+1)/2-1; i ++) {
			MinMax(mn+1, mx-1, &mn, &mx);
			a[i+1] = mn;
			a[N - i] = mx;
		}

		long long gp = 0;

		for (int i = 1; i <= N-1; i ++)
			gp = max(gp, a[i+1] - a[i]);

		return gp;
	} 
    if (T == 2) {
        long long mn, mx;
        MinMax(0, 1e18, &mn, &mx);
        vector<long long> b = {mn, mx};
        long long k = (mx - mn + N - 2) / (N - 1);

        while (b.size() < N) {
            long long nextMin, nextMax;
            // We should adjust the range for MinMax to ensure that we cover all possible values
            if (b.size() == 2) {
                // Special case for the first split, handling the entire range
                MinMax(mn + 1, mx - 1, &nextMin, &nextMax);
            } else {
                long long rangeStart = mn + k;
                long long rangeEnd = min(mx - 1, mn + k + k);
                if (rangeStart > rangeEnd) break;
                MinMax(rangeStart, rangeEnd, &nextMin, &nextMax);
            }

            // If no values found in the range, advance to the next block
            if (nextMin == -1) {
                mn = mx + 1;
                continue;
            }

            // Adding found min and max
            b.push_back(nextMin);
            if (nextMax != nextMin) {
                b.push_back(nextMax);
            }

            // Update the pointers
            mn = nextMax + 1;
        }

        // Sorting the elements to find the maximum gap
        sort(begin(b), end(b));

        long long maxGap = 0;
        for (int i = 0; i < b.size() - 1; i++) {
            maxGap = max(maxGap, b[i + 1] - b[i]);
        }
        return maxGap;
    }
    return 0; // This part should never be reached for T = 2
}
/*#include "bits/stdc++.h"
#include "gap.h"

using namespace std;

const int sz = 1e5 + 5;

long long a[sz];

long long findGap(int T, int N)
{
	if (1 == T) {
		long long mn, mx;
		MinMax(0, 1e18, &mn, &mx);

		a[1] = mn;
		a[N] = mx;

		for (int i = 1; i <= (N+1)/2-1; i ++) {
			MinMax(mn+1, mx-1, &mn, &mx);
			a[i+1] = mn;
			a[N - i] = mx;
		}

		long long gp = 0;

		for (int i = 1; i <= N-1; i ++)
			gp = max(gp, a[i+1] - a[i]);

		return gp;
	} else {
        long long mn, mx;
        MinMax(0, 1e18, &mn, &mx);

        vector<long long> b = {mn, mx};

        long long k = (mx - mn + N-2) / (N-1);

        while (N != (int) b.size()) {
            long long d = mn + k;
            int s = mn+1;
            int e = min(b[1]-1, mn + k+1);
            if (s > e) break;
            MinMax(s, e, &mn, &mx);
            if (-1 == mn) {
                mx = d;
                continue;
            } else if (mn == mx)
                b.push_back(mn);
            else {
                b.push_back(mn);
                b.push_back(mx);
                while (N != (int) b.size()) {
                    if (mn+1>mx-1) break;
                    MinMax(mn+1, mx-1, &mn, &mx);
                    if (-1 == mn) break;
                    if (mn == mx) {
                        b.push_back(mn);
                        break;
                    } else {
                        b.push_back(mn);
                        b.push_back(mx);
                    }
                }
                mx = d;
            }
            mn = mx + 1;
        }

        //for (int x : b)
//            cout << x << ' ';

  //      cout << '\n';

        sort(begin(b), end(b));

        long long gp = 0;

        for (int i = 0; i < N-1; i ++)
            gp = max(gp, b[i+1] - b[i]);

        return gp;
    }

	return 0;
}*/

Compilation message (stderr)

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:34:25: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   34 |         while (b.size() < N) {
      |                ~~~~~~~~~^~~
gap.cpp:67:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |         for (int i = 0; i < b.size() - 1; i++) {
      |                         ~~^~~~~~~~~~~~~~

• Subtask 1: 30 / 30
• Subtask 2: 0 / 70