oj.uz

Submission #1113546

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

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 11 ms 592 KB Output is correct
2 Correct 11 ms 684 KB Output is correct
3 Correct 11 ms 336 KB Output is correct
4 Correct 11 ms 592 KB Output is correct
5 Correct 11 ms 736 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 12 ms 468 KB Output is correct
8 Correct 10 ms 504 KB Output is correct
9 Correct 10 ms 464 KB Output is correct
10 Correct 9 ms 336 KB Output is correct

Subtask #2
70.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 464 KB Output is correct
2 Correct 10 ms 700 KB Output is correct
3 Correct 10 ms 336 KB Output is correct
4 Correct 12 ms 336 KB Output is correct
5 Correct 11 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 10 ms 592 KB Output is correct
8 Correct 11 ms 336 KB Output is correct
9 Correct 10 ms 592 KB Output is correct
10 Correct 12 ms 336 KB Output is correct
11 Correct 14 ms 484 KB Output is correct
12 Correct 9 ms 608 KB Output is correct
13 Correct 20 ms 568 KB Output is correct
14 Correct 12 ms 336 KB Output is correct
15 Correct 27 ms 596 KB Output is correct
16 Partially correct 103 ms 1708 KB Partially correct - number of queries: 6714
17 Correct 6 ms 468 KB Output is correct
18 Partially correct 132 ms 1464 KB Partially correct - number of queries: 7979
19 Correct 8 ms 336 KB Output is correct
20 Correct 42 ms 840 KB Output is correct
21 Correct 57 ms 1104 KB Output is correct
22 Correct 19 ms 700 KB Output is correct
23 Correct 10 ms 720 KB Output is correct
24 Correct 11 ms 600 KB Output is correct
25 Correct 70 ms 1068 KB Output is correct
26 Correct 76 ms 1120 KB Output is correct
27 Correct 12 ms 592 KB Output is correct
28 Partially correct 133 ms 1352 KB Partially correct - number of queries: 6912
29 Partially correct 116 ms 1292 KB Partially correct - number of queries: 5509
30 Partially correct 123 ms 1304 KB Partially correct - number of queries: 7890
31 Correct 8 ms 432 KB Output is correct
32 Correct 18 ms 584 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 55 ms 808 KB Output is correct
35 Correct 11 ms 448 KB Output is correct
36 Correct 37 ms 1104 KB Output is correct
37 Correct 13 ms 592 KB Output is correct
38 Correct 9 ms 592 KB Output is correct
39 Correct 58 ms 1004 KB Output is correct
40 Partially correct 148 ms 1628 KB Partially correct - number of queries: 7043
41 Correct 96 ms 1124 KB Output is correct
42 Correct 91 ms 1080 KB Output is correct
43 Correct 80 ms 1236 KB Output is correct
44 Correct 59 ms 784 KB Output is correct
45 Correct 45 ms 972 KB Output is correct
46 Correct 9 ms 336 KB Output is correct
47 Correct 58 ms 1492 KB Output is correct
48 Partially correct 108 ms 1140 KB Partially correct - number of queries: 5811
49 Correct 16 ms 592 KB Output is correct
50 Partially correct 148 ms 1764 KB Partially correct - number of queries: 7982
51 Correct 50 ms 824 KB Output is correct
52 Correct 9 ms 592 KB Output is correct
53 Correct 12 ms 592 KB Output is correct
54 Correct 63 ms 840 KB Output is correct
55 Correct 8 ms 336 KB Output is correct
56 Partially correct 150 ms 1460 KB Partially correct - number of queries: 8008
57 Partially correct 95 ms 1216 KB Partially correct - number of queries: 5703
58 Partially correct 113 ms 1096 KB Partially correct - number of queries: 5878
59 Correct 96 ms 1192 KB Output is correct
60 Correct 84 ms 1764 KB Output is correct
61 Correct 12 ms 336 KB Output is correct
62 Correct 9 ms 336 KB Output is correct
63 Correct 15 ms 600 KB Output is correct
64 Correct 12 ms 336 KB Output is correct
65 Correct 8 ms 448 KB Output is correct
66 Correct 9 ms 596 KB Output is correct
67 Correct 8 ms 336 KB Output is correct
68 Correct 7 ms 336 KB Output is correct
69 Correct 10 ms 728 KB Output is correct
70 Correct 12 ms 592 KB Output is correct
71 Partially correct 158 ms 1716 KB Partially correct - number of queries: 8859
72 Correct 18 ms 564 KB Output is correct
73 Partially correct 170 ms 1756 KB Partially correct - number of queries: 8754
74 Partially correct 154 ms 1564 KB Partially correct - number of queries: 8799
75 Correct 13 ms 720 KB Output is correct
76 Partially correct 143 ms 1876 KB Partially correct - number of queries: 7779
77 Partially correct 145 ms 1396 KB Partially correct - number of queries: 8076
78 Correct 17 ms 540 KB Output is correct
79 Correct 76 ms 1316 KB Output is correct
80 Partially correct 137 ms 1660 KB Partially correct - number of queries: 8087
81 Partially correct 149 ms 1932 KB Partially correct - number of queries: 8026
82 Partially correct 136 ms 1300 KB Partially correct - number of queries: 7894
83 Correct 13 ms 512 KB Output is correct
84 Partially correct 135 ms 1508 KB Partially correct - number of queries: 6924
85 Partially correct 144 ms 1448 KB Partially correct - number of queries: 7865
86 Correct 12 ms 476 KB Output is correct
87 Correct 9 ms 336 KB Output is correct
88 Correct 9 ms 336 KB Output is correct
89 Correct 9 ms 488 KB Output is correct
90 Correct 9 ms 336 KB Output is correct
91 Correct 11 ms 336 KB Output is correct
92 Correct 11 ms 592 KB Output is correct
93 Correct 24 ms 940 KB Output is correct
94 Correct 20 ms 336 KB Output is correct
95 Correct 17 ms 900 KB Output is correct
96 Correct 20 ms 520 KB Output is correct
97 Correct 14 ms 484 KB Output is correct