Submission #72841

# Submission time Handle Problem Language Result Execution time Memory
72841 2018-08-27T05:13:28 Z funcsr The Big Prize (IOI17_prize) C++17
96.32 / 100
70 ms 2236 KB
#include "prize.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <cmath>
#include <cassert>
#include <random>
using namespace std;
#define rep(i,n)for (int i=0; i<(n); i++)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define _1 first
#define _2 second
#define INF 1145141919
typedef pair<int, int> P;
int mp = 0;
P cache[200000];
int Q=0;
P query(int x) {
  if (cache[x] != P(-1, -1)) return cache[x];
  Q++;
  assert(Q<=10000);
  vector<int> ret = ask(x);
  return cache[x] = {ret[0], ret[1]};
}

int solve(int l, int r, int num, int left) {
  assert(num >= 0 && left >= 0);
  if (num == 0) return -1;
  //cout<<"solve("<<l<<","<<r<<", num="<<num<<")\n";
  int mm = (l+r)/2;
  for (int mid=mm; mid>=l; mid--) {
    P ret = query(mid);
    if (ret._1+ret._2 == 0) return mid;
    if (ret._1+ret._2 != mp) continue;
    if (mid > l) {
      int o = solve(l, mid-1, ret._1-left, left);
      if (o != -1) return o;
    }
    if (mid < r) {
      int o = solve(mid+1, r, num-(ret._1-left), ret._1);
      if (o != -1) return o;
    }
    return -1;
  }
  for (int mid=mm+1; mid<=r; mid++) {
    P ret = query(mid);
    if (ret._1+ret._2 == 0) return mid;
    if (ret._1+ret._2 != mp) continue;
    if (mid > l) {
      int o = solve(l, mid-1, ret._1-left, left);
      if (o != -1) return o;
    }
    if (mid < r) {
      int o = solve(mid+1, r, num-(ret._1-left), ret._1);
      if (o != -1) return o;
    }
    return -1;
  }
  return -1;
}

