oj.uz

Submission #89180

# Submission time Handle Problem Language Result Execution time Memory
89180 2018-12-10T21:46:38 Z igzi The Big Prize (IOI17_prize) C++17
90 / 100
 73 ms 5568 KB 
#include <bits/stdc++.h>
#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<=1000){
    for(i=0;i<n && i<500;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>1000){
for(i=0;i<500;i++){
if(a[i*(n/1000)].empty()) a[i*(n/1000)]=ask(i*(n/1000));
if(a[i*(n/1000)][0]+a[i*(n/1000)][1]>x) x=a[i*(n/1000)][0]+a[i*(n/1000)][1];
}
for(i=0;i<1000;i++){
if(a[i*(n/1000)].empty()) a[i*(n/1000)]=ask(i*(n/1000));
if(a[i*(n/1000)][0]+a[i*(n/1000)][1]==x) {u.push_back(a[i*(n/1000)][0]); q.push_back(i*(n/1000));}
}
}
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: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 5112 KB Output is correct
2 Correct 11 ms 5112 KB Output is correct
3 Correct 18 ms 5112 KB Output is correct
4 Correct 16 ms 5184 KB Output is correct
5 Correct 17 ms 5184 KB Output is correct
6 Correct 16 ms 5232 KB Output is correct
7 Correct 10 ms 5308 KB Output is correct
8 Correct 10 ms 5308 KB Output is correct
9 Correct 15 ms 5308 KB Output is correct
10 Correct 12 ms 5408 KB Output is correct

