oj.uz

Submission #89263

# Submission time Handle Problem Language Result Execution time Memory
89263 2018-12-11T07:53:50 Z igzi The Big Prize (IOI17_prize) C++17
95.28 / 100
 74 ms 5524 KB 
#include <bits/stdc++.h>
#define D 600
#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);}
    else v.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;
if(v.size()) p=v.back();
for(int i=v.size();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:50:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 for(i=0;i<v.size();i++){
         ~^~~~~~~~~
prize.cpp:54: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 16 ms 5012 KB Output is correct
2 Correct 18 ms 5064 KB Output is correct
3 Correct 11 ms 5176 KB Output is correct
4 Correct 18 ms 5176 KB Output is correct
5 Correct 18 ms 5176 KB Output is correct
6 Correct 6 ms 5184 KB Output is correct
7 Correct 17 ms 5240 KB Output is correct
8 Correct 18 ms 5240 KB Output is correct
9 Correct 17 ms 5316 KB Output is correct
10 Correct 13 ms 5316 KB Output is correct

Subtask #2
75.28 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 5316 KB Output is correct
2 Correct 15 ms 5316 KB Output is correct
3 Correct 18 ms 5316 KB Output is correct
4 Correct 18 ms 5316 KB Output is correct
5 Correct 19 ms 5316 KB Output is correct
6 Correct 7 ms 5316 KB Output is correct
7 Correct 15 ms 5316 KB Output is correct
8 Correct 10 ms 5316 KB Output is correct
9 Correct 18 ms 5316 KB Output is correct
10 Correct 16 ms 5316 KB Output is correct
11 Correct 19 ms 5316 KB Output is correct
12 Correct 18 ms 5316 KB Output is correct
13 Correct 19 ms 5316 KB Output is correct
14 Correct 19 ms 5316 KB Output is correct
15 Partially correct 49 ms 5436 KB Partially correct - number of queries: 5011
16 Partially correct 58 ms 5436 KB Partially correct - number of queries: 5326
17 Correct 10 ms 5436 KB Output is correct
18 Partially correct 57 ms 5436 KB Partially correct - number of queries: 5355
19 Correct 8 ms 5436 KB Output is correct
20 Correct 39 ms 5436 KB Output is correct
21 Partially correct 60 ms 5436 KB Partially correct - number of queries: 5199
22 Correct 45 ms 5436 KB Output is correct
23 Correct 16 ms 5436 KB Output is correct
24 Correct 21 ms 5436 KB Output is correct
25 Partially correct 60 ms 5440 KB Partially correct - number of queries: 5075
26 Partially correct 51 ms 5440 KB Partially correct - number of queries: 5069
27 Correct 16 ms 5440 KB Output is correct
28 Partially correct 48 ms 5472 KB Partially correct - number of queries: 5120
29 Correct 37 ms 5472 KB Output is correct
30 Partially correct 51 ms 5472 KB Partially correct - number of queries: 5320
31 Correct 10 ms 5472 KB Output is correct
32 Correct 19 ms 5472 KB Output is correct
33 Correct 2 ms 5472 KB Output is correct
34 Partially correct 53 ms 5472 KB Partially correct - number of queries: 5232
35 Correct 19 ms 5472 KB Output is correct
36 Partially correct 51 ms 5472 KB Partially correct - number of queries: 5173
37 Correct 15 ms 5472 KB Output is correct
38 Correct 10 ms 5472 KB Output is correct
39 Partially correct 26 ms 5484 KB Partially correct - number of queries: 5217
40 Correct 31 ms 5484 KB Output is correct
41 Partially correct 27 ms 5496 KB Partially correct - number of queries: 5269
42 Partially correct 58 ms 5496 KB Partially correct - number of queries: 5269
43 Partially correct 50 ms 5496 KB Partially correct - number of queries: 5139
44 Partially correct 28 ms 5496 KB Partially correct - number of queries: 5235
45 Partially correct 56 ms 5496 KB Partially correct - number of queries: 5040
46 Correct 8 ms 5496 KB Output is correct
47 Partially correct 40 ms 5496 KB Partially correct - number of queries: 5059
48 Partially correct 57 ms 5496 KB Partially correct - number of queries: 5308
49 Partially correct 62 ms 5496 KB Partially correct - number of queries: 5166
50 Partially correct 74 ms 5496 KB Partially correct - number of queries: 5351
51 Partially correct 50 ms 5496 KB Partially correct - number of queries: 5241
52 Partially correct 53 ms 5496 KB Partially correct - number of queries: 5153
53 Correct 19 ms 5496 KB Output is correct
54 Partially correct 62 ms 5496 KB Partially correct - number of queries: 5206
55 Correct 12 ms 5496 KB Output is correct
56 Partially correct 36 ms 5524 KB Partially correct - number of queries: 5374
57 Partially correct 62 ms 5524 KB Partially correct - number of queries: 5275
58 Partially correct 50 ms 5524 KB Partially correct - number of queries: 5314
59 Partially correct 57 ms 5524 KB Partially correct - number of queries: 5275
60 Partially correct 61 ms 5524 KB Partially correct - number of queries: 5237
61 Correct 21 ms 5524 KB Output is correct
62 Correct 17 ms 5524 KB Output is correct
63 Correct 12 ms 5524 KB Output is correct
64 Correct 19 ms 5524 KB Output is correct
65 Correct 11 ms 5524 KB Output is correct
66 Correct 21 ms 5524 KB Output is correct
67 Correct 13 ms 5524 KB Output is correct
68 Correct 9 ms 5524 KB Output is correct
69 Correct 22 ms 5524 KB Output is correct
70 Correct 18 ms 5524 KB Output is correct
71 Partially correct 46 ms 5524 KB Partially correct - number of queries: 5472
72 Correct 21 ms 5524 KB Output is correct
73 Partially correct 57 ms 5524 KB Partially correct - number of queries: 5416
74 Partially correct 66 ms 5524 KB Partially correct - number of queries: 5440
75 Correct 20 ms 5524 KB Output is correct
76 Correct 51 ms 5524 KB Output is correct
77 Partially correct 59 ms 5524 KB Partially correct - number of queries: 5258
78 Correct 20 ms 5524 KB Output is correct
79 Correct 68 ms 5524 KB Output is correct
80 Partially correct 51 ms 5524 KB Partially correct - number of queries: 5230
81 Partially correct 43 ms 5524 KB Partially correct - number of queries: 5245
82 Partially correct 56 ms 5524 KB Partially correct - number of queries: 5200
83 Correct 19 ms 5524 KB Output is correct
84 Correct 44 ms 5524 KB Output is correct
85 Partially correct 51 ms 5524 KB Partially correct - number of queries: 5216
86 Correct 18 ms 5524 KB Output is correct
87 Correct 13 ms 5524 KB Output is correct
88 Correct 16 ms 5524 KB Output is correct
89 Correct 12 ms 5524 KB Output is correct
90 Correct 15 ms 5524 KB Output is correct
91 Correct 19 ms 5524 KB Output is correct
92 Correct 17 ms 5524 KB Output is correct
93 Correct 20 ms 5524 KB Output is correct
94 Correct 21 ms 5524 KB Output is correct
95 Correct 22 ms 5524 KB Output is correct
96 Correct 16 ms 5524 KB Output is correct
97 Correct 18 ms 5524 KB Output is correct