int find_best(int N) {
  rep(i, N) cache[i] = P(-1, -1);
  if (N <= 5000) {
    rep(i, N) {
      P ret = query(i);
      if (ret._1+ret._2 == 0) return i;
    }
    abort();
  }
  rep(i, 473) {
    P ret = query(i);
    mp = max(mp, ret._1+ret._2);
  }
  int r = solve(0, N-1, mp, 0);
  assert(r != -1);
  return r;
}
# Verdict Execution time Memory Grader output
1 Correct 8 ms 1784 KB Output is correct
2 Correct 10 ms 1844 KB Output is correct
3 Correct 4 ms 1940 KB Output is correct
4 Correct 10 ms 1956 KB Output is correct
5 Correct 7 ms 1956 KB Output is correct
6 Correct 9 ms 1956 KB Output is correct
7 Correct 11 ms 1956 KB Output is correct
8 Correct 7 ms 2140 KB Output is correct
9 Correct 8 ms 2140 KB Output is correct
10 Correct 9 ms 2192 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 8 ms 2192 KB Output is correct
2 Correct 8 ms 2192 KB Output is correct
3 Correct 8 ms 2192 KB Output is correct
4 Correct 9 ms 2192 KB Output is correct
5 Correct 11 ms 2192 KB Output is correct
6 Correct 5 ms 2192 KB Output is correct
7 Correct 7 ms 2192 KB Output is correct
8 Correct 8 ms 2192 KB Output is correct
9 Correct 5 ms 2192 KB Output is correct
10 Correct 9 ms 2192 KB Output is correct
11 Correct 9 ms 2192 KB Output is correct
12 Correct 10 ms 2192 KB Output is correct
13 Correct 12 ms 2192 KB Output is correct
14 Correct 6 ms 2192 KB Output is correct
15 Correct 15 ms 2192 KB Output is correct
16 Correct 46 ms 2192 KB Output is correct
17 Correct 7 ms 2192 KB Output is correct
18 Partially correct 52 ms 2192 KB Partially correct - number of queries: 5227
19 Correct 8 ms 2192 KB Output is correct
20 Correct 14 ms 2192 KB Output is correct
21 Correct 13 ms 2192 KB Output is correct
22 Correct 15 ms 2192 KB Output is correct
23 Correct 11 ms 2192 KB Output is correct
24 Correct 11 ms 2192 KB Output is correct
25 Correct 14 ms 2192 KB Output is correct
26 Correct 40 ms 2192 KB Output is correct
27 Correct 10 ms 2192 KB Output is correct
28 Correct 37 ms 2192 KB Output is correct
29 Correct 31 ms 2236 KB Output is correct
30 Partially correct 62 ms 2236 KB Partially correct - number of queries: 5195
31 Correct 14 ms 2236 KB Output is correct
32 Correct 13 ms 2236 KB Output is correct
33 Correct 2 ms 2236 KB Output is correct
34 Correct 18 ms 2236 KB Output is correct
35 Correct 13 ms 2236 KB Output is correct
36 Correct 18 ms 2236 KB Output is correct
37 Correct 11 ms 2236 KB Output is correct
38 Correct 16 ms 2236 KB Output is correct
39 Correct 35 ms 2236 KB Output is correct
40 Correct 23 ms 2236 KB Output is correct
41 Correct 46 ms 2236 KB Output is correct
42 Correct 49 ms 2236 KB Output is correct
43 Correct 38 ms 2236 KB Output is correct
44 Correct 30 ms 2236 KB Output is correct
45 Correct 25 ms 2236 KB Output is correct
46 Correct 12 ms 2236 KB Output is correct
47 Correct 23 ms 2236 KB Output is correct
48 Correct 37 ms 2236 KB Output is correct
49 Correct 13 ms 2236 KB Output is correct
50 Partially correct 59 ms 2236 KB Partially correct - number of queries: 5233
51 Correct 24 ms 2236 KB Output is correct
52 Correct 7 ms 2236 KB Output is correct
53 Correct 9 ms 2236 KB Output is correct
54 Correct 24 ms 2236 KB Output is correct
55 Correct 12 ms 2236 KB Output is correct
56 Partially correct 46 ms 2236 KB Partially correct - number of queries: 5233
57 Correct 37 ms 2236 KB Output is correct
58 Correct 37 ms 2236 KB Output is correct
59 Correct 31 ms 2236 KB Output is correct
60 Correct 22 ms 2236 KB Output is correct
61 Correct 13 ms 2236 KB Output is correct
62 Correct 12 ms 2236 KB Output is correct
63 Correct 10 ms 2236 KB Output is correct
64 Correct 8 ms 2236 KB Output is correct
65 Correct 8 ms 2236 KB Output is correct
66 Correct 10 ms 2236 KB Output is correct
67 Correct 7 ms 2236 KB Output is correct
68 Correct 6 ms 2236 KB Output is correct
69 Correct 13 ms 2236 KB Output is correct
70 Correct 8 ms 2236 KB Output is correct
71 Partially correct 50 ms 2236 KB Partially correct - number of queries: 5231
72 Correct 10 ms 2236 KB Output is correct
73 Partially correct 60 ms 2236 KB Partially correct - number of queries: 5168
74 Partially correct 46 ms 2236 KB Partially correct - number of queries: 5195
75 Correct 8 ms 2236 KB Output is correct
76 Correct 49 ms 2236 KB Output is correct
77 Partially correct 70 ms 2236 KB Partially correct - number of queries: 5368
78 Correct 14 ms 2236 KB Output is correct
79 Correct 14 ms 2236 KB Output is correct
80 Partially correct 63 ms 2236 KB Partially correct - number of queries: 5344
81 Partially correct 67 ms 2236 KB Partially correct - number of queries: 5355
82 Partially correct 44 ms 2236 KB Partially correct - number of queries: 5297
83 Correct 11 ms 2236 KB Output is correct
84 Correct 32 ms 2236 KB Output is correct
85 Partially correct 63 ms 2236 KB Partially correct - number of queries: 5320
86 Correct 9 ms 2236 KB Output is correct
87 Correct 9 ms 2236 KB Output is correct
88 Correct 7 ms 2236 KB Output is correct
89 Correct 7 ms 2236 KB Output is correct
90 Correct 6 ms 2236 KB Output is correct
91 Correct 8 ms 2236 KB Output is correct
92 Correct 7 ms 2236 KB Output is correct
93 Correct 10 ms 2236 KB Output is correct
94 Correct 10 ms 2236 KB Output is correct
95 Correct 14 ms 2236 KB Output is correct
96 Correct 11 ms 2236 KB Output is correct
97 Correct 9 ms 2236 KB Output is correct