제출 #39891

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

prize

#include <bits/stdc++.h>
#include "prize.h"
#define maxN 200002

using namespace std;

int i,x=0;
vector <int> v,a;
/*vector <int> ask(int n){
cout<<n<<endl;
int x,y;
vector <int> a;
cin>>x>>y;
a.push_back(x);
a.push_back(y);
return a;
}*/

int find_best(int n){
    for(i=0;i<n && i<480;i++){
    a=ask(i);
    if(a[0]+a[1]>x) x=a[0]+a[1];
    if(a[0]+a[1]==0) return i;
}
int p=0;
for(int i=0;i<x;i++){
  int l,d,m;
  l=p; d=n-1;
  while(l!=d){
    m=(l+d)/2;
    a=ask(m);
    if(a[0]+a[1]==x){
        if(a[0]-v.size()>m) d=m-1;
        else l=m+1;
    }
    else{
        d=m;
    }
  }
  v.push_back(l);
  p=l;
}
for(i=0;i<v.size();i++){
   a=ask(v[i]);
   if(a[0]+a[1]==0) return v[i];
}
}

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

prize.cpp: In function 'int find_best(int)':
prize.cpp:33:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(a[0]-v.size()>m) d=m-1;
                         ^
prize.cpp:43:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 for(i=0;i<v.size();i++){
          ^
prize.cpp:47:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

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