oj.uz

답안 #1113330

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1113330 2024-11-16T11:40:44 Z epicci23 커다란 상품 (IOI17_prize) C++17
20 / 100
 202 ms 2020 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 = 100;
const int S2 = 20;

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;
    }
  }
  L=500;
  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,p);
        if(xd!=-23) return xd;
      }
    }
    int xd = ask_all(p,L+S);
    if(xd!=-23) return xd;
    L+=S;
  }
  return ask_all(L+1,n-1);
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 504 KB Output is correct
2 Correct 27 ms 592 KB Output is correct
3 Correct 25 ms 584 KB Output is correct
4 Correct 51 ms 752 KB Output is correct
5 Correct 25 ms 588 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 22 ms 700 KB Output is correct
8 Correct 26 ms 584 KB Output is correct
9 Correct 22 ms 584 KB Output is correct
10 Correct 47 ms 592 KB Output is correct

Subtask #2
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 336 KB Output is correct
2 Correct 30 ms 1012 KB Output is correct
3 Correct 27 ms 584 KB Output is correct
4 Correct 44 ms 1392 KB Output is correct
5 Correct 21 ms 592 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 20 ms 456 KB Output is correct
8 Correct 24 ms 776 KB Output is correct
9 Correct 19 ms 584 KB Output is correct
10 Correct 45 ms 1308 KB Output is correct
11 Correct 25 ms 840 KB Output is correct
12 Correct 10 ms 592 KB Output is correct
13 Correct 68 ms 800 KB Output is correct
14 Correct 18 ms 584 KB Output is correct
15 Correct 50 ms 828 KB Output is correct
16 Incorrect 202 ms 2020 KB Incorrect
17 Halted 0 ms 0 KB -