제출 #940049

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

prize

#include <bits/stdc++.h>
#define f first
#define s second
#define ent '\n'

std::vector<int> ask(int i);
typedef long long ll;
using namespace std;

struct seg{
    int m1,m2,sum,cnt;
};

const string out[2]={"NO\n","YES\n"};
const ll dx[]={0,1,0,-1,-1,1,1,-1};
const ll dy[]={1,0,-1,0,-1,1,-1,1};
const int mod=998244353;
const int md=1e9+7;
//const int mx=2e5+12;

const bool T=0;

int cnt=0;
int answer=-1;
int mx;

vector<int> Ask(int i){
    cnt++;
    if(cnt==10000){
        assert(0);
    }
    return ask(i);
}

void find(int l,int r){
    if(l>r)return;
    if(l==r){
        auto v=Ask(l);
        if(v[0]+v[1]==0){
            answer=l;
            return;
        }
    }
    int mid=l+r>>1;
    auto v=Ask(mid);
    if(v[0]+v[1]<mx){
        if(v[0]+v[1]==0){
            answer=mid;
            return;
        }
        mx=v[0]+v[1];
        if(v[0]>0)find(l,mid-1);
        if(answer!=-1)return;
        if(v[1]>0)find(mid+1,r);
        if(answer!=-1)return;
    }
    else{
        if(v[0]>0){
            find(l, mid-1);
            if(answer!=-1)return;
        }
        if(v[1]>0){
            find(mid+1, r);
            if(answer!=-1)return;
        }
    }
}

int find_best(int n){
    int pos=0;
    auto ma=ask(0);
    if(ma[0]+ma[1]==0){
        return 0;
    }
    for(int i=1;i<min(550,n);i++){
        auto v=Ask(i);
        if(v[0]+v[1]<ma[0]+ma[1]){
            ma=v;
            pos=i;
        }
        if(v[0]+v[1]==0){
            return i;
        }
    }
    mx=ma[0]+ma[1];
    find(550, n-1);
    return answer;
}

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

prize.cpp: In function 'void find(int, int)':
prize.cpp:44:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   44 |     int mid=l+r>>1;
      |             ~^~
prize.cpp: In function 'int find_best(int)':
prize.cpp:70:9: warning: variable 'pos' set but not used [-Wunused-but-set-variable]
   70 |     int pos=0;
      |         ^~~

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