oj.uz

Submission #1113544

# Submission time Handle Problem Language Result Execution time Memory
1113544 2024-11-16T17:46:15 Z epicci23 The Big Prize (IOI17_prize) C++17
90 / 100
 163 ms 1824 KB 
#include "bits/stdc++.h"
#include "prize.h"
//#define int long long
#define all(v) v.begin() , v.end()
#define sz(a) (int)a.size()
using namespace std;
 
const int BL = 2000;

int suf = -1;
vector<int> Cache = {-1, -1};
map<int,vector<int>> dp;
 
vector<int> Ask(int i){
  if( dp.count(i) ) return dp[i];
  return dp[i] = ask(i);
}
 
int ask_all(int l,int r){
  for(int i = l; i <= r; i++){
    vector<int> x = Ask(i);
    if(x[0] + x[1] == 0) return i;
    if(x[1] == suf) Cache = x;
    else suf--;
  }
  return -23;
}
 
int Learn(int l,int r){
  if(l>r) return -1;
  if(l==r){
    auto u = Ask(l);
    if(u[0] + u[1] == 0) return l;
    if(u[1] == suf) Cache=u;
    else suf--;
    return -1;
  }

  auto X = Ask(r);
  if(X[0] + X[1] == 0) return r;
  if(X[1] == suf) return -1;

  if(l+BL+1<r){
    auto u = Ask(l + BL);
    if(u[0]+u[1]==0) return l+BL;
    if(u[1] == suf) return Learn(l+BL+1,r-1);
    int hm = Learn(l,l+BL-1);
    if(hm != -1) return hm;
    if(u[1] == suf) Cache = u;
    else suf--;
    if(X[1] == suf - ( Cache[0] + Cache[1] > X[0] + X[1] ) ) return -1;
    int hm2 = Learn(l+BL+1,r-1);
    if(hm2 != -1) return hm2;
    if(X[1] == suf) Cache = X;
    else suf--;
    return -1;
  }

  int mid = (l+r) / 2;
  auto u = Ask(mid);
  if(u[0] + u[1] == 0) return mid;
  if(u[1] == suf) return Learn(mid + 1,r - 1);
  int lf = Learn(l,mid - 1);
  if(lf != -1) return lf;
  if(u[1]==suf) Cache = u;
  else suf--; 
  if(X[1] == suf - ( Cache[0] + Cache[1] > X[0] + X[1] ) ) return -1;
  int hm = Learn( mid + 1, r - 1 );
  if(hm != -1) return hm;
  if(X[1] == suf) Cache = X;
  else suf--;
  return -1;
}
 
