제출 #89265

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
89265		igzi	커다란 상품 (IOI17_prize)	C++17	20 / 100	21 ms	5356 KiB

prize

#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];
}
}

컴파일 시 표준 에러 (stderr) 메시지

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 / 20
• Subtask 2: 0 / 80