oj.uz

Submission #1010349

# Submission time Handle Problem Language Result Execution time Memory
1010349 2024-06-28T21:27:13 Z whatthemomooofun1729 Gap (APIO16_gap) C++17
70 / 100
 48 ms 7540 KB 
#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <stack>
#include <map>
#include <queue>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cstring>
#include <cmath>
#include <functional>
#include <cassert>
#include <iomanip>
#include <numeric>
#include <bitset>
#include <sstream>
#include <chrono>
#include <random>

#define ff first
#define ss second
#define PB push_back
#define sz(x) int(x.size())
#define rsz resize
#define fch(xxx, yyy) for (auto xxx : yyy) // abusive notation
#define all(x) (x).begin(),(x).end()
#define eps 1e-9

// more abusive notation (use at your own risk):
// #define int ll

using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;

// debugging
void __print(int x) {std::cerr << x;}
void __print(ll x) {std::cerr << x;} /* remember to uncomment this when not using THE MACRO */
void __print(unsigned x) {std::cerr << x;}
void __print(ull x) {std::cerr << x;}
void __print(float x) {std::cerr << x;}
void __print(double x) {std::cerr << x;}
void __print(ld x) {std::cerr << x;}
void __print(char x) {std::cerr << '\'' << x << '\'';}
void __print(const char *x) {std::cerr << '\"' << x << '\"';}
void __print(const string& x) {std::cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V> void __print(const pair<T, V> &x) {std::cerr << '{'; __print(x.ff); std::cerr << ", "; __print(x.ss); std::cerr << '}';}
template<typename T> void __print(const T& x) {int f = 0; std::cerr << '{'; for (auto &i: x) std::cerr << (f++ ? ", " : ""), __print(i); std::cerr << "}";}
void _print() {std::cerr << "]\n";}
template <typename T, typename... V> void _print(T t, V... v) {__print(t); if (sizeof...(v)) std::cerr << ", "; _print(v...);}
void println() {std::cerr << ">--------------------<" << endl;}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

// templates
template <class T> bool ckmin(T &a, const T &b) {return b<a ? a = b, 1 : 0;}
template <class T> bool ckmax(T &a, const T &b) {return b>a ? a = b, 1 : 0;}
template <class T> using gr = greater<T>;
template <class T> using vc = vector<T>;
template <class T> using p_q = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vc<T>, gr<T>>;
template <class T1, class T2> using pr = pair<T1, T2>;
mt19937_64 rng_ll(chrono::steady_clock::now().time_since_epoch().count());
int rng(int M) {return (int)(rng_ll()%M);} /*returns any random number in [0, M) */

// const variables
constexpr int INF = (int)2e9;
constexpr int MOD = 998244353;
constexpr long double EPS = (ld)1e-10, PI = 3.1415926535;
constexpr ll LL_INF = (ll)3e18;
constexpr int mod = (int)1e9 + 7;
constexpr ll inverse = 500000004LL; // inverse of 2 modulo 1e9 + 7

void setIO(const string& str) {// fast input/output
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    if (str.empty()) return;
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
}

#include "gap.h"
/*
int n;
vll v;

void MinMax(ll s, ll t, ll* mn, ll* mx) {
    //debug(s, t);
    auto it = lower_bound(all(v), s);
    if (it != v.end() && (*it) <= t) *mn = *it;
    else *mn = -1;
    auto ti = upper_bound(all(v), t);
    if (ti != v.begin() && (*prev(ti)) >= s) *mx = *prev(ti);
    else *mx = -1;
    //debug(*mn, *mx);
}*/

ll findGap(int T, int N) {
    if (T == 2) {
        ll mn, mx;
        MinMax(0, 1e18, &mn, &mx);
        ll range = mx - mn;
        ll average = (range + N - 2)/(N - 1);
        ll ans = average, l = mn, i, a, b;
        for (i = mn; i + average < mx; i += average + 1) {
            MinMax(i, i + average, &a, &b);
            if (a != -1) {
                ckmax(ans, a - l);
                l = b;
            }
        }
        MinMax(i, mx, &a, &b);
        if (a != -1) {
            ckmax(ans, a - l);
        }
        return ans;
    } else {
        ll l = 0, r = (ll)1e18;
        set<ll> p;
        while (1) {
            ll mn, mx;
            if (l >= r) break;
            MinMax(l, r, &mn, &mx);
            if (mn == -1 || mx == -1) {
                break;
            }
            p.insert(mn);
            p.insert(mx);
            l = mn + 1, r = mx - 1;
        }
        if (l == r) p.insert(l);
        assert(sz(p) == N);
        ll ans = 0;
        for (auto i = p.begin(); next(i) != p.end(); i++) {
            ckmax(ans, *next(i) - *i);
        }
        return ans;
    }
}
/*
signed main() { // TIME YOURSELF !!!
    setIO("");
    int t;
    cin >> t;
    cin >> n;
    for (int i = 0; i < n; ++i) {
        ll x;
        cin >> x;
        v.PB(x);
    }
    //debug(v);
    cout << findGap(1, n);
}*/

// TLE -> TRY NOT USING DEFINE INT LONG LONG
// CE -> CHECK LINE 45
// 5000 * 5000 size matrices are kinda big (potential mle)
// Do something, start simpler

Compilation message

gap.cpp: In function 'void setIO(const string&)':
gap.cpp:89:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   89 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
gap.cpp:90:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   90 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Incorrect 0 ms 344 KB Output isn't correct
7 Incorrect 1 ms 344 KB Output isn't correct
8 Incorrect 1 ms 2392 KB Output isn't correct
9 Incorrect 0 ms 344 KB Output isn't correct
10 Correct 0 ms 344 KB Output is correct
11 Incorrect 1 ms 344 KB Output isn't correct
12 Incorrect 1 ms 2392 KB Output isn't correct
13 Incorrect 1 ms 344 KB Output isn't correct
14 Incorrect 1 ms 340 KB Output isn't correct
15 Incorrect 1 ms 344 KB Output isn't correct
16 Incorrect 9 ms 3672 KB Output isn't correct
17 Incorrect 9 ms 3544 KB Output isn't correct
18 Incorrect 10 ms 1624 KB Output isn't correct
19 Incorrect 10 ms 1592 KB Output isn't correct
20 Correct 9 ms 1592 KB Output is correct
21 Incorrect 42 ms 5804 KB Output isn't correct
22 Incorrect 43 ms 5712 KB Output isn't correct
23 Incorrect 40 ms 5716 KB Output isn't correct
24 Incorrect 40 ms 7504 KB Output isn't correct
25 Incorrect 39 ms 7504 KB Output isn't correct
26 Incorrect 40 ms 7500 KB Output isn't correct
27 Incorrect 40 ms 7540 KB Output isn't correct
28 Incorrect 48 ms 7320 KB Output isn't correct
29 Incorrect 44 ms 7504 KB Output isn't correct
30 Correct 36 ms 7504 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 0 ms 2392 KB Output is correct

Subtask #2
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 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 1 ms 344 KB Output is correct
11 Correct 1 ms 472 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 9 ms 2392 KB Output is correct
17 Correct 9 ms 656 KB Output is correct
18 Correct 9 ms 2392 KB Output is correct
19 Correct 9 ms 600 KB Output is correct
20 Correct 5 ms 600 KB Output is correct
21 Correct 35 ms 1112 KB Output is correct
22 Correct 41 ms 1108 KB Output is correct
23 Correct 34 ms 1112 KB Output is correct
24 Correct 36 ms 1112 KB Output is correct
25 Correct 33 ms 1112 KB Output is correct
26 Correct 41 ms 2648 KB Output is correct
27 Correct 35 ms 1112 KB Output is correct
28 Correct 35 ms 2648 KB Output is correct
29 Correct 35 ms 2648 KB Output is correct
30 Correct 20 ms 2648 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct