oj.uz

답안 #1010341

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1010341 2024-06-28T21:05:23 Z whatthemomooofun1729 Gap (APIO16_gap) C++17
48.5412 / 100
 2000 ms 1240 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) {
    auto it = upper_bound(all(v), s);
    if (it != v.end() && (*it) < t) mn = *it;
    else mn = -1;
    auto ti = lower_bound(all(v), t);
    if (ti != v.begin() && (*prev(it)) > s) mx = *it;
    else mx = -1;
}*/

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) {
            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 = 1e18;
        set<ll> p;
        while (1) {
            ll mn, mx;
            MinMax(l, r, &mn, &mx);
            if (mn == -1) {
                break;
            }
            p.insert(mn);
            p.insert(mx);
            l = mn, r = mx;
        }
        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("");

}*/

// 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

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3045 ms 596 KB Time limit exceeded
2 Execution timed out 3040 ms 344 KB Time limit exceeded
3 Execution timed out 3068 ms 344 KB Time limit exceeded
4 Execution timed out 3044 ms 344 KB Time limit exceeded
5 Execution timed out 3060 ms 344 KB Time limit exceeded
6 Execution timed out 3074 ms 344 KB Time limit exceeded
7 Execution timed out 3062 ms 344 KB Time limit exceeded
8 Execution timed out 3070 ms 344 KB Time limit exceeded
9 Execution timed out 3040 ms 344 KB Time limit exceeded
10 Execution timed out 3054 ms 344 KB Time limit exceeded
11 Execution timed out 3067 ms 344 KB Time limit exceeded
12 Execution timed out 3024 ms 344 KB Time limit exceeded
13 Execution timed out 3063 ms 344 KB Time limit exceeded
14 Execution timed out 3036 ms 344 KB Time limit exceeded
15 Execution timed out 3069 ms 344 KB Time limit exceeded
16 Execution timed out 3022 ms 600 KB Time limit exceeded
17 Execution timed out 3044 ms 600 KB Time limit exceeded
18 Execution timed out 3084 ms 600 KB Time limit exceeded
19 Execution timed out 3056 ms 600 KB Time limit exceeded
20 Execution timed out 3058 ms 600 KB Time limit exceeded
21 Execution timed out 3039 ms 1112 KB Time limit exceeded
22 Execution timed out 3067 ms 1112 KB Time limit exceeded
23 Execution timed out 3035 ms 1112 KB Time limit exceeded
24 Execution timed out 3065 ms 1112 KB Time limit exceeded
25 Execution timed out 3037 ms 1112 KB Time limit exceeded
26 Execution timed out 3067 ms 1112 KB Time limit exceeded
27 Execution timed out 3053 ms 1052 KB Time limit exceeded
28 Execution timed out 3066 ms 1112 KB Time limit exceeded
29 Execution timed out 3064 ms 1112 KB Time limit exceeded
30 Execution timed out 3048 ms 1112 KB Time limit exceeded
31 Execution timed out 3028 ms 344 KB Time limit exceeded
32 Execution timed out 3073 ms 344 KB Time limit exceeded

Subtask #2
48.5411952864 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Partially correct 0 ms 344 KB Partially correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 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 Partially correct 1 ms 344 KB Partially correct
16 Correct 10 ms 428 KB Output is correct
17 Correct 8 ms 600 KB Output is correct
18 Correct 10 ms 548 KB Output is correct
19 Correct 10 ms 600 KB Output is correct
20 Partially correct 4 ms 600 KB Partially correct
21 Correct 34 ms 1212 KB Output is correct
22 Correct 34 ms 1112 KB Output is correct
23 Correct 42 ms 1112 KB Output is correct
24 Correct 41 ms 1232 KB Output is correct
25 Partially correct 39 ms 1240 KB Partially correct
26 Correct 41 ms 1112 KB Output is correct
27 Correct 34 ms 1112 KB Output is correct
28 Correct 34 ms 1112 KB Output is correct
29 Correct 35 ms 1112 KB Output is correct
30 Partially correct 21 ms 1112 KB Partially correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct