Submission #72826

# Submission time Handle Problem Language Result Execution time Memory
72826 2018-08-27T03:52:49 Z funcsr The Big Prize (IOI17_prize) C++17
92.92 / 100
101 ms 2220 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;
mt19937 mt_rand(114514);
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);
  //if(Q%100==0)cout<<"Q="<<Q<<"\n";
  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;
  //int mm = l+(mt_rand()%(r-l+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;
  }
  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;
  }
  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, 500) {
    P ret = query(mt_rand()%N);
    mp = max(mp, ret._1+ret._2);
  }
  //cout<<"mp="<<mp<<"\n";
  int r = solve(0, N-1, mp, 0);
  assert(r != -1);
  return r;
}
# Verdict Execution time Memory Grader output
1 Correct 5 ms 1784 KB Output is correct
2 Correct 13 ms 1972 KB Output is correct
3 Correct 9 ms 1972 KB Output is correct
4 Correct 15 ms 1972 KB Output is correct
5 Correct 6 ms 1984 KB Output is correct
6 Correct 8 ms 1984 KB Output is correct
7 Correct 14 ms 2028 KB Output is correct
8 Correct 13 ms 2036 KB Output is correct
9 Correct 10 ms 2056 KB Output is correct
10 Correct 7 ms 2056 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 9 ms 2220 KB Output is correct
2 Correct 8 ms 2220 KB Output is correct
3 Correct 9 ms 2220 KB Output is correct
4 Correct 10 ms 2220 KB Output is correct
5 Correct 10 ms 2220 KB Output is correct
6 Correct 10 ms 2220 KB Output is correct
7 Correct 10 ms 2220 KB Output is correct
8 Correct 9 ms 2220 KB Output is correct
9 Correct 11 ms 2220 KB Output is correct
10 Correct 10 ms 2220 KB Output is correct
11 Correct 13 ms 2220 KB Output is correct
12 Correct 10 ms 2220 KB Output is correct
13 Correct 16 ms 2220 KB Output is correct
14 Correct 9 ms 2220 KB Output is correct
15 Correct 18 ms 2220 KB Output is correct
16 Correct 42 ms 2220 KB Output is correct
17 Correct 5 ms 2220 KB Output is correct
18 Partially correct 53 ms 2220 KB Partially correct - number of queries: 5280
19 Correct 13 ms 2220 KB Output is correct
20 Correct 19 ms 2220 KB Output is correct
21 Correct 25 ms 2220 KB Output is correct
22 Correct 12 ms 2220 KB Output is correct
23 Correct 10 ms 2220 KB Output is correct
24 Correct 7 ms 2220 KB Output is correct
25 Correct 31 ms 2220 KB Output is correct
26 Correct 18 ms 2220 KB Output is correct
27 Correct 10 ms 2220 KB Output is correct
28 Correct 56 ms 2220 KB Output is correct
29 Correct 48 ms 2220 KB Output is correct
30 Partially correct 61 ms 2220 KB Partially correct - number of queries: 5228
31 Correct 9 ms 2220 KB Output is correct
32 Correct 9 ms 2220 KB Output is correct
33 Correct 2 ms 2220 KB Output is correct
34 Correct 25 ms 2220 KB Output is correct
35 Correct 8 ms 2220 KB Output is correct
36 Correct 21 ms 2220 KB Output is correct
37 Correct 13 ms 2220 KB Output is correct
38 Correct 12 ms 2220 KB Output is correct
39 Correct 37 ms 2220 KB Output is correct
40 Correct 53 ms 2220 KB Output is correct
41 Correct 27 ms 2220 KB Output is correct
42 Correct 44 ms 2220 KB Output is correct
43 Correct 31 ms 2220 KB Output is correct
44 Correct 13 ms 2220 KB Output is correct
45 Correct 24 ms 2220 KB Output is correct
46 Correct 11 ms 2220 KB Output is correct
47 Correct 27 ms 2220 KB Output is correct
48 Correct 30 ms 2220 KB Output is correct
49 Correct 15 ms 2220 KB Output is correct
50 Partially correct 72 ms 2220 KB Partially correct - number of queries: 5275
51 Correct 33 ms 2220 KB Output is correct
52 Correct 10 ms 2220 KB Output is correct
53 Correct 11 ms 2220 KB Output is correct
54 Correct 17 ms 2220 KB Output is correct
55 Correct 8 ms 2220 KB Output is correct
56 Partially correct 70 ms 2220 KB Partially correct - number of queries: 5259
57 Correct 55 ms 2220 KB Output is correct
58 Correct 53 ms 2220 KB Output is correct
59 Correct 28 ms 2220 KB Output is correct
60 Correct 34 ms 2220 KB Output is correct
61 Correct 12 ms 2220 KB Output is correct
62 Correct 5 ms 2220 KB Output is correct
63 Correct 8 ms 2220 KB Output is correct
64 Correct 13 ms 2220 KB Output is correct
65 Correct 14 ms 2220 KB Output is correct
66 Correct 15 ms 2220 KB Output is correct
67 Correct 12 ms 2220 KB Output is correct
68 Correct 12 ms 2220 KB Output is correct
69 Correct 11 ms 2220 KB Output is correct
70 Correct 7 ms 2220 KB Output is correct
71 Partially correct 79 ms 2220 KB Partially correct - number of queries: 5708
72 Correct 15 ms 2220 KB Output is correct
73 Partially correct 61 ms 2220 KB Partially correct - number of queries: 5640
74 Partially correct 91 ms 2220 KB Partially correct - number of queries: 5670
75 Correct 9 ms 2220 KB Output is correct
76 Partially correct 25 ms 2220 KB Partially correct - number of queries: 5003
77 Partially correct 60 ms 2220 KB Partially correct - number of queries: 5551
78 Correct 13 ms 2220 KB Output is correct
79 Correct 46 ms 2220 KB Output is correct
80 Partially correct 101 ms 2220 KB Partially correct - number of queries: 5540
81 Partially correct 63 ms 2220 KB Partially correct - number of queries: 5543
82 Partially correct 74 ms 2220 KB Partially correct - number of queries: 5508
83 Correct 9 ms 2220 KB Output is correct
84 Correct 42 ms 2220 KB Output is correct
85 Partially correct 51 ms 2220 KB Partially correct - number of queries: 5560
86 Correct 38 ms 2220 KB Output is correct
87 Correct 8 ms 2220 KB Output is correct
88 Correct 39 ms 2220 KB Output is correct
89 Correct 49 ms 2220 KB Output is correct
90 Correct 13 ms 2220 KB Output is correct
91 Correct 30 ms 2220 KB Output is correct
92 Correct 44 ms 2220 KB Output is correct
93 Correct 47 ms 2220 KB Output is correct
94 Correct 27 ms 2220 KB Output is correct
95 Correct 49 ms 2220 KB Output is correct
96 Correct 69 ms 2220 KB Output is correct
97 Correct 53 ms 2220 KB Output is correct