oj.uz

Submission #89265

# Submission time Handle Problem Language Result Execution time Memory
89265 2018-12-11T07:58:56 Z igzi The Big Prize (IOI17_prize) C++17
20 / 100
 21 ms 5356 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){
a[199578]=ask(199578);
if(a[199578][0]+a[199578][1]==0) return 199578;
    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);
  if(a[v[i]].empty()) a[v[i]]=ask(v[i]);
  if(a[v[i]][0]+a[v[i]][1]==0) return v[i];
  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:54:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 for(i=0;i<v.size();i++){
         ~^~~~~~~~~
prize.cpp:58: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 5148 KB Output is correct
2 Correct 11 ms 5148 KB Output is correct
3 Correct 10 ms 5300 KB Output is correct
4 Correct 16 ms 5300 KB Output is correct
5 Correct 16 ms 5300 KB Output is correct
6 Correct 7 ms 5300 KB Output is correct
7 Correct 11 ms 5300 KB Output is correct
8 Correct 16 ms 5300 KB Output is correct
9 Correct 17 ms 5300 KB Output is correct
10 Correct 17 ms 5300 KB Output is correct

Subtask #2
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 5308 KB Output is correct
2 Correct 14 ms 5308 KB Output is correct
3 Correct 11 ms 5308 KB Output is correct
4 Correct 17 ms 5308 KB Output is correct
5 Correct 11 ms 5308 KB Output is correct
6 Correct 7 ms 5308 KB Output is correct
7 Correct 12 ms 5308 KB Output is correct
8 Correct 11 ms 5344 KB Output is correct
9 Correct 21 ms 5344 KB Output is correct
10 Correct 19 ms 5344 KB Output is correct
11 Correct 11 ms 5356 KB Output is correct
12 Correct 13 ms 5356 KB Output is correct
13 Correct 20 ms 5356 KB Output is correct
14 Incorrect 6 ms 5356 KB Integer 199578 violates the range [0, 20999]
15 Halted 0 ms 0 KB -