제출 #89166

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

prize

#include <bits/stdc++.h>
#include "prize.h"
#define maxN 200002
 
using namespace std;
 
int i,x=0,b[2][maxN];
vector <int> v,a;

vector <int> ask1(int n){
if(b[0][n]!=-1) return ask(n);
vector<int> ans;
ans.push_back(b[0][n]);
ans.push_back(b[1][n]);
return ans;
}
 
int find_best(int n){
    for(i=0;i<n;i++){
        b[0][i]=b[1][i]=-1;
    }
    for(i=0;i*i<=n;i++){
    a=ask1(i);
    if(a[0]+a[1]>x) x=a[0]+a[1];
    if(a[0]+a[1]==0) return i;
}
int p=-1;
for(int i=0;i<x;i++){
  int l,d,m;
  l=p+1; d=n-x+i;
  while(l<d){
    m=(l+d)/2;
    a=ask1(m);
    if(a[0]+a[1]==x){
        if(a[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++){
   a=ask1(v[i]);
   if(a[0]+a[1]==0) return v[i];
}
}

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

prize.cpp: In function 'int find_best(int)':
prize.cpp:45:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 for(i=0;i<v.size();i++){
         ~^~~~~~~~~
prize.cpp:49:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

• Subtask 1: 0 / 20
• Subtask 2: 0 / 80