Subtask #2
70.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 5408 KB Output is correct
2 Correct 15 ms 5408 KB Output is correct
3 Correct 19 ms 5408 KB Output is correct
4 Correct 17 ms 5408 KB Output is correct
5 Correct 16 ms 5408 KB Output is correct
6 Correct 19 ms 5408 KB Output is correct
7 Correct 11 ms 5408 KB Output is correct
8 Correct 18 ms 5408 KB Output is correct
9 Correct 11 ms 5408 KB Output is correct
10 Correct 15 ms 5408 KB Output is correct
11 Correct 21 ms 5408 KB Output is correct
12 Correct 20 ms 5408 KB Output is correct
13 Correct 22 ms 5408 KB Output is correct
14 Correct 22 ms 5408 KB Output is correct
15 Correct 49 ms 5408 KB Output is correct
16 Partially correct 53 ms 5424 KB Partially correct - number of queries: 5181
17 Correct 55 ms 5424 KB Output is correct
18 Partially correct 56 ms 5424 KB Partially correct - number of queries: 5225
19 Correct 52 ms 5424 KB Output is correct
20 Correct 38 ms 5436 KB Output is correct
21 Partially correct 37 ms 5436 KB Partially correct - number of queries: 5036
22 Correct 24 ms 5436 KB Output is correct
23 Correct 21 ms 5436 KB Output is correct
24 Correct 19 ms 5436 KB Output is correct
25 Correct 51 ms 5456 KB Output is correct
26 Correct 25 ms 5472 KB Output is correct
27 Correct 10 ms 5472 KB Output is correct
28 Correct 50 ms 5472 KB Output is correct
29 Correct 58 ms 5472 KB Output is correct
30 Partially correct 24 ms 5476 KB Partially correct - number of queries: 5183
31 Correct 48 ms 5476 KB Output is correct
32 Correct 20 ms 5476 KB Output is correct
33 Correct 6 ms 5476 KB Output is correct
34 Partially correct 57 ms 5476 KB Partially correct - number of queries: 5056
35 Correct 11 ms 5476 KB Output is correct
36 Partially correct 54 ms 5476 KB Partially correct - number of queries: 5022
37 Correct 20 ms 5476 KB Output is correct
38 Correct 15 ms 5476 KB Output is correct
39 Partially correct 60 ms 5476 KB Partially correct - number of queries: 5060
40 Correct 26 ms 5476 KB Output is correct
41 Partially correct 26 ms 5476 KB Partially correct - number of queries: 5124
42 Partially correct 26 ms 5476 KB Partially correct - number of queries: 5124
43 Partially correct 53 ms 5476 KB Partially correct - number of queries: 5004
44 Partially correct 53 ms 5476 KB Partially correct - number of queries: 5075
45 Correct 48 ms 5476 KB Output is correct
46 Correct 59 ms 5476 KB Output is correct
47 Correct 27 ms 5476 KB Output is correct
48 Partially correct 60 ms 5476 KB Partially correct - number of queries: 5156
49 Partially correct 53 ms 5476 KB Partially correct - number of queries: 5006
50 Partially correct 56 ms 5476 KB Partially correct - number of queries: 5226
51 Partially correct 29 ms 5476 KB Partially correct - number of queries: 5056
52 Correct 50 ms 5480 KB Output is correct
53 Correct 11 ms 5480 KB Output is correct
54 Partially correct 47 ms 5480 KB Partially correct - number of queries: 5059
55 Partially correct 51 ms 5480 KB Partially correct - number of queries: 5004
56 Partially correct 28 ms 5480 KB Partially correct - number of queries: 5221
57 Partially correct 52 ms 5480 KB Partially correct - number of queries: 5134
58 Partially correct 27 ms 5480 KB Partially correct - number of queries: 5133
59 Partially correct 58 ms 5504 KB Partially correct - number of queries: 5108
60 Partially correct 29 ms 5504 KB Partially correct - number of queries: 5076
61 Correct 17 ms 5504 KB Output is correct
62 Correct 11 ms 5504 KB Output is correct
63 Correct 16 ms 5504 KB Output is correct
64 Correct 19 ms 5504 KB Output is correct
65 Correct 10 ms 5504 KB Output is correct
66 Correct 19 ms 5504 KB Output is correct
67 Correct 13 ms 5504 KB Output is correct
68 Correct 24 ms 5504 KB Output is correct
69 Correct 23 ms 5504 KB Output is correct
70 Correct 11 ms 5504 KB Output is correct
71 Partially correct 54 ms 5504 KB Partially correct - number of queries: 5246
72 Correct 11 ms 5504 KB Output is correct
73 Partially correct 49 ms 5504 KB Partially correct - number of queries: 5181
74 Partially correct 56 ms 5504 KB Partially correct - number of queries: 5208
75 Correct 19 ms 5504 KB Output is correct
76 Correct 45 ms 5504 KB Output is correct
77 Partially correct 49 ms 5504 KB Partially correct - number of queries: 5121
78 Correct 18 ms 5504 KB Output is correct
79 Correct 34 ms 5504 KB Output is correct
80 Partially correct 54 ms 5504 KB Partially correct - number of queries: 5153
81 Partially correct 27 ms 5504 KB Partially correct - number of queries: 5157
82 Partially correct 64 ms 5504 KB Partially correct - number of queries: 5129
83 Correct 18 ms 5504 KB Output is correct
84 Correct 56 ms 5504 KB Output is correct
85 Partially correct 56 ms 5504 KB Partially correct - number of queries: 5166
86 Partially correct 61 ms 5504 KB Partially correct - number of queries: 6749
87 Correct 19 ms 5504 KB Output is correct
88 Partially correct 65 ms 5504 KB Partially correct - number of queries: 6385
89 Partially correct 68 ms 5504 KB Partially correct - number of queries: 6696
90 Correct 17 ms 5504 KB Output is correct
91 Correct 24 ms 5504 KB Output is correct
92 Partially correct 65 ms 5504 KB Partially correct - number of queries: 6413
93 Partially correct 70 ms 5504 KB Partially correct - number of queries: 6746
94 Partially correct 42 ms 5568 KB Partially correct - number of queries: 6736
95 Partially correct 73 ms 5568 KB Partially correct - number of queries: 6730
96 Partially correct 67 ms 5568 KB Partially correct - number of queries: 6671
97 Partially correct 63 ms 5568 KB Partially correct - number of queries: 6412