답안 #1113499

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1113499 2024-11-16T16:43:50 Z epicci23 커다란 상품 (IOI17_prize) C++17
90 / 100
187 ms 1908 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;
 
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;
  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);
}
# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 336 KB Output is correct
2 Correct 10 ms 336 KB Output is correct
3 Correct 9 ms 336 KB Output is correct
4 Correct 10 ms 468 KB Output is correct
5 Correct 9 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 11 ms 976 KB Output is correct
8 Correct 11 ms 484 KB Output is correct
9 Correct 9 ms 336 KB Output is correct
10 Correct 6 ms 720 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 592 KB Output is correct
2 Correct 8 ms 592 KB Output is correct
3 Correct 9 ms 336 KB Output is correct
4 Correct 8 ms 336 KB Output is correct
5 Correct 10 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 10 ms 336 KB Output is correct
8 Correct 10 ms 336 KB Output is correct
9 Correct 9 ms 336 KB Output is correct
10 Correct 8 ms 336 KB Output is correct
11 Correct 13 ms 704 KB Output is correct
12 Correct 7 ms 592 KB Output is correct
13 Correct 21 ms 336 KB Output is correct
14 Correct 11 ms 584 KB Output is correct
15 Correct 22 ms 524 KB Output is correct
16 Partially correct 122 ms 1252 KB Partially correct - number of queries: 6687
17 Correct 8 ms 716 KB Output is correct
18 Partially correct 139 ms 1284 KB Partially correct - number of queries: 8063
19 Correct 7 ms 508 KB Output is correct
20 Correct 38 ms 592 KB Output is correct
21 Correct 61 ms 784 KB Output is correct
22 Correct 20 ms 336 KB Output is correct
23 Correct 10 ms 336 KB Output is correct
24 Correct 7 ms 336 KB Output is correct
25 Correct 83 ms 988 KB Output is correct
26 Correct 81 ms 704 KB Output is correct
27 Correct 9 ms 496 KB Output is correct
28 Partially correct 112 ms 1488 KB Partially correct - number of queries: 6818
29 Partially correct 103 ms 1488 KB Partially correct - number of queries: 5477
30 Partially correct 172 ms 1320 KB Partially correct - number of queries: 7894
31 Correct 7 ms 472 KB Output is correct
32 Correct 23 ms 604 KB Output is correct
33 Correct 1 ms 336 KB Output is correct
34 Correct 47 ms 876 KB Output is correct
35 Correct 11 ms 336 KB Output is correct
36 Correct 42 ms 1224 KB Output is correct
37 Correct 13 ms 336 KB Output is correct
38 Correct 8 ms 592 KB Output is correct
39 Correct 76 ms 828 KB Output is correct
40 Partially correct 140 ms 1608 KB Partially correct - number of queries: 6988
41 Correct 86 ms 1104 KB Output is correct
42 Correct 92 ms 960 KB Output is correct
43 Correct 67 ms 772 KB Output is correct
44 Correct 51 ms 908 KB Output is correct
45 Correct 41 ms 840 KB Output is correct
46 Correct 7 ms 588 KB Output is correct
47 Correct 54 ms 1048 KB Output is correct
48 Partially correct 98 ms 1296 KB Partially correct - number of queries: 5841
49 Correct 16 ms 728 KB Output is correct
50 Partially correct 149 ms 1196 KB Partially correct - number of queries: 7979
51 Correct 60 ms 876 KB Output is correct
52 Correct 10 ms 592 KB Output is correct
53 Correct 10 ms 336 KB Output is correct
54 Correct 56 ms 812 KB Output is correct
55 Correct 8 ms 336 KB Output is correct
56 Partially correct 151 ms 1504 KB Partially correct - number of queries: 7972
57 Partially correct 103 ms 1160 KB Partially correct - number of queries: 5685
58 Partially correct 109 ms 1040 KB Partially correct - number of queries: 5846
59 Correct 94 ms 1136 KB Output is correct
60 Correct 85 ms 952 KB Output is correct
61 Correct 10 ms 592 KB Output is correct
62 Correct 10 ms 592 KB Output is correct
63 Correct 13 ms 492 KB Output is correct
64 Correct 13 ms 592 KB Output is correct
65 Correct 10 ms 336 KB Output is correct
66 Correct 9 ms 848 KB Output is correct
67 Correct 11 ms 488 KB Output is correct
68 Correct 9 ms 336 KB Output is correct
69 Correct 17 ms 336 KB Output is correct
70 Correct 13 ms 336 KB Output is correct
71 Partially correct 187 ms 1540 KB Partially correct - number of queries: 9075
72 Correct 20 ms 784 KB Output is correct
73 Partially correct 146 ms 1488 KB Partially correct - number of queries: 8963
74 Partially correct 175 ms 1580 KB Partially correct - number of queries: 9011
75 Correct 13 ms 448 KB Output is correct
76 Partially correct 159 ms 1496 KB Partially correct - number of queries: 7923
77 Partially correct 164 ms 1908 KB Partially correct - number of queries: 8247
78 Correct 20 ms 592 KB Output is correct
79 Correct 76 ms 912 KB Output is correct
80 Partially correct 151 ms 1556 KB Partially correct - number of queries: 8277
81 Partially correct 154 ms 1664 KB Partially correct - number of queries: 8247
82 Partially correct 148 ms 1664 KB Partially correct - number of queries: 8062
83 Correct 12 ms 336 KB Output is correct
84 Partially correct 131 ms 1108 KB Partially correct - number of queries: 6951
85 Partially correct 144 ms 1556 KB Partially correct - number of queries: 8233
86 Correct 9 ms 336 KB Output is correct
87 Correct 8 ms 336 KB Output is correct
88 Correct 10 ms 336 KB Output is correct
89 Correct 7 ms 336 KB Output is correct
90 Correct 8 ms 336 KB Output is correct
91 Correct 10 ms 336 KB Output is correct
92 Correct 7 ms 336 KB Output is correct
93 Correct 20 ms 720 KB Output is correct
94 Correct 18 ms 336 KB Output is correct
95 Correct 26 ms 704 KB Output is correct
96 Correct 17 ms 336 KB Output is correct
97 Correct 10 ms 592 KB Output is correct