int find_best(int n){
  if(n <= 1000) return ask_all(0, n - 1);
  int art = 0;
  for(int i = 0; i <= 500; i++){
  	if(art == 5) return Learn(i, n - 1);
    vector<int> x = Ask(i);
    if(x[0] + x[1] == 0) return i;
    if(x[0] + x[1] > Cache[0] + Cache[1]) art++;
    if(x[0] + x[1] >= Cache[0] + Cache[1]){
      Cache = x;
      suf = Cache[1];
    }
    else suf--;
  }
  return Learn(501, n - 1 );
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 336 KB Output is correct
2 Correct 12 ms 592 KB Output is correct
3 Correct 10 ms 336 KB Output is correct
4 Correct 10 ms 592 KB Output is correct
5 Correct 9 ms 452 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 12 ms 336 KB Output is correct
8 Correct 11 ms 508 KB Output is correct
9 Correct 10 ms 684 KB Output is correct
10 Correct 15 ms 336 KB Output is correct

Subtask #2
70.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 336 KB Output is correct
2 Correct 10 ms 1116 KB Output is correct
3 Correct 14 ms 488 KB Output is correct
4 Correct 8 ms 460 KB Output is correct
5 Correct 10 ms 848 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 9 ms 708 KB Output is correct
8 Correct 10 ms 496 KB Output is correct
9 Correct 12 ms 860 KB Output is correct
10 Correct 12 ms 480 KB Output is correct
11 Correct 15 ms 980 KB Output is correct
12 Correct 10 ms 508 KB Output is correct
13 Correct 22 ms 548 KB Output is correct
14 Correct 14 ms 496 KB Output is correct
15 Correct 28 ms 584 KB Output is correct
16 Partially correct 120 ms 1328 KB Partially correct - number of queries: 6615
17 Correct 6 ms 600 KB Output is correct
18 Partially correct 132 ms 1268 KB Partially correct - number of queries: 7885
19 Correct 7 ms 336 KB Output is correct
20 Correct 38 ms 600 KB Output is correct
21 Correct 58 ms 720 KB Output is correct
22 Correct 17 ms 528 KB Output is correct
23 Correct 9 ms 700 KB Output is correct
24 Correct 9 ms 484 KB Output is correct
25 Correct 75 ms 1068 KB Output is correct
26 Correct 65 ms 888 KB Output is correct
27 Correct 11 ms 584 KB Output is correct
28 Partially correct 128 ms 1188 KB Partially correct - number of queries: 6910
29 Partially correct 93 ms 1260 KB Partially correct - number of queries: 5372
30 Partially correct 141 ms 1444 KB Partially correct - number of queries: 7957
31 Correct 9 ms 848 KB Output is correct
32 Correct 18 ms 748 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 49 ms 572 KB Output is correct
35 Correct 15 ms 496 KB Output is correct
36 Correct 25 ms 592 KB Output is correct
37 Correct 12 ms 756 KB Output is correct
38 Correct 10 ms 476 KB Output is correct
39 Correct 72 ms 1220 KB Output is correct
40 Partially correct 114 ms 1292 KB Partially correct - number of queries: 7072
41 Correct 75 ms 1280 KB Output is correct
42 Correct 71 ms 1736 KB Output is correct
43 Correct 65 ms 1096 KB Output is correct
44 Correct 51 ms 872 KB Output is correct
45 Correct 44 ms 924 KB Output is correct
46 Correct 8 ms 476 KB Output is correct
47 Correct 57 ms 1060 KB Output is correct
48 Partially correct 94 ms 1824 KB Partially correct - number of queries: 5765
49 Correct 20 ms 336 KB Output is correct
50 Partially correct 141 ms 1356 KB Partially correct - number of queries: 7846
51 Correct 60 ms 1744 KB Output is correct
52 Correct 10 ms 336 KB Output is correct
53 Correct 16 ms 604 KB Output is correct
54 Correct 67 ms 960 KB Output is correct
55 Correct 6 ms 336 KB Output is correct
56 Partially correct 145 ms 1512 KB Partially correct - number of queries: 7848
57 Partially correct 91 ms 1212 KB Partially correct - number of queries: 5741
58 Partially correct 104 ms 1000 KB Partially correct - number of queries: 5824
59 Correct 87 ms 1104 KB Output is correct
60 Correct 68 ms 1132 KB Output is correct
61 Correct 15 ms 336 KB Output is correct
62 Correct 9 ms 592 KB Output is correct
63 Correct 14 ms 336 KB Output is correct
64 Correct 12 ms 684 KB Output is correct
65 Correct 9 ms 336 KB Output is correct
66 Correct 10 ms 592 KB Output is correct
67 Correct 13 ms 336 KB Output is correct
68 Correct 8 ms 336 KB Output is correct
69 Correct 10 ms 336 KB Output is correct
70 Correct 13 ms 468 KB Output is correct
71 Partially correct 151 ms 1616 KB Partially correct - number of queries: 8702
72 Correct 25 ms 716 KB Output is correct
73 Partially correct 125 ms 1572 KB Partially correct - number of queries: 8604
74 Partially correct 163 ms 1716 KB Partially correct - number of queries: 8646
75 Correct 15 ms 752 KB Output is correct
76 Partially correct 127 ms 1408 KB Partially correct - number of queries: 7694
77 Partially correct 136 ms 1536 KB Partially correct - number of queries: 8065
78 Correct 22 ms 684 KB Output is correct
79 Correct 73 ms 1124 KB Output is correct
80 Partially correct 119 ms 1288 KB Partially correct - number of queries: 7964
81 Partially correct 138 ms 1492 KB Partially correct - number of queries: 8020
82 Partially correct 133 ms 1500 KB Partially correct - number of queries: 7895
83 Correct 17 ms 592 KB Output is correct
84 Partially correct 115 ms 1764 KB Partially correct - number of queries: 6815
85 Partially correct 139 ms 1796 KB Partially correct - number of queries: 7918
86 Correct 10 ms 596 KB Output is correct
87 Correct 13 ms 488 KB Output is correct
88 Correct 12 ms 488 KB Output is correct
89 Correct 14 ms 760 KB Output is correct
90 Correct 14 ms 740 KB Output is correct
91 Correct 10 ms 480 KB Output is correct
92 Correct 10 ms 1104 KB Output is correct
93 Correct 18 ms 336 KB Output is correct
94 Correct 22 ms 336 KB Output is correct
95 Correct 15 ms 848 KB Output is correct
96 Correct 19 ms 616 KB Output is correct
97 Correct 13 ms 500 KB Output is correct