oj.uz

Submission #89260

# Submission time Handle Problem Language Result Execution time Memory
89260 2018-12-11T07:44:03 Z igzi The Big Prize (IOI17_prize) C++17
90 / 100
 84 ms 5676 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=1;i<=min(500,n);i++){
    if(a[n-i].empty()) a[n-i]=ask(n-i);
    if(a[n-i][0]+a[n-i][1]>x) x=a[n-i][0]+a[n-i][1];
    if(a[n-i][0]+a[n-i][1]==0) return n-i;
}
if(n>D){
for(i=1;i<=min(500,n);i++){
    if(a[n-i][0]+a[n-i][1]==x) {u.push_back(a[n-i][0]); q.push_back(n-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 10 ms 5128 KB Output is correct
2 Correct 16 ms 5128 KB Output is correct
3 Correct 15 ms 5144 KB Output is correct
4 Correct 6 ms 5144 KB Output is correct
5 Correct 16 ms 5188 KB Output is correct
6 Correct 15 ms 5208 KB Output is correct
7 Correct 16 ms 5264 KB Output is correct
8 Correct 15 ms 5264 KB Output is correct
9 Correct 15 ms 5264 KB Output is correct
10 Correct 20 ms 5264 KB Output is correct

Subtask #2
70.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 5264 KB Output is correct
2 Correct 17 ms 5264 KB Output is correct
3 Correct 11 ms 5292 KB Output is correct
4 Correct 7 ms 5292 KB Output is correct
5 Correct 29 ms 5292 KB Output is correct
6 Correct 15 ms 5408 KB Output is correct
7 Correct 15 ms 5408 KB Output is correct
8 Correct 15 ms 5408 KB Output is correct
9 Correct 15 ms 5408 KB Output is correct
10 Correct 17 ms 5408 KB Output is correct
11 Correct 11 ms 5408 KB Output is correct
12 Correct 11 ms 5408 KB Output is correct
13 Correct 19 ms 5408 KB Output is correct
14 Correct 31 ms 5408 KB Output is correct
15 Correct 49 ms 5408 KB Output is correct
16 Partially correct 39 ms 5532 KB Partially correct - number of queries: 8461
17 Partially correct 25 ms 5532 KB Partially correct - number of queries: 5094
18 Correct 7 ms 5532 KB Output is correct
19 Correct 51 ms 5532 KB Output is correct
20 Correct 35 ms 5532 KB Output is correct
21 Partially correct 53 ms 5608 KB Partially correct - number of queries: 8256
22 Correct 31 ms 5608 KB Output is correct
23 Correct 39 ms 5608 KB Output is correct
24 Correct 17 ms 5608 KB Output is correct
25 Partially correct 52 ms 5608 KB Partially correct - number of queries: 5024
26 Partially correct 57 ms 5644 KB Partially correct - number of queries: 8340
27 Correct 17 ms 5644 KB Output is correct
28 Partially correct 54 ms 5644 KB Partially correct - number of queries: 5072
29 Correct 23 ms 5644 KB Output is correct
30 Correct 12 ms 5644 KB Output is correct
31 Partially correct 37 ms 5644 KB Partially correct - number of queries: 5061
32 Correct 18 ms 5644 KB Output is correct
33 Correct 7 ms 5644 KB Output is correct
34 Partially correct 47 ms 5644 KB Partially correct - number of queries: 5150
35 Correct 10 ms 5644 KB Output is correct
36 Partially correct 45 ms 5644 KB Partially correct - number of queries: 5124
37 Correct 16 ms 5644 KB Output is correct
38 Correct 16 ms 5644 KB Output is correct
39 Partially correct 37 ms 5644 KB Partially correct - number of queries: 5132
40 Correct 42 ms 5644 KB Output is correct
41 Partially correct 56 ms 5644 KB Partially correct - number of queries: 5203
42 Partially correct 50 ms 5644 KB Partially correct - number of queries: 5203
43 Partially correct 51 ms 5644 KB Partially correct - number of queries: 5071
44 Partially correct 57 ms 5644 KB Partially correct - number of queries: 5159
45 Correct 25 ms 5644 KB Output is correct
46 Partially correct 53 ms 5644 KB Partially correct - number of queries: 5093
47 Partially correct 44 ms 5644 KB Partially correct - number of queries: 5030
48 Partially correct 53 ms 5644 KB Partially correct - number of queries: 5242
49 Partially correct 53 ms 5644 KB Partially correct - number of queries: 5124
50 Correct 10 ms 5644 KB Output is correct
51 Partially correct 42 ms 5660 KB Partially correct - number of queries: 8349
52 Partially correct 36 ms 5660 KB Partially correct - number of queries: 5100
53 Correct 17 ms 5660 KB Output is correct
54 Partially correct 53 ms 5660 KB Partially correct - number of queries: 5153
55 Partially correct 57 ms 5676 KB Partially correct - number of queries: 5103
56 Correct 10 ms 5676 KB Output is correct
57 Partially correct 53 ms 5676 KB Partially correct - number of queries: 5221
58 Partially correct 52 ms 5676 KB Partially correct - number of queries: 5230
59 Partially correct 35 ms 5676 KB Partially correct - number of queries: 5215
60 Partially correct 26 ms 5676 KB Partially correct - number of queries: 5191
61 Correct 19 ms 5676 KB Output is correct
62 Correct 16 ms 5676 KB Output is correct
63 Correct 16 ms 5676 KB Output is correct
64 Correct 17 ms 5676 KB Output is correct
65 Correct 6 ms 5676 KB Output is correct
66 Correct 6 ms 5676 KB Output is correct
67 Correct 10 ms 5676 KB Output is correct
68 Correct 51 ms 5676 KB Output is correct
69 Correct 6 ms 5676 KB Output is correct
70 Correct 10 ms 5676 KB Output is correct
71 Partially correct 59 ms 5676 KB Partially correct - number of queries: 5278
72 Correct 19 ms 5676 KB Output is correct
73 Partially correct 52 ms 5676 KB Partially correct - number of queries: 5222
74 Partially correct 52 ms 5676 KB Partially correct - number of queries: 5246
75 Correct 15 ms 5676 KB Output is correct
76 Correct 47 ms 5676 KB Output is correct
77 Partially correct 84 ms 5676 KB Partially correct - number of queries: 8676
78 Correct 11 ms 5676 KB Output is correct
79 Correct 35 ms 5676 KB Output is correct
80 Partially correct 27 ms 5676 KB Partially correct - number of queries: 5266
81 Partially correct 54 ms 5676 KB Partially correct - number of queries: 5264
82 Partially correct 52 ms 5676 KB Partially correct - number of queries: 5213
83 Correct 21 ms 5676 KB Output is correct
84 Correct 44 ms 5676 KB Output is correct
85 Partially correct 54 ms 5676 KB Partially correct - number of queries: 5278
86 Correct 15 ms 5676 KB Output is correct
87 Correct 16 ms 5676 KB Output is correct
88 Correct 18 ms 5676 KB Output is correct
89 Correct 15 ms 5676 KB Output is correct
90 Correct 15 ms 5676 KB Output is correct
91 Correct 10 ms 5676 KB Output is correct
92 Correct 11 ms 5676 KB Output is correct
93 Correct 19 ms 5676 KB Output is correct
94 Correct 19 ms 5676 KB Output is correct
95 Correct 23 ms 5676 KB Output is correct
96 Correct 20 ms 5676 KB Output is correct
97 Correct 19 ms 5676 KB Output is correct