Submission #1050295

# Submission time Handle Problem Language Result Execution time Memory
1050295 2024-08-09T08:34:46 Z otarius Gap (APIO16_gap) C++17
30 / 100
40 ms 3992 KB
#include "gap.h"
#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace __gnu_pbds;
using namespace std;

// #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#define ff first
#define sc second
#define pb push_back
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define ull unsigned long long
#define all(x) (x).begin(),(x).end()

// #define int long long
// #define int unsigned long long

// #define ordered_set(T) tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>
// #define ordered_multiset(T) tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>

void open_file(string filename) {
    freopen((filename + ".in").c_str(), "r", stdin);
    freopen((filename + ".out").c_str(), "w", stdout);
}

// const ll mod = 1e9 + 7;
// const ll mod = 998244353;

const ll inf = 1e9;
const ll biginf = 1e18;
const int maxN = 5 * 1e5 + 5;

ll findGap(int t, int n) {
    vector<ll> arr;
    ll l = 1, r = 1e18, mn, mx;
    for (int i = 1; i <= (n + 1) / 2; i++) {
        MinMax(l, r, &mn, &mx);
        arr.pb(mn); arr.pb(mx);
        l = mn + 1; r = mx - 1;
    } sort(all(arr));
    mx = 0;
    for (int i = 1; i < arr.size(); i++) {
        mx = max(mx, arr[i] - arr[i - 1]);
    } return mx;
}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:47:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |     for (int i = 1; i < arr.size(); i++) {
      |                     ~~^~~~~~~~~~~~
gap.cpp: In function 'void open_file(std::string)':
gap.cpp:27:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |     freopen((filename + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
gap.cpp:28:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |     freopen((filename + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 0 ms 2392 KB Output is correct
4 Correct 0 ms 2392 KB Output is correct
5 Correct 0 ms 2392 KB Output is correct
6 Correct 0 ms 2392 KB Output is correct
7 Correct 0 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 2480 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 7 ms 2904 KB Output is correct
17 Correct 6 ms 2868 KB Output is correct
18 Correct 6 ms 2904 KB Output is correct
19 Correct 7 ms 2836 KB Output is correct
20 Correct 8 ms 2904 KB Output is correct
21 Correct 29 ms 3848 KB Output is correct
22 Correct 32 ms 3912 KB Output is correct
23 Correct 24 ms 3792 KB Output is correct
24 Correct 29 ms 3828 KB Output is correct
25 Correct 24 ms 3792 KB Output is correct
26 Correct 24 ms 3792 KB Output is correct
27 Correct 27 ms 3792 KB Output is correct
28 Correct 37 ms 3940 KB Output is correct
29 Correct 24 ms 3992 KB Output is correct
30 Correct 21 ms 3792 KB Output is correct
31 Correct 0 ms 2392 KB Output is correct
32 Correct 0 ms 2392 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Partially correct 0 ms 2392 KB Partially correct
3 Partially correct 0 ms 2392 KB Partially correct
4 Partially correct 0 ms 2392 KB Partially correct
5 Partially correct 1 ms 2392 KB Partially correct
6 Partially correct 0 ms 2392 KB Partially correct
7 Partially correct 0 ms 2392 KB Partially correct
8 Partially correct 0 ms 2392 KB Partially correct
9 Partially correct 0 ms 2392 KB Partially correct
10 Partially correct 0 ms 2392 KB Partially correct
11 Partially correct 1 ms 2392 KB Partially correct
12 Partially correct 1 ms 2392 KB Partially correct
13 Partially correct 1 ms 2392 KB Partially correct
14 Partially correct 1 ms 2392 KB Partially correct
15 Partially correct 1 ms 2496 KB Partially correct
16 Partially correct 6 ms 2904 KB Partially correct
17 Partially correct 6 ms 2904 KB Partially correct
18 Partially correct 8 ms 2864 KB Partially correct
19 Partially correct 6 ms 2904 KB Partially correct
20 Partially correct 6 ms 2904 KB Partially correct
21 Incorrect 30 ms 3864 KB Expected int32, but "2500100000" found
22 Incorrect 40 ms 3784 KB Expected int32, but "2500100000" found
23 Incorrect 40 ms 3784 KB Expected int32, but "2500100000" found
24 Incorrect 24 ms 3792 KB Expected int32, but "2500100000" found
25 Incorrect 22 ms 3792 KB Expected int32, but "2500100000" found
26 Incorrect 24 ms 3792 KB Expected int32, but "2500100000" found
27 Incorrect 24 ms 3888 KB Expected int32, but "2500100000" found
28 Incorrect 24 ms 3984 KB Expected int32, but "2500100000" found
29 Incorrect 31 ms 3984 KB Expected int32, but "2500100000" found
30 Incorrect 24 ms 3860 KB Expected int32, but "2500100000" found
31 Partially correct 1 ms 2392 KB Partially correct
32 Partially correct 0 ms 2392 KB Partially correct