제출 #102985

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
102985		username	커다란 상품 (IOI17_prize)	C++14	20 / 100	9 ms	504 KiB

prize

#include<bits/stdc++.h>
#include "prize.h"
using namespace std;
typedef pair<int,int> pii;
typedef vector<int> VI;
#define REP(i,j,k) for(register int i=(j);i<(k);++i)
#define RREP(i,j,k) for(register int i=(j)-1;i>=(k);--i)
#define ALL(a) a.begin(),a.end()
#define MST(a,v) memset(a,(v),sizeof a)
#define pb push_back
#define mid (l+r>>1)
#define lch (idx*2+1)
#define rch (idx*2+2)
#define F first
#define S second
#define de(...) cerr<<__VA_ARGS__
#define ar(a,s,t) {REP(__i,s,t)de(a[__i]<<' ');de(endl);}

VI tt;

void dfs(int l,int r,int ll,int rr,int mx,int&res){
	if(res>=0)return;
	else if(l>=r)return;
	else{
		tt=ask(mid);
		if(tt[0]+tt[1]==0)res=mid;
		else if(tt[0]+tt[1]==mx){
			if(tt[0]>ll)
			dfs(l,mid,ll,tt[1],mx,res);
			if(tt[1]>rr)
			dfs(mid+1,r,tt[0],rr,mx,res);
		}else{
			dfs(l,mid,ll,rr,mx,res);
			dfs(mid+1,r,ll,rr,mx,res);
		}
	}
}

int find_best(int n){
	int res=-1,mx=0;
	REP(i,0,448){
		tt=ask(i);
		mx=max(mx,tt[0]+tt[1]);
	}
	dfs(0,n,0,0,mx,res);
	assert(res>=0);
	return res;
}

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

prize.cpp: In function 'void dfs(int, int, int, int, int, int&)':
prize.cpp:11:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
 #define mid (l+r>>1)
              ~^~
prize.cpp:25:10: note: in expansion of macro 'mid'
   tt=ask(mid);
          ^~~
prize.cpp:11:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
 #define mid (l+r>>1)
              ~^~
prize.cpp:26:25: note: in expansion of macro 'mid'
   if(tt[0]+tt[1]==0)res=mid;
                         ^~~
prize.cpp:11:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
 #define mid (l+r>>1)
              ~^~
prize.cpp:29:10: note: in expansion of macro 'mid'
    dfs(l,mid,ll,tt[1],mx,res);
          ^~~
prize.cpp:11:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
 #define mid (l+r>>1)
              ~^~
prize.cpp:31:8: note: in expansion of macro 'mid'
    dfs(mid+1,r,tt[0],rr,mx,res);
        ^~~
prize.cpp:11:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
 #define mid (l+r>>1)
              ~^~
prize.cpp:33:10: note: in expansion of macro 'mid'
    dfs(l,mid,ll,rr,mx,res);
          ^~~
prize.cpp:11:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
 #define mid (l+r>>1)
              ~^~
prize.cpp:34:8: note: in expansion of macro 'mid'
    dfs(mid+1,r,ll,rr,mx,res);
        ^~~

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