oj.uz

답안 #134507

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
134507 2019-07-23T00:28:17 Z tri 커다란 상품 (IOI17_prize) C++14
20 / 100
 50 ms 504 KB 
#include <bits/stdc++.h>
#include "prize.h"

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;

#define pb push_back
#define f first
#define s second

namespace debug {
    const int DEBUG = false;

    template<class T1, class T2>
    void pr(const pair<T1, T2> &x);

    template<class T, size_t SZ>
    void pr(const array<T, SZ> &x);

    template<class T>
    void pr(const vector<T> &x);

    template<class T>
    void pr(const set<T> &x);

    template<class T1, class T2>
    void pr(const map<T1, T2> &x);

    template<class T>
    void pr(const T &x) { if (DEBUG) cout << x; }

    template<class T, class... Ts>
    void pr(const T &first, const Ts &... rest) { pr(first), pr(rest...); }

    template<class T1, class T2>
    void pr(const pair<T1, T2> &x) { pr("{", x.f, ", ", x.s, "}"); }

    template<class T>
    void prIn(const T &x) {
        pr("{");
        bool fst = 1;
        for (auto &a : x) {
            pr(fst ? "" : ", ", a), fst = 0;
        }
        pr("}");
    }

    template<class T, size_t SZ>
    void pr(const array<T, SZ> &x) { prIn(x); }

    template<class T>
    void pr(const vector<T> &x) { prIn(x); }

    template<class T>
    void pr(const set<T> &x) { prIn(x); }

    template<class T1, class T2>
    void pr(const map<T1, T2> &x) { prIn(x); }

    void ps() { pr("\n"), cout << flush; }

    template<class Arg, class... Args>
    void ps(const Arg &first, const Args &... rest) {
        pr(first, " ");
        ps(rest...);
    }
}
using namespace debug;


int callCnt = 0;

int gGrt(int i) {
    callCnt++;
//    ps("callCnt", callCnt);
    vi ret = ask(i);
    return ret[0] + ret[1];
}

int maxG, ans = -1;

void srch(int l, int r, int cnt, int lS, int rS) {
    if (ans != -1) {
        return;
    }
    if (l > r) {
        return;
    }

    if (cnt == 0) {
        return;
    }

    assert(r - l + 1 >= cnt);
    assert(l <= r);

    if (r - l + 1 == cnt) {
        for (int i = l; i <= r; i++) {
            if (gGrt(i) == 0) {
                ans = i;
                return;
            }
        }
        return;
    }

    int oMid = (l + r) / 2;
    int mid = oMid;
    vi ret = ask(mid);

    while (ret[0] + ret[1] != maxG) {
        if (ret[0] + ret[1] == 0) {
            ans = mid;
            return;
        }

        mid++;
        if (mid > r) {
            int found = mid - oMid;
            srch(l, oMid - 1, cnt - found, lS, rS + found);
        }
        ret = ask(mid);
    }

    int found = mid - oMid;
    srch(l, oMid - 1, ret[0] - found - lS, lS, ret[1] + found);
    srch(mid + 1, r, ret[1] - rS, ret[0], rS);
}

int find_best(int N) {
    if (N < 4000) {
        for (int i = 0; i < N; i++) {
            if (gGrt(i) == 0) {
                return i;
            }
        }
    }

    int tier = 473;
    int found = 0;
    maxG = 0;

    for (int i = 0; i < tier + 1; i++) {
        int grt = gGrt(i);
//        ps(i, grt);
        if (grt == 0) {
            return i;
        }
        if (maxG == grt) {
        } else if (maxG < grt) {
            maxG = grt;
            found = i;
        } else {
            found++;
        }
    }

    srch(tier + 1, N - 1, maxG - found, found, 0);
    return ans;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 248 KB Output is correct
2 Correct 4 ms 504 KB Output is correct
3 Correct 4 ms 316 KB Output is correct
4 Correct 6 ms 248 KB Output is correct
5 Correct 7 ms 248 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 5 ms 248 KB Output is correct
8 Correct 4 ms 504 KB Output is correct
9 Correct 8 ms 376 KB Output is correct
10 Correct 8 ms 376 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 404 KB Output is correct
2 Correct 4 ms 376 KB Output is correct
3 Correct 7 ms 388 KB Output is correct
4 Correct 6 ms 380 KB Output is correct
5 Correct 7 ms 248 KB Output is correct
6 Correct 2 ms 248 KB Output is correct
7 Correct 7 ms 308 KB Output is correct
8 Correct 4 ms 376 KB Output is correct
9 Correct 4 ms 376 KB Output is correct
10 Correct 6 ms 248 KB Output is correct
11 Correct 9 ms 404 KB Output is correct
12 Correct 4 ms 376 KB Output is correct
13 Correct 6 ms 504 KB Output is correct
14 Correct 7 ms 248 KB Output is correct
15 Correct 7 ms 312 KB Output is correct
16 Correct 37 ms 248 KB Output is correct
17 Correct 7 ms 248 KB Output is correct
18 Correct 27 ms 392 KB Output is correct
19 Correct 6 ms 248 KB Output is correct
20 Correct 16 ms 248 KB Output is correct
21 Correct 24 ms 248 KB Output is correct
22 Correct 9 ms 248 KB Output is correct
23 Correct 4 ms 308 KB Output is correct
24 Correct 7 ms 248 KB Output is correct
25 Correct 16 ms 304 KB Output is correct
26 Correct 33 ms 376 KB Output is correct
27 Correct 5 ms 392 KB Output is correct
28 Correct 43 ms 248 KB Output is correct
29 Correct 33 ms 248 KB Output is correct
30 Correct 50 ms 248 KB Output is correct
31 Correct 7 ms 248 KB Output is correct
32 Correct 12 ms 252 KB Output is correct
33 Correct 2 ms 248 KB Output is correct
34 Correct 11 ms 376 KB Output is correct
35 Correct 7 ms 252 KB Output is correct
36 Correct 9 ms 376 KB Output is correct
37 Correct 6 ms 248 KB Output is correct
38 Correct 4 ms 312 KB Output is correct
39 Correct 28 ms 248 KB Output is correct
40 Correct 45 ms 248 KB Output is correct
41 Correct 30 ms 248 KB Output is correct
42 Correct 31 ms 248 KB Output is correct
43 Correct 31 ms 304 KB Output is correct
44 Correct 13 ms 308 KB Output is correct
45 Correct 20 ms 296 KB Output is correct
46 Correct 6 ms 392 KB Output is correct
47 Correct 28 ms 376 KB Output is correct
48 Correct 39 ms 252 KB Output is correct
49 Correct 12 ms 376 KB Output is correct
50 Correct 38 ms 376 KB Output is correct
51 Correct 26 ms 376 KB Output is correct
52 Correct 8 ms 376 KB Output is correct
53 Correct 9 ms 248 KB Output is correct
54 Correct 14 ms 316 KB Output is correct
55 Correct 5 ms 248 KB Output is correct
56 Correct 29 ms 312 KB Output is correct
57 Correct 36 ms 376 KB Output is correct
58 Correct 43 ms 248 KB Output is correct
59 Correct 30 ms 248 KB Output is correct
60 Correct 29 ms 308 KB Output is correct
61 Correct 8 ms 248 KB Output is correct
62 Correct 6 ms 248 KB Output is correct
63 Correct 8 ms 376 KB Output is correct
64 Correct 7 ms 248 KB Output is correct
65 Correct 4 ms 392 KB Output is correct
66 Correct 11 ms 308 KB Output is correct
67 Incorrect 9 ms 388 KB Integer 200000 violates the range [0, 199999]
68 Halted 0 ms 0 KB -