oj.uz

Submission #1113327

# Submission time Handle Problem Language Result Execution time Memory
1113327 2024-11-16T11:35:31 Z epicci23 The Big Prize (IOI17_prize) C++17
20 / 100
 195 ms 1888 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 S = 200;
const int S2 = 50;

int L = -1;
vector<int> Cache;
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[0]+x[1]==Cache[0]+Cache[1]) Cache=x;
  }
  return -23;
}

int find_best(int n){
  if(n<=1000) return ask_all(0,n-1);
  
  for(int i=0;i<500;i++){
    vector<int> x = Ask(i);
    if(x[0]+x[1]==0) return i;
    if(L==-1){
      L=i;
      Cache=x;
    }
    else if(x[0]+x[1]>Cache[0]+Cache[1]){
      L=i;
      Cache=x;
    }
    else if(x[0]+x[1]==Cache[0]+Cache[1]){
      L=i;
      Cache=x;
    }
  }
  
  while(L+S<n){
    vector<int> x = Ask(L+S);
    if(x[0]+x[1]==0) return L+S;
    if(x[0]+x[1]==Cache[0]+Cache[1] && Cache[1]==x[1]){
      L+=S;
      Cache=x;
      continue;
    }
    int p = L;
    while(p+S2<L+S){
      p+=S2;
      vector<int> u = Ask(p);
      if(u[0]+u[1]==0) return p;
      if(u[0]+u[1]==Cache[0]+Cache[1] && Cache[1]==u[1]) Cache=u;
      else{
        int xd = ask_all(p-S2+1,p-1);
        if(xd!=-23) return xd;
      }
    }
    int xd = ask_all(p+1,L+S-1);
    if(xd!=-23) return xd;
    L+=S;
    if(x[0]+x[1]==Cache[0]+Cache[1]) Cache=x;
  }
  return ask_all(L+1,n-1);
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 592 KB Output is correct
2 Correct 21 ms 532 KB Output is correct
3 Correct 16 ms 608 KB Output is correct
4 Correct 30 ms 720 KB Output is correct
5 Correct 17 ms 532 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 17 ms 468 KB Output is correct
8 Correct 14 ms 600 KB Output is correct
9 Correct 19 ms 500 KB Output is correct
10 Correct 28 ms 724 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 592 KB Output is correct
2 Correct 16 ms 592 KB Output is correct
3 Correct 18 ms 592 KB Output is correct
4 Correct 28 ms 592 KB Output is correct
5 Correct 18 ms 744 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 15 ms 336 KB Output is correct
8 Correct 17 ms 756 KB Output is correct
9 Correct 16 ms 1404 KB Output is correct
10 Correct 24 ms 496 KB Output is correct
11 Correct 39 ms 560 KB Output is correct
12 Correct 10 ms 492 KB Output is correct
13 Correct 83 ms 1076 KB Output is correct
14 Correct 23 ms 708 KB Output is correct
15 Partially correct 129 ms 1308 KB Partially correct - number of queries: 6465
16 Incorrect 195 ms 1888 KB Incorrect
17 Halted 0 ms 0 KB -