oj.uz

답안 #1113543

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1113543 2024-11-16T17:46:01 Z epicci23 커다란 상품 (IOI17_prize) C++17
90 / 100
 163 ms 1836 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 = 1000;

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

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 592 KB Output is correct
2 Correct 12 ms 592 KB Output is correct
3 Correct 12 ms 592 KB Output is correct
4 Correct 7 ms 604 KB Output is correct
5 Correct 13 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 12 ms 336 KB Output is correct
8 Correct 12 ms 336 KB Output is correct
9 Correct 11 ms 592 KB Output is correct
10 Correct 17 ms 592 KB Output is correct

Subtask #2
70.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 452 KB Output is correct
2 Correct 13 ms 592 KB Output is correct
3 Correct 12 ms 336 KB Output is correct
4 Correct 8 ms 336 KB Output is correct
5 Correct 12 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 13 ms 336 KB Output is correct
8 Correct 12 ms 472 KB Output is correct
9 Correct 10 ms 336 KB Output is correct
10 Correct 11 ms 336 KB Output is correct
11 Correct 12 ms 336 KB Output is correct
12 Correct 10 ms 428 KB Output is correct
13 Correct 19 ms 592 KB Output is correct
14 Correct 13 ms 592 KB Output is correct
15 Correct 25 ms 964 KB Output is correct
16 Partially correct 117 ms 1536 KB Partially correct - number of queries: 6657
17 Correct 8 ms 336 KB Output is correct
18 Partially correct 147 ms 1628 KB Partially correct - number of queries: 7795
19 Correct 8 ms 476 KB Output is correct
20 Correct 45 ms 792 KB Output is correct
21 Correct 59 ms 1376 KB Output is correct
22 Correct 22 ms 468 KB Output is correct
23 Correct 11 ms 592 KB Output is correct
24 Correct 10 ms 592 KB Output is correct
25 Correct 78 ms 888 KB Output is correct
26 Correct 69 ms 1056 KB Output is correct
27 Correct 11 ms 336 KB Output is correct
28 Partially correct 138 ms 1252 KB Partially correct - number of queries: 6810
29 Partially correct 90 ms 1836 KB Partially correct - number of queries: 5382
30 Partially correct 163 ms 1196 KB Partially correct - number of queries: 7872
31 Correct 6 ms 336 KB Output is correct
32 Correct 22 ms 452 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 51 ms 952 KB Output is correct
35 Correct 17 ms 592 KB Output is correct
36 Correct 35 ms 616 KB Output is correct
37 Correct 12 ms 336 KB Output is correct
38 Correct 11 ms 592 KB Output is correct
39 Correct 69 ms 828 KB Output is correct
40 Partially correct 126 ms 1264 KB Partially correct - number of queries: 7057
41 Correct 83 ms 1460 KB Output is correct
42 Correct 76 ms 1156 KB Output is correct
43 Correct 78 ms 936 KB Output is correct
44 Correct 65 ms 996 KB Output is correct
45 Correct 39 ms 704 KB Output is correct
46 Correct 7 ms 336 KB Output is correct
47 Correct 74 ms 712 KB Output is correct
48 Partially correct 125 ms 1700 KB Partially correct - number of queries: 5897
49 Correct 21 ms 592 KB Output is correct
50 Partially correct 155 ms 1400 KB Partially correct - number of queries: 8002
51 Correct 64 ms 1268 KB Output is correct
52 Correct 10 ms 592 KB Output is correct
53 Correct 19 ms 448 KB Output is correct
54 Correct 69 ms 684 KB Output is correct
55 Correct 7 ms 336 KB Output is correct
56 Partially correct 132 ms 1284 KB Partially correct - number of queries: 7962
57 Partially correct 96 ms 1212 KB Partially correct - number of queries: 5757
58 Partially correct 102 ms 1288 KB Partially correct - number of queries: 5769
59 Correct 84 ms 1176 KB Output is correct
60 Correct 78 ms 1000 KB Output is correct
61 Correct 16 ms 728 KB Output is correct
62 Correct 10 ms 624 KB Output is correct
63 Correct 17 ms 868 KB Output is correct
64 Correct 15 ms 592 KB Output is correct
65 Correct 9 ms 336 KB Output is correct
66 Correct 10 ms 452 KB Output is correct
67 Correct 17 ms 764 KB Output is correct
68 Correct 11 ms 700 KB Output is correct
69 Correct 10 ms 632 KB Output is correct
70 Correct 16 ms 512 KB Output is correct
71 Partially correct 150 ms 1700 KB Partially correct - number of queries: 8701
72 Correct 20 ms 824 KB Output is correct
73 Partially correct 151 ms 1624 KB Partially correct - number of queries: 8603
74 Partially correct 152 ms 1552 KB Partially correct - number of queries: 8645
75 Correct 15 ms 728 KB Output is correct
76 Partially correct 140 ms 1668 KB Partially correct - number of queries: 7693
77 Partially correct 149 ms 1784 KB Partially correct - number of queries: 7969
78 Correct 18 ms 728 KB Output is correct
79 Correct 75 ms 1404 KB Output is correct
80 Partially correct 143 ms 1572 KB Partially correct - number of queries: 8033
81 Partially correct 118 ms 1496 KB Partially correct - number of queries: 7914
82 Partially correct 128 ms 1444 KB Partially correct - number of queries: 7931
83 Correct 16 ms 856 KB Output is correct
84 Partially correct 119 ms 1420 KB Partially correct - number of queries: 6811
85 Partially correct 147 ms 1380 KB Partially correct - number of queries: 8014
86 Correct 18 ms 484 KB Output is correct
87 Correct 14 ms 612 KB Output is correct
88 Correct 15 ms 892 KB Output is correct
89 Correct 14 ms 472 KB Output is correct
90 Correct 17 ms 480 KB Output is correct
91 Correct 18 ms 748 KB Output is correct
92 Correct 18 ms 680 KB Output is correct
93 Correct 23 ms 768 KB Output is correct
94 Correct 26 ms 964 KB Output is correct
95 Correct 26 ms 760 KB Output is correct
96 Correct 23 ms 568 KB Output is correct
97 Correct 16 ms 748 KB Output is correct