oj.uz

Submission #944637

# Submission time Handle Problem Language Result Execution time Memory
944637 2024-03-13T02:17:32 Z wii Gap (APIO16_gap) C++17
30 / 100
 561 ms 12928 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 mn = -1, mx = -1;
    for (int k = 1; k <= 60; ++k) {
        if (num.size() < n) MinMax(l, min(r, l + (1LL << k) - 1), &mn, &mx);
        if (mn != -1) {
            num.push_back(mn);
            if (mn != mx) num.push_back(mx);

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

            return;
        }

        if (r <= l + (1LL << k) - 1)
            break;
    }
}

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

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 0 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 2644 KB Output is correct
15 Correct 1 ms 2388 KB Output is correct
16 Correct 9 ms 3992 KB Output is correct
17 Correct 9 ms 3996 KB Output is correct
18 Correct 9 ms 3992 KB Output is correct
19 Correct 9 ms 3984 KB Output is correct
20 Correct 7 ms 3976 KB Output is correct
21 Correct 38 ms 8576 KB Output is correct
22 Correct 35 ms 8352 KB Output is correct
23 Correct 35 ms 8332 KB Output is correct
24 Correct 35 ms 8340 KB Output is correct
25 Correct 31 ms 8312 KB Output is correct
26 Correct 39 ms 8432 KB Output is correct
27 Correct 40 ms 8612 KB Output is correct
28 Correct 35 ms 8336 KB Output is correct
29 Correct 34 ms 8340 KB Output is correct
30 Correct 29 ms 8344 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct

Subtask #2
0 / 70.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 2392 KB Partially correct
2 Partially correct 1 ms 2392 KB Partially correct
3 Partially correct 0 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 Correct 1 ms 2392 KB Output is correct
11 Partially correct 8 ms 2552 KB Partially correct
12 Partially correct 8 ms 2392 KB Partially correct
13 Partially correct 6 ms 2516 KB Partially correct
14 Partially correct 7 ms 2392 KB Partially correct
15 Partially correct 3 ms 2648 KB Partially correct
16 Partially correct 124 ms 4240 KB Partially correct
17 Partially correct 122 ms 4196 KB Partially correct
18 Partially correct 122 ms 4236 KB Partially correct
19 Partially correct 121 ms 4236 KB Partially correct
20 Correct 7 ms 3836 KB Output is correct
21 Partially correct 534 ms 9616 KB Partially correct
22 Partially correct 546 ms 9484 KB Partially correct
23 Partially correct 541 ms 9508 KB Partially correct
24 Partially correct 540 ms 9536 KB Partially correct
25 Partially correct 302 ms 12928 KB Partially correct
26 Partially correct 534 ms 9356 KB Partially correct
27 Partially correct 561 ms 9616 KB Partially correct
28 Partially correct 536 ms 9620 KB Partially correct
29 Partially correct 543 ms 9484 KB Partially correct
30 Correct 25 ms 6296 KB Output is correct
31 Incorrect 1 ms 2392 KB Output isn't correct
32 Partially correct 1 ms 2392 KB Partially correct