oj.uz

Submission #89187

# Submission time Handle Problem Language Result Execution time Memory
89187 2018-12-10T22:04:52 Z igzi The Big Prize (IOI17_prize) C++17
20 / 100
 14 ms 5380 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;
    }
  }
  if(a[l].empty()) a[l]=ask(l);
  if(a[l][0]+a[l][1]==0) return l;
  p=l;
}
}

Compilation message

prize.cpp: In function 'int find_best(int)':
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 11 ms 5108 KB Output is correct
2 Correct 8 ms 5108 KB Output is correct
3 Correct 8 ms 5284 KB Output is correct
4 Correct 8 ms 5284 KB Output is correct
5 Correct 10 ms 5284 KB Output is correct
6 Correct 9 ms 5284 KB Output is correct
7 Correct 8 ms 5284 KB Output is correct
8 Correct 8 ms 5284 KB Output is correct
9 Correct 8 ms 5284 KB Output is correct
10 Correct 11 ms 5284 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 5288 KB Output is correct
2 Correct 8 ms 5288 KB Output is correct
3 Correct 11 ms 5288 KB Output is correct
4 Correct 11 ms 5288 KB Output is correct
5 Correct 12 ms 5288 KB Output is correct
6 Correct 11 ms 5288 KB Output is correct
7 Correct 12 ms 5288 KB Output is correct
8 Correct 14 ms 5288 KB Output is correct
9 Correct 12 ms 5380 KB Output is correct
10 Correct 13 ms 5380 KB Output is correct
11 Incorrect 14 ms 5380 KB answer is not correct
12 Halted 0 ms 0 KB -