oj.uz

Submission #89182

# Submission time Handle Problem Language Result Execution time Memory
89182 2018-12-10T21:51:44 Z igzi The Big Prize (IOI17_prize) C++17
96.95 / 100
 63 ms 5516 KB 
#include <bits/stdc++.h>
#define D 500
#include "prize.h"
#define maxN 200002
 
using namespace std;
 
int i,x=0;
vector <int> v,a[maxN];
vector <int> u,q;
 
int find_best(int n){
    for(i=0;i<min(500,n);i++){
    if(a[i].empty()) a[i]=ask(i);
    if(a[i][0]+a[i][1]>x) x=a[i][0]+a[i][1];
    if(a[i][0]+a[i][1]==0) return i;
}
if(n>D){
for(i=0;i<min(500,n);i++){
    if(a[i][0]+a[i][1]==x) {u.push_back(a[i][0]); q.push_back(i);}
}
for(i=0;i<D;i++){
if(a[i*(n/D)].empty()) a[i*(n/D)]=ask(i*(n/D));
if(a[i*(n/D)][0]+a[i*(n/D)][1]==x) {u.push_back(a[i*(n/D)][0]); q.push_back(i*(n/D));}
}
}
u.push_back(n);
q.push_back(n);
int p=-1;
for(int i=0;i<x;i++){
  int l,d,m,tmp;
  tmp=lower_bound(u.begin(),u.end(),v.size()+1)-u.begin();
  l=p+1; d=q[tmp];
  while(l<d){
    m=(l+d)/2;
    if(a[m].empty()) a[m]=ask(m);
    if(a[m][0]+a[m][1]==x){
        if(a[m][0]-v.size()>0) d=m-1;
        else l=m+1;
    }
    else{
        d=m;
    }
  }
  v.push_back(l);
  p=l;
}
for(i=0;i<v.size();i++){
   if(a[v[i]].empty()) a[v[i]]=ask(v[i]);
   if(a[v[i]][0]+a[v[i]][1]==0) return v[i];
}
}

Compilation message

