Submission #1018937

# Submission time Handle Problem Language Result Execution time Memory
1018937 2024-07-10T11:04:22 Z coolboy19521 Gap (APIO16_gap) C++17
30 / 100
42 ms 2328 KB
#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;
            long long rangeStart = mn + 1;
            long long rangeEnd = min(mx - 1, mn + k);

            if (rangeStart > rangeEnd) break;

            MinMax(rangeStart, rangeEnd, &nextMin, &nextMax);

            if (nextMin == -1) { // No numbers found in the range
                mn = rangeEnd + 1;
                continue;
            }

            b.push_back(nextMin);
            if (nextMin != nextMax) {
                b.push_back(nextMax);
                while (nextMin < nextMax && b.size() < N) {
                    // Keep querying within the narrowed range
                    MinMax(nextMin + 1, nextMax - 1, &nextMin, &nextMax);
                    if (nextMin == -1) break; // Exit if no more numbers are found
                    if (nextMin == nextMax) {
                        b.push_back(nextMin);
                        break;
                    } else {
                        b.push_back(nextMin);
                        b.push_back(nextMax);
                    }
                }
            }

            mn = nextMax + 1; // Move to the next range beyond the last found max
        }

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

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:37:25: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   37 |         while (b.size() < N) {
      |                ~~~~~~~~~^~~
gap.cpp:54:54: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   54 |                 while (nextMin < nextMax && b.size() < N) {
      |                                             ~~~~~~~~~^~~
gap.cpp:75:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |         for (int i = 0; i < b.size() - 1; i++) {
      |                         ~~^~~~~~~~~~~~~~
# 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 0 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 1 ms 344 KB Output is correct
16 Correct 6 ms 600 KB Output is correct
17 Correct 8 ms 600 KB Output is correct
18 Correct 6 ms 856 KB Output is correct
19 Correct 6 ms 696 KB Output is correct
20 Correct 5 ms 600 KB Output is correct
21 Correct 34 ms 1844 KB Output is correct
22 Correct 24 ms 1880 KB Output is correct
23 Correct 34 ms 1880 KB Output is correct
24 Correct 25 ms 1880 KB Output is correct
25 Correct 23 ms 1880 KB Output is correct
26 Correct 25 ms 1880 KB Output is correct
27 Correct 29 ms 1872 KB Output is correct
28 Correct 25 ms 1868 KB Output is correct
29 Correct 25 ms 1880 KB Output is correct
30 Correct 20 ms 1880 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 344 KB Output isn't correct
3 Incorrect 0 ms 344 KB Output isn't correct
4 Incorrect 0 ms 344 KB Output isn't correct
5 Correct 0 ms 344 KB Output is correct
6 Incorrect 0 ms 344 KB Output isn't correct
7 Incorrect 0 ms 344 KB Output isn't correct
8 Incorrect 0 ms 344 KB Output isn't correct
9 Incorrect 0 ms 344 KB Output isn't correct
10 Runtime error 0 ms 344 KB Execution failed because the return code was nonzero
11 Incorrect 1 ms 344 KB Output isn't correct
12 Incorrect 1 ms 344 KB Output isn't correct
13 Incorrect 0 ms 344 KB Output isn't correct
14 Incorrect 0 ms 344 KB Output isn't correct
15 Correct 1 ms 344 KB Output is correct
16 Incorrect 7 ms 980 KB Output isn't correct
17 Incorrect 7 ms 980 KB Output isn't correct
18 Incorrect 10 ms 952 KB Output isn't correct
19 Incorrect 7 ms 980 KB Output isn't correct
20 Runtime error 2 ms 556 KB Execution failed because the return code was nonzero
21 Incorrect 26 ms 2196 KB Output isn't correct
22 Incorrect 38 ms 2328 KB Output isn't correct
23 Incorrect 39 ms 2256 KB Output isn't correct
24 Incorrect 25 ms 2256 KB Output isn't correct
25 Correct 40 ms 2320 KB Output is correct
26 Incorrect 37 ms 2248 KB Output isn't correct
27 Incorrect 29 ms 2256 KB Output isn't correct
28 Incorrect 28 ms 2256 KB Output isn't correct
29 Incorrect 42 ms 2252 KB Output isn't correct
30 Partially correct 33 ms 2256 KB Partially correct
31 Runtime error 0 ms 344 KB Execution failed because the return code was nonzero
32 Partially correct 0 ms 344 KB Partially correct