oj.uz

답안 #1113549

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

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 348 KB Output is correct
2 Correct 10 ms 592 KB Output is correct
3 Correct 10 ms 456 KB Output is correct
4 Correct 9 ms 504 KB Output is correct
5 Correct 8 ms 480 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 10 ms 468 KB Output is correct
8 Correct 10 ms 336 KB Output is correct
9 Correct 10 ms 336 KB Output is correct
10 Correct 10 ms 336 KB Output is correct

Subtask #2
70.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 336 KB Output is correct
2 Correct 11 ms 712 KB Output is correct
3 Correct 13 ms 336 KB Output is correct
4 Correct 9 ms 592 KB Output is correct
5 Correct 11 ms 720 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 11 ms 484 KB Output is correct
8 Correct 10 ms 592 KB Output is correct
9 Correct 10 ms 592 KB Output is correct
10 Correct 7 ms 336 KB Output is correct
11 Correct 15 ms 336 KB Output is correct
12 Correct 9 ms 432 KB Output is correct
13 Correct 18 ms 776 KB Output is correct
14 Correct 13 ms 700 KB Output is correct
15 Correct 29 ms 700 KB Output is correct
16 Partially correct 118 ms 1516 KB Partially correct - number of queries: 6718
17 Correct 7 ms 352 KB Output is correct
18 Partially correct 146 ms 1368 KB Partially correct - number of queries: 8005
19 Correct 8 ms 336 KB Output is correct
20 Correct 38 ms 820 KB Output is correct
21 Correct 57 ms 996 KB Output is correct
22 Correct 16 ms 608 KB Output is correct
23 Correct 9 ms 712 KB Output is correct
24 Correct 9 ms 336 KB Output is correct
25 Correct 67 ms 816 KB Output is correct
26 Correct 66 ms 1368 KB Output is correct
27 Correct 9 ms 336 KB Output is correct
28 Partially correct 137 ms 1404 KB Partially correct - number of queries: 6853
29 Partially correct 97 ms 1344 KB Partially correct - number of queries: 5517
30 Partially correct 151 ms 1368 KB Partially correct - number of queries: 7937
31 Correct 8 ms 336 KB Output is correct
32 Correct 15 ms 336 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 40 ms 720 KB Output is correct
35 Correct 13 ms 592 KB Output is correct
36 Correct 38 ms 728 KB Output is correct
37 Correct 12 ms 496 KB Output is correct
38 Correct 10 ms 336 KB Output is correct
39 Correct 67 ms 1360 KB Output is correct
40 Partially correct 125 ms 1228 KB Partially correct - number of queries: 7038
41 Correct 92 ms 840 KB Output is correct
42 Correct 85 ms 1372 KB Output is correct
43 Correct 68 ms 988 KB Output is correct
44 Correct 59 ms 856 KB Output is correct
45 Correct 43 ms 932 KB Output is correct
46 Correct 9 ms 336 KB Output is correct
47 Correct 67 ms 900 KB Output is correct
48 Partially correct 106 ms 1216 KB Partially correct - number of queries: 5887
49 Correct 16 ms 500 KB Output is correct
50 Partially correct 156 ms 1720 KB Partially correct - number of queries: 8033
51 Correct 59 ms 1020 KB Output is correct
52 Correct 9 ms 592 KB Output is correct
53 Correct 15 ms 752 KB Output is correct
54 Correct 70 ms 916 KB Output is correct
55 Correct 8 ms 592 KB Output is correct
56 Partially correct 148 ms 1436 KB Partially correct - number of queries: 8009
57 Partially correct 103 ms 1192 KB Partially correct - number of queries: 5736
58 Partially correct 95 ms 1252 KB Partially correct - number of queries: 5821
59 Correct 74 ms 1028 KB Output is correct
60 Correct 81 ms 1356 KB Output is correct
61 Correct 13 ms 448 KB Output is correct
62 Correct 10 ms 492 KB Output is correct
63 Correct 13 ms 724 KB Output is correct
64 Correct 12 ms 712 KB Output is correct
65 Correct 9 ms 484 KB Output is correct
66 Correct 8 ms 336 KB Output is correct
67 Correct 9 ms 336 KB Output is correct
68 Correct 9 ms 472 KB Output is correct
69 Correct 9 ms 504 KB Output is correct
70 Correct 10 ms 848 KB Output is correct
71 Partially correct 158 ms 1444 KB Partially correct - number of queries: 8859
72 Correct 19 ms 592 KB Output is correct
73 Partially correct 147 ms 2004 KB Partially correct - number of queries: 8754
74 Partially correct 145 ms 1420 KB Partially correct - number of queries: 8799
75 Correct 14 ms 480 KB Output is correct
76 Partially correct 134 ms 1300 KB Partially correct - number of queries: 7779
77 Partially correct 144 ms 1472 KB Partially correct - number of queries: 8018
78 Correct 21 ms 612 KB Output is correct
79 Correct 87 ms 1592 KB Output is correct
80 Partially correct 153 ms 1456 KB Partially correct - number of queries: 8059
81 Partially correct 153 ms 1820 KB Partially correct - number of queries: 8076
82 Partially correct 148 ms 2068 KB Partially correct - number of queries: 7888
83 Correct 11 ms 484 KB Output is correct
84 Partially correct 129 ms 1216 KB Partially correct - number of queries: 6838
85 Partially correct 150 ms 1288 KB Partially correct - number of queries: 7990
86 Correct 9 ms 592 KB Output is correct
87 Correct 10 ms 592 KB Output is correct
88 Correct 8 ms 508 KB Output is correct
89 Correct 8 ms 336 KB Output is correct
90 Correct 10 ms 600 KB Output is correct
91 Correct 11 ms 336 KB Output is correct
92 Correct 8 ms 336 KB Output is correct
93 Correct 15 ms 728 KB Output is correct
94 Correct 18 ms 508 KB Output is correct
95 Correct 13 ms 336 KB Output is correct
96 Correct 17 ms 592 KB Output is correct
97 Correct 8 ms 592 KB Output is correct