oj.uz

Submission #70415

# Submission time Handle Problem Language Result Execution time Memory
70415 2018-08-22T20:07:11 Z chpipis The Big Prize (IOI17_prize) C++11
0 / 100
 98 ms 6216 KB 
#include "prize.h"
#include <bits/stdc++.h>

using namespace std;

typedef vector<int> vi;

const int MAXN = 2e5 + 5;
const int SIZE = 350;

int cnt[MAXN], num_q;
vi memo[MAXN];

vi query(int x) {
    if (memo[x].size() > 0)
        return memo[x];
    num_q++;
    vi ret = ask(x);
    return memo[x] = ret;
}

int find_best(int n) {
    memset(cnt, 0, sizeof cnt);
    fill(memo, memo + n + 1, vi());
    num_q = 0;
    /*
    int mx = -1;
    for (int i = 0, j; i < n; i = j + 1) {
        if (i == n - 1) return i;
        j = i;
        vi cur = query(i);
        if (cur[0] + cur[1] == 0) return i;
        if (cur[0] + cur[1] < mx) continue;
        mx = max(mx, cur[0] + cur[1]);
        int lo = i + 1, hi = n - 1;
        while (lo <= hi) {
            int mid = (lo + hi) >> 1;
            vi now = query(mid);
            if (now[0] + now[1] == 0) return mid;
            if (now == cur) {
                lo = mid + 1;
                j = mid;
            } else {
                hi = mid - 1;
            }
        }
    }
    */
    bool dobin = false;
    for (int i = 0; i < n; i++) {
        if (i == n - 1) return i;
        vi cur = query(i);
        int type = cur[0] + cur[1];
        if (type == 0) return i;
        cnt[type]++;
        if (query(i + 1) != cur) {
            dobin = false;
            continue;
        } else {
            dobin = true;
            continue;
        }
        if (dobin) {
        int b;
        for (b = i / SIZE; (b + 1) * SIZE < n; b++) {
            vi now = query((b + 1) * SIZE);
            //if (now != cur)
            if (!(now == cur || (now[0] == cnt[type] + cur[0] && now[1] >= cur[1])))
                break;
            cnt[now[0] + now[1]] += b * SIZE + SIZE - 1 - max(i, b * SIZE - 1);
        }
        int lo = max(i + 1, b * SIZE), hi = min(n - 1, (b + 1) * SIZE);
        if (i == (b + 1) * SIZE - 1) {
            lo = (b + 1) * SIZE;
            hi = min(n - 1, (b + 2) * SIZE);
        }
        while (lo < hi) {
            int mid = (lo + hi) >> 1;
            vi now = query(mid);
            //if (now == cur) {
            if (now == cur || (now[0] == cnt[type] + cur[0] && now[1] >= cur[1])) {
                cnt[now[0] + now[1]] += mid - lo + 1;
                lo = mid + 1;
            } else {
                hi = mid;
            }
        }
        i = hi - 1;
        }
    }
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:91:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 71 ms 6084 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Incorrect 98 ms 6216 KB Incorrect
2 Halted 0 ms 0 KB -