Submission #89184

# Submission time Handle Problem Language Result Execution time Memory
89184 2018-12-10T21:54:48 Z igzi The Big Prize (IOI17_prize) C++17
90 / 100
71 ms 5576 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){
if(n<=D){
    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<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) x=a[i*(n/D)][0]+a[i*(n/D)][1];
}
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:51:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 for(i=0;i<v.size();i++){
         ~^~~~~~~~~
prize.cpp:55:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
# Verdict Execution time Memory Grader output
1 Correct 11 ms 5112 KB Output is correct
2 Correct 10 ms 5112 KB Output is correct
3 Correct 10 ms 5184 KB Output is correct
4 Correct 8 ms 5228 KB Output is correct
5 Correct 8 ms 5228 KB Output is correct
6 Correct 39 ms 5228 KB Output is correct
7 Correct 8 ms 5280 KB Output is correct
8 Correct 9 ms 5280 KB Output is correct
9 Correct 11 ms 5280 KB Output is correct
10 Correct 12 ms 5280 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 11 ms 5280 KB Output is correct
2 Correct 11 ms 5280 KB Output is correct
3 Correct 13 ms 5280 KB Output is correct
4 Correct 12 ms 5280 KB Output is correct
5 Correct 11 ms 5280 KB Output is correct
6 Correct 11 ms 5280 KB Output is correct
7 Correct 8 ms 5280 KB Output is correct
8 Correct 11 ms 5280 KB Output is correct
9 Correct 11 ms 5280 KB Output is correct
10 Correct 11 ms 5280 KB Output is correct
11 Correct 10 ms 5280 KB Output is correct
12 Correct 10 ms 5280 KB Output is correct
13 Correct 13 ms 5280 KB Output is correct
14 Correct 17 ms 5284 KB Output is correct
15 Correct 23 ms 5400 KB Output is correct
16 Correct 24 ms 5464 KB Output is correct
17 Correct 48 ms 5464 KB Output is correct
18 Correct 50 ms 5464 KB Output is correct
19 Correct 32 ms 5464 KB Output is correct
20 Correct 42 ms 5464 KB Output is correct
21 Correct 38 ms 5480 KB Output is correct
22 Correct 21 ms 5480 KB Output is correct
23 Correct 8 ms 5480 KB Output is correct
24 Correct 16 ms 5480 KB Output is correct
25 Correct 56 ms 5480 KB Output is correct
26 Correct 24 ms 5480 KB Output is correct
27 Correct 12 ms 5480 KB Output is correct
28 Correct 47 ms 5480 KB Output is correct
29 Correct 42 ms 5480 KB Output is correct
30 Correct 30 ms 5480 KB Output is correct
31 Correct 48 ms 5480 KB Output is correct
32 Correct 18 ms 5480 KB Output is correct
33 Correct 5 ms 5480 KB Output is correct
34 Correct 48 ms 5480 KB Output is correct
35 Correct 8 ms 5480 KB Output is correct
36 Correct 45 ms 5480 KB Output is correct
37 Correct 10 ms 5480 KB Output is correct
38 Correct 13 ms 5480 KB Output is correct
39 Correct 34 ms 5480 KB Output is correct
40 Correct 41 ms 5480 KB Output is correct
41 Correct 58 ms 5480 KB Output is correct
42 Correct 51 ms 5480 KB Output is correct
43 Correct 26 ms 5480 KB Output is correct
44 Correct 26 ms 5480 KB Output is correct
45 Correct 28 ms 5480 KB Output is correct
46 Correct 51 ms 5480 KB Output is correct
47 Correct 37 ms 5480 KB Output is correct
48 Correct 47 ms 5480 KB Output is correct
49 Correct 24 ms 5480 KB Output is correct
50 Correct 34 ms 5480 KB Output is correct
51 Correct 48 ms 5480 KB Output is correct
52 Correct 25 ms 5480 KB Output is correct
53 Correct 13 ms 5480 KB Output is correct
54 Correct 47 ms 5480 KB Output is correct
55 Correct 51 ms 5480 KB Output is correct
56 Correct 59 ms 5480 KB Output is correct
57 Correct 40 ms 5480 KB Output is correct
58 Correct 59 ms 5480 KB Output is correct
59 Correct 56 ms 5480 KB Output is correct
60 Correct 53 ms 5480 KB Output is correct
61 Correct 9 ms 5480 KB Output is correct
62 Correct 12 ms 5480 KB Output is correct
63 Correct 13 ms 5480 KB Output is correct
64 Correct 13 ms 5480 KB Output is correct
65 Correct 12 ms 5480 KB Output is correct
66 Correct 16 ms 5480 KB Output is correct
67 Correct 17 ms 5480 KB Output is correct
68 Correct 12 ms 5480 KB Output is correct
69 Correct 19 ms 5480 KB Output is correct
70 Correct 15 ms 5480 KB Output is correct
71 Correct 50 ms 5480 KB Output is correct
72 Correct 15 ms 5480 KB Output is correct
73 Correct 49 ms 5480 KB Output is correct
74 Correct 50 ms 5480 KB Output is correct
75 Correct 13 ms 5480 KB Output is correct
76 Correct 44 ms 5480 KB Output is correct
77 Correct 31 ms 5480 KB Output is correct
78 Correct 15 ms 5480 KB Output is correct
79 Correct 35 ms 5480 KB Output is correct
80 Correct 52 ms 5480 KB Output is correct
81 Correct 50 ms 5480 KB Output is correct
82 Correct 28 ms 5480 KB Output is correct
83 Correct 12 ms 5480 KB Output is correct
84 Correct 52 ms 5480 KB Output is correct
85 Correct 25 ms 5480 KB Output is correct
86 Partially correct 34 ms 5480 KB Partially correct - number of queries: 6562
87 Correct 15 ms 5480 KB Output is correct
88 Partially correct 71 ms 5480 KB Partially correct - number of queries: 6196
89 Partially correct 66 ms 5528 KB Partially correct - number of queries: 6543
90 Correct 11 ms 5528 KB Output is correct
91 Correct 34 ms 5528 KB Output is correct
92 Partially correct 64 ms 5528 KB Partially correct - number of queries: 6217
93 Partially correct 65 ms 5528 KB Partially correct - number of queries: 6723
94 Partially correct 43 ms 5528 KB Partially correct - number of queries: 6727
95 Partially correct 69 ms 5528 KB Partially correct - number of queries: 6706
96 Partially correct 70 ms 5528 KB Partially correct - number of queries: 6652
97 Partially correct 42 ms 5576 KB Partially correct - number of queries: 6337