oj.uz

Submission #1050384

# Submission time Handle Problem Language Result Execution time Memory
1050384 2024-08-09T09:00:22 Z otarius Gap (APIO16_gap) C++17
30 / 100
 37 ms 3792 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) {
    if (t == 1) {
        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;
    } else {
        ll mn, mx;
        MinMax(1, 1e18, &mn, &mx);
        // mn + (n - 1) * cnt = mx
        // cnt = (mx - mn) / (n - 1);
        ll cnt = (mx - mn) / (n - 1) + ((mx - mn) % (n - 1) > 0), lst = mn, ans = cnt, i, _mn, _mx;
        for (i = mn; i + cnt <= mx; i += cnt + 1) {
            MinMax(i, i + cnt, &_mn, &_mx);
            if (_mn != -1) {
                ans = max(ans, _mn - lst);
                lst = _mx;
            }
        } return ans;
    }
}

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:48:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |         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);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# 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 1 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 0 ms 2392 KB Output is correct
10 Correct 0 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 0 ms 2392 KB Output is correct
16 Correct 6 ms 2916 KB Output is correct
17 Correct 7 ms 2904 KB Output is correct
18 Correct 6 ms 2996 KB Output is correct
19 Correct 6 ms 2904 KB Output is correct
20 Correct 5 ms 2904 KB Output is correct
21 Correct 27 ms 3792 KB Output is correct
22 Correct 24 ms 3792 KB Output is correct
23 Correct 24 ms 3792 KB Output is correct
24 Correct 37 ms 3792 KB Output is correct
25 Correct 27 ms 3792 KB Output is correct
26 Correct 24 ms 3792 KB Output is correct
27 Correct 29 ms 3784 KB Output is correct
28 Correct 27 ms 3792 KB Output is correct
29 Correct 24 ms 3792 KB Output is correct
30 Correct 26 ms 3792 KB Output is correct
31 Correct 0 ms 2392 KB Output is correct
32 Correct 0 ms 2392 KB Output is correct

Subtask #2
0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 1 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 Incorrect 0 ms 2392 KB Output isn't 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 0 ms 2392 KB Output is correct
16 Correct 7 ms 2392 KB Output is correct
17 Correct 7 ms 2392 KB Output is correct
18 Correct 7 ms 2392 KB Output is correct
19 Correct 7 ms 2392 KB Output is correct
20 Correct 4 ms 2592 KB Output is correct
21 Correct 28 ms 2780 KB Output is correct
22 Correct 28 ms 2648 KB Output is correct
23 Correct 31 ms 2648 KB Output is correct
24 Correct 28 ms 2648 KB Output is correct
25 Correct 28 ms 2648 KB Output is correct
26 Correct 29 ms 2648 KB Output is correct
27 Correct 37 ms 2648 KB Output is correct
28 Correct 31 ms 2840 KB Output is correct
29 Correct 33 ms 2648 KB Output is correct
30 Correct 20 ms 2648 KB Output is correct
31 Incorrect 0 ms 2392 KB Output isn't correct
32 Correct 0 ms 2392 KB Output is correct