prize.cpp: In function 'int find_best(int)':
prize.cpp:48:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 for(i=0;i<v.size();i++){
         ~^~~~~~~~~
prize.cpp:52:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 5112 KB Output is correct
2 Correct 18 ms 5112 KB Output is correct
3 Correct 17 ms 5112 KB Output is correct
4 Correct 19 ms 5164 KB Output is correct
5 Correct 14 ms 5164 KB Output is correct
6 Correct 6 ms 5164 KB Output is correct
7 Correct 10 ms 5268 KB Output is correct
8 Correct 11 ms 5268 KB Output is correct
9 Correct 17 ms 5268 KB Output is correct
10 Correct 17 ms 5268 KB Output is correct

Subtask #2
76.95 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 5292 KB Output is correct
2 Correct 10 ms 5344 KB Output is correct
3 Correct 11 ms 5352 KB Output is correct
4 Correct 10 ms 5352 KB Output is correct
5 Correct 17 ms 5352 KB Output is correct
6 Correct 7 ms 5352 KB Output is correct
7 Correct 15 ms 5352 KB Output is correct
8 Correct 11 ms 5352 KB Output is correct
9 Correct 16 ms 5352 KB Output is correct
10 Correct 11 ms 5352 KB Output is correct
11 Correct 12 ms 5352 KB Output is correct
12 Correct 12 ms 5360 KB Output is correct
13 Correct 22 ms 5360 KB Output is correct
14 Correct 26 ms 5360 KB Output is correct
15 Correct 55 ms 5488 KB Output is correct
16 Partially correct 55 ms 5488 KB Partially correct - number of queries: 5259
17 Correct 10 ms 5488 KB Output is correct
18 Partially correct 55 ms 5488 KB Partially correct - number of queries: 5305
19 Correct 10 ms 5488 KB Output is correct
20 Correct 36 ms 5488 KB Output is correct
21 Partially correct 46 ms 5496 KB Partially correct - number of queries: 5116
22 Correct 22 ms 5496 KB Output is correct
23 Correct 15 ms 5496 KB Output is correct
24 Correct 18 ms 5496 KB Output is correct
25 Partially correct 57 ms 5496 KB Partially correct - number of queries: 5006
26 Partially correct 48 ms 5496 KB Partially correct - number of queries: 5036
27 Correct 17 ms 5496 KB Output is correct
28 Partially correct 52 ms 5496 KB Partially correct - number of queries: 5074
29 Correct 44 ms 5496 KB Output is correct
30 Partially correct 31 ms 5496 KB Partially correct - number of queries: 5252
31 Correct 8 ms 5496 KB Output is correct
32 Correct 19 ms 5496 KB Output is correct
33 Correct 6 ms 5496 KB Output is correct
34 Partially correct 62 ms 5496 KB Partially correct - number of queries: 5150
35 Correct 11 ms 5496 KB Output is correct
36 Partially correct 56 ms 5496 KB Partially correct - number of queries: 5117
37 Correct 18 ms 5496 KB Output is correct
38 Correct 16 ms 5496 KB Output is correct
39 Partially correct 52 ms 5496 KB Partially correct - number of queries: 5131
40 Correct 50 ms 5496 KB Output is correct
41 Partially correct 27 ms 5496 KB Partially correct - number of queries: 5202
42 Partially correct 27 ms 5496 KB Partially correct - number of queries: 5202
43 Partially correct 55 ms 5496 KB Partially correct - number of queries: 5069
44 Partially correct 57 ms 5496 KB Partially correct - number of queries: 5159
45 Correct 49 ms 5496 KB Output is correct
46 Correct 11 ms 5496 KB Output is correct
47 Partially correct 42 ms 5496 KB Partially correct - number of queries: 5031
48 Partially correct 28 ms 5496 KB Partially correct - number of queries: 5241
49 Partially correct 50 ms 5516 KB Partially correct - number of queries: 5118
50 Partially correct 31 ms 5516 KB Partially correct - number of queries: 5300
51 Partially correct 63 ms 5516 KB Partially correct - number of queries: 5170
52 Partially correct 26 ms 5516 KB Partially correct - number of queries: 5099
53 Correct 11 ms 5516 KB Output is correct
54 Partially correct 51 ms 5516 KB Partially correct - number of queries: 5152
55 Correct 9 ms 5516 KB Output is correct
56 Partially correct 48 ms 5516 KB Partially correct - number of queries: 5271
57 Partially correct 53 ms 5516 KB Partially correct - number of queries: 5214
58 Partially correct 27 ms 5516 KB Partially correct - number of queries: 5224
59 Partially correct 41 ms 5516 KB Partially correct - number of queries: 5212
60 Partially correct 36 ms 5516 KB Partially correct - number of queries: 5188
61 Correct 10 ms 5516 KB Output is correct
62 Correct 19 ms 5516 KB Output is correct
63 Correct 11 ms 5516 KB Output is correct
64 Correct 18 ms 5516 KB Output is correct
65 Correct 16 ms 5516 KB Output is correct
66 Correct 18 ms 5516 KB Output is correct
67 Correct 22 ms 5516 KB Output is correct
68 Correct 11 ms 5516 KB Output is correct
69 Correct 20 ms 5516 KB Output is correct
70 Correct 19 ms 5516 KB Output is correct
71 Partially correct 41 ms 5516 KB Partially correct - number of queries: 5278
72 Correct 21 ms 5516 KB Output is correct
73 Partially correct 52 ms 5516 KB Partially correct - number of queries: 5222
74 Partially correct 61 ms 5516 KB Partially correct - number of queries: 5246
75 Correct 18 ms 5516 KB Output is correct
76 Correct 50 ms 5516 KB Output is correct
77 Partially correct 29 ms 5516 KB Partially correct - number of queries: 5256
78 Correct 19 ms 5516 KB Output is correct
79 Correct 37 ms 5516 KB Output is correct
80 Partially correct 41 ms 5516 KB Partially correct - number of queries: 5264
81 Partially correct 41 ms 5516 KB Partially correct - number of queries: 5241
82 Partially correct 52 ms 5516 KB Partially correct - number of queries: 5242
83 Correct 19 ms 5516 KB Output is correct
84 Correct 32 ms 5516 KB Output is correct
85 Partially correct 57 ms 5516 KB Partially correct - number of queries: 5235
86 Correct 11 ms 5516 KB Output is correct
87 Correct 14 ms 5516 KB Output is correct
88 Correct 17 ms 5516 KB Output is correct
89 Correct 15 ms 5516 KB Output is correct
90 Correct 16 ms 5516 KB Output is correct
91 Correct 16 ms 5516 KB Output is correct
92 Correct 15 ms 5516 KB Output is correct
93 Correct 21 ms 5516 KB Output is correct
94 Correct 19 ms 5516 KB Output is correct
95 Correct 19 ms 5516 KB Output is correct
96 Correct 12 ms 5516 KB Output is correct
97 Correct 16 ms 5516 KB Output is correct