oj.uz

Submission #1113545

# Submission time Handle Problem Language Result Execution time Memory
1113545 2024-11-16T17:46:30 Z epicci23 The Big Prize (IOI17_prize) C++17
90 / 100
 172 ms 2000 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 = 3000;

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 8 ms 492 KB Output is correct
2 Correct 12 ms 444 KB Output is correct
3 Correct 10 ms 592 KB Output is correct
4 Correct 8 ms 464 KB Output is correct
5 Correct 11 ms 336 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 12 ms 724 KB Output is correct
8 Correct 10 ms 848 KB Output is correct
9 Correct 9 ms 492 KB Output is correct
10 Correct 11 ms 704 KB Output is correct

Subtask #2
70.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 592 KB Output is correct
2 Correct 11 ms 336 KB Output is correct
3 Correct 12 ms 616 KB Output is correct
4 Correct 10 ms 468 KB Output is correct
5 Correct 10 ms 472 KB Output is correct
6 Correct 1 ms 432 KB Output is correct
7 Correct 11 ms 336 KB Output is correct
8 Correct 11 ms 480 KB Output is correct
9 Correct 12 ms 336 KB Output is correct
10 Correct 12 ms 508 KB Output is correct
11 Correct 15 ms 780 KB Output is correct
12 Correct 9 ms 336 KB Output is correct
13 Correct 25 ms 636 KB Output is correct
14 Correct 10 ms 464 KB Output is correct
15 Correct 26 ms 584 KB Output is correct
16 Partially correct 137 ms 1816 KB Partially correct - number of queries: 6741
17 Correct 6 ms 336 KB Output is correct
18 Partially correct 148 ms 1540 KB Partially correct - number of queries: 8083
19 Correct 8 ms 336 KB Output is correct
20 Correct 44 ms 1032 KB Output is correct
21 Correct 54 ms 880 KB Output is correct
22 Correct 16 ms 972 KB Output is correct
23 Correct 9 ms 592 KB Output is correct
24 Correct 9 ms 504 KB Output is correct
25 Correct 63 ms 1100 KB Output is correct
26 Correct 71 ms 972 KB Output is correct
27 Correct 10 ms 504 KB Output is correct
28 Partially correct 121 ms 1228 KB Partially correct - number of queries: 6932
29 Partially correct 101 ms 960 KB Partially correct - number of queries: 5448
30 Partially correct 110 ms 1512 KB Partially correct - number of queries: 7889
31 Correct 8 ms 604 KB Output is correct
32 Correct 19 ms 1040 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 49 ms 1064 KB Output is correct
35 Correct 11 ms 592 KB Output is correct
36 Correct 37 ms 768 KB Output is correct
37 Correct 13 ms 592 KB Output is correct
38 Correct 9 ms 336 KB Output is correct
39 Correct 65 ms 960 KB Output is correct
40 Partially correct 117 ms 1192 KB Partially correct - number of queries: 6993
41 Correct 71 ms 1200 KB Output is correct
42 Correct 78 ms 1020 KB Output is correct
43 Correct 74 ms 1104 KB Output is correct
44 Correct 53 ms 1132 KB Output is correct
45 Correct 54 ms 748 KB Output is correct
46 Correct 8 ms 480 KB Output is correct
47 Correct 65 ms 1016 KB Output is correct
48 Partially correct 108 ms 1328 KB Partially correct - number of queries: 5886
49 Correct 19 ms 508 KB Output is correct
50 Partially correct 157 ms 1640 KB Partially correct - number of queries: 8051
51 Correct 61 ms 1612 KB Output is correct
52 Correct 11 ms 592 KB Output is correct
53 Correct 13 ms 532 KB Output is correct
54 Correct 65 ms 808 KB Output is correct
55 Correct 8 ms 336 KB Output is correct
56 Partially correct 143 ms 1708 KB Partially correct - number of queries: 7977
57 Partially correct 97 ms 992 KB Partially correct - number of queries: 5765
58 Partially correct 95 ms 1032 KB Partially correct - number of queries: 5794
59 Correct 84 ms 788 KB Output is correct
60 Correct 63 ms 1244 KB Output is correct
61 Correct 13 ms 336 KB Output is correct
62 Correct 9 ms 336 KB Output is correct
63 Correct 13 ms 592 KB Output is correct
64 Correct 12 ms 604 KB Output is correct
65 Correct 8 ms 592 KB Output is correct
66 Correct 9 ms 504 KB Output is correct
67 Correct 9 ms 336 KB Output is correct
68 Correct 8 ms 336 KB Output is correct
69 Correct 9 ms 592 KB Output is correct
70 Correct 9 ms 504 KB Output is correct
71 Partially correct 172 ms 1584 KB Partially correct - number of queries: 8643
72 Correct 21 ms 696 KB Output is correct
73 Partially correct 159 ms 1508 KB Partially correct - number of queries: 8538
74 Partially correct 161 ms 1476 KB Partially correct - number of queries: 8583
75 Correct 14 ms 592 KB Output is correct
76 Partially correct 142 ms 1324 KB Partially correct - number of queries: 7563
77 Partially correct 156 ms 1812 KB Partially correct - number of queries: 8010
78 Correct 24 ms 796 KB Output is correct
79 Correct 76 ms 1324 KB Output is correct
80 Partially correct 140 ms 1684 KB Partially correct - number of queries: 8036
81 Partially correct 163 ms 2000 KB Partially correct - number of queries: 7980
82 Partially correct 137 ms 1448 KB Partially correct - number of queries: 7945
83 Correct 12 ms 764 KB Output is correct
84 Partially correct 119 ms 1392 KB Partially correct - number of queries: 6777
85 Partially correct 162 ms 1160 KB Partially correct - number of queries: 8052
86 Correct 11 ms 608 KB Output is correct
87 Correct 12 ms 516 KB Output is correct
88 Correct 12 ms 336 KB Output is correct
89 Correct 11 ms 504 KB Output is correct
90 Correct 11 ms 476 KB Output is correct
91 Correct 12 ms 336 KB Output is correct
92 Correct 12 ms 688 KB Output is correct
93 Correct 18 ms 744 KB Output is correct
94 Correct 19 ms 760 KB Output is correct
95 Correct 19 ms 336 KB Output is correct
96 Correct 18 ms 692 KB Output is correct
97 Correct 11 ms 508 KB Output is correct