oj.uz

Submission #944661

# Submission time Handle Problem Language Result Execution time Memory
944661 2024-03-13T02:48:05 Z wii Gap (APIO16_gap) C++17
42.8842 / 100
 225 ms 7756 KB 
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

int n, t;
vector<ll> num;
void dnc(ll l, ll r) {
    if (l > r)
        return;

    if (t == 1) {
        ll mn = -1, mx = -1;
        if (num.size() < n) MinMax(l, r, &mn, &mx);

        if (mn == -1) return;

        num.push_back(mn);
        num.push_back(mx);

        dnc(mn + 1, mx - 1);
        return;
    }

    ll mid = (l + r) >> 1;
    ll mn = -1, mx = -1;

    MinMax(l, mid, &mn, &mx);
    if (mn != -1) {
        num.push_back(mn);
        if (mn != mx) num.push_back(mx);

        dnc(mn + 1, mx - 1);
        dnc(mid + 1, r);

        return;
    }

    dnc(mid + 1, r);
}

ll findGap(int T, int N) {
    n = N; t = T;
    dnc(0, 1e18);

    sort(num.begin(), num.end());

    ll res = 0;
    for (int i = 1; i < num.size(); ++i)
        res = max(res, num[i] - num[i - 1]);

	return res;
}

Compilation message

gap.cpp: In function 'void dnc(ll, ll)':
gap.cpp:15:24: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   15 |         if (num.size() < n) MinMax(l, r, &mn, &mx);
      |             ~~~~~~~~~~~^~~
gap.cpp: In function 'll findGap(int, int)':
gap.cpp:50:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |     for (int i = 1; i < num.size(); ++i)
      |                     ~~^~~~~~~~~~~~
gap.cpp:50:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   50 |     for (int i = 1; i < num.size(); ++i)
      |     ^~~
gap.cpp:53:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   53 |  return res;
      |  ^~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 0 ms 2392 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 11 ms 3736 KB Output is correct
17 Correct 8 ms 3736 KB Output is correct
18 Correct 9 ms 3824 KB Output is correct
19 Correct 9 ms 3900 KB Output is correct
20 Correct 8 ms 3728 KB Output is correct
21 Correct 35 ms 7756 KB Output is correct
22 Correct 38 ms 7588 KB Output is correct
23 Correct 37 ms 7592 KB Output is correct
24 Correct 33 ms 7576 KB Output is correct
25 Correct 33 ms 7600 KB Output is correct
26 Correct 38 ms 7636 KB Output is correct
27 Correct 34 ms 7572 KB Output is correct
28 Correct 34 ms 7452 KB Output is correct
29 Correct 34 ms 7568 KB Output is correct
30 Correct 29 ms 7576 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct

Subtask #2
12.8842340313 / 70.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 2392 KB Partially correct
2 Partially correct 0 ms 2392 KB Partially correct
3 Partially correct 1 ms 2392 KB Partially correct
4 Partially correct 1 ms 2392 KB Partially correct
5 Partially correct 1 ms 2392 KB Partially correct
6 Partially correct 1 ms 2392 KB Partially correct
7 Partially correct 1 ms 2392 KB Partially correct
8 Partially correct 1 ms 2392 KB Partially correct
9 Partially correct 1 ms 2392 KB Partially correct
10 Partially correct 1 ms 2392 KB Partially correct
11 Partially correct 3 ms 2392 KB Partially correct
12 Partially correct 3 ms 2392 KB Partially correct
13 Partially correct 3 ms 2392 KB Partially correct
14 Partially correct 3 ms 2392 KB Partially correct
15 Partially correct 2 ms 2392 KB Partially correct
16 Partially correct 51 ms 2876 KB Partially correct
17 Partially correct 52 ms 2792 KB Partially correct
18 Partially correct 60 ms 3084 KB Partially correct
19 Partially correct 53 ms 2872 KB Partially correct
20 Partially correct 9 ms 2828 KB Partially correct
21 Partially correct 218 ms 3788 KB Partially correct
22 Partially correct 224 ms 3780 KB Partially correct
23 Partially correct 223 ms 4000 KB Partially correct
24 Partially correct 224 ms 3992 KB Partially correct
25 Partially correct 125 ms 3988 KB Partially correct
26 Partially correct 225 ms 3860 KB Partially correct
27 Partially correct 220 ms 3996 KB Partially correct
28 Partially correct 221 ms 3996 KB Partially correct
29 Partially correct 221 ms 3904 KB Partially correct
30 Partially correct 36 ms 3996 KB Partially correct
31 Partially correct 1 ms 2392 KB Partially correct
32 Correct 1 ms 2392 KB Output is correct