oj.uz

답안 #950131

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
950131 2024-03-20T05:40:13 Z quanlt206 Gap (APIO16_gap) C++17
89.0204 / 100
 50 ms 10388 KB 
#include "gap.h"
#include<bits/stdc++.h>
#define X first
#define Y second
#define all(x) begin(x), end(x)
#define FOR(i, a, b) for(int i = (a); i <= (b); i++)
#define FORD(i, b, a) for(int i = (b); i >= (a); i--)
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define mxx max_element
#define mnn min_element
#define SQR(x) (1LL * (x) * (x))
#define MASK(i) (1LL << (i))
#define Point Vector
#define left Left
#define right Right
#define div Div
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;
typedef pair<db, db> pdb;
typedef pair<ld, ld> pld;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> plll;
typedef pair<ll, int> pli;
typedef pair<ll, pii> plii;
 
template<class A, class B>
    bool maximize(A& x, B y) {
        if (x < y) return x = y, true; else return false;
    }
template<class A, class B>
    bool minimize(A& x, B y) {
        if (x > y) return x = y, true; else return false;
    }
/* END OF TEMPLATE */
 
const int N = 1e5 + 7;
 
ll a[N], b[N];
int n;
int cntQuery = 0;
 
ll sub1(int n) {
    int l = 1, r = n;
    ll s = 0, t = 1e18;
    while (l <= r) {
        ll* mn = new ll();
        ll* mx = new ll();
        MinMax(s, t, mn, mx);
        a[l] = *mn;
        a[r] = *mx;
        l++;
        r--;
        s = *mn + 1;
        t = *mx - 1;
    }
    ll res = 0;
    REP(i, 1, n) maximize(res, a[i + 1] - a[i]);
    return res;
}
 
ll findGap(int T, int n) {
    if (T == 1 || n <= 7) return sub1(n);
    a[0] = -1;
    ll res = 0;
    int i = 1;
    ll* mn = new ll();
    ll* mx = new ll();
    MinMax(0, 1e18, mn, mx);
    ll Max = *mx, Min = *mn;
    res = (Max - Min) / (n - 1);
    if (1LL * res * (n - 1) < Max - Min) res++;
    vector<pll> A;
    for (ll i = Min; i <= Max; i+=res) {
        ll* mn = new ll();
        ll* mx = new ll();
        MinMax(i, i + res - 1, mn, mx);
//        if (!A.empty() && *mn != -1) maximize(res, *mn - A.back().Y);
        if (*mn != -1) A.push_back({*mn, *mx});
    }
    REP(i, 1, (int)A.size()) maximize(res, A[i].X - A[i - 1].Y);
    return res;
}

Compilation message

gap.cpp: In function 'll findGap(int, int)':
gap.cpp:72:9: warning: unused variable 'i' [-Wunused-variable]
   72 |     int i = 1;
      |         ^

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 356 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 0 ms 2392 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 0 ms 2392 KB Output is correct
8 Correct 1 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 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 8 ms 3308 KB Output is correct
17 Correct 8 ms 3472 KB Output is correct
18 Correct 8 ms 3308 KB Output is correct
19 Correct 8 ms 3472 KB Output is correct
20 Correct 7 ms 3304 KB Output is correct
21 Correct 29 ms 6512 KB Output is correct
22 Correct 29 ms 6524 KB Output is correct
23 Correct 35 ms 6520 KB Output is correct
24 Correct 30 ms 6520 KB Output is correct
25 Correct 27 ms 6520 KB Output is correct
26 Correct 29 ms 6536 KB Output is correct
27 Correct 29 ms 6516 KB Output is correct
28 Correct 31 ms 6748 KB Output is correct
29 Correct 30 ms 6512 KB Output is correct
30 Correct 25 ms 6516 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2544 KB Output is correct

Subtask #2
59.0203916407 / 70.0

# 결과 실행 시간 메모리 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 1 ms 2392 KB Output is correct
5 Partially correct 0 ms 2392 KB Partially 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 0 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 2 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 Partially correct 1 ms 2392 KB Partially correct
16 Correct 12 ms 4328 KB Output is correct
17 Correct 11 ms 4324 KB Output is correct
18 Correct 11 ms 4204 KB Output is correct
19 Correct 11 ms 4200 KB Output is correct
20 Correct 6 ms 4076 KB Output is correct
21 Correct 44 ms 9708 KB Output is correct
22 Correct 50 ms 9868 KB Output is correct
23 Correct 43 ms 9692 KB Output is correct
24 Correct 46 ms 9708 KB Output is correct
25 Partially correct 49 ms 10388 KB Partially correct
26 Correct 48 ms 9936 KB Output is correct
27 Correct 46 ms 9900 KB Output is correct
28 Correct 43 ms 9704 KB Output is correct
29 Correct 47 ms 9976 KB Output is correct
30 Correct 27 ms 8924 KB Output is correct
31 Partially correct 1 ms 2392 KB Partially correct
32 Partially correct 1 ms 2392 KB Partially correct