제출 #64622

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
64622		nvmdava	The Big Prize (IOI17_prize)	C++17	0 / 100	10 ms	5048 KiB

prize

#include "prize.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> ans[200001];
map<int, set<int> > v;
int s = -1;

void solve(int l, int r){
	if(l > r || s != -1){
		return;
	}
	int m = (l + r) >> 1;
	if(ans[m].size() == 0)ans[m] = ask(m);
	if(ans[m][0] + ans[m][1] == 0){
		s = m;
		return;
	}
		
	v[ans[m][0] + ans[m][1]].insert(m);
	auto it = v.find(ans[m][0] + ans[m][1]);
	auto loc = it -> second.find(m);
	bool in = 0;
	auto tmp = loc;
	while(tmp != it -> second.begin()){
		if(ans[m][0] != ans[*tmp][0]){
			in = 1;
			tmp++;
			solve(l, *tmp);
			break;
		}
		tmp--;	
	}
	if(in == 0){
		tmp = it->second.begin();
		solve(l, *tmp - 1);
	} else {
		in = 0;
	}
	tmp = loc;
	while(tmp != it -> second.end()){
		if(ans[m][0] != ans[*tmp][0]){
			in = 1;
			tmp--;
			solve(*tmp, r);
			break;
		}
		tmp++;
	}
	if(in == 0){
		tmp = it->second.end();
		tmp--;
		solve(*tmp + 1, r);
	}
}

int find_best(int n) {
	solve(0, n - 1);
}

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

prize.cpp: In function 'int find_best(int)':
prize.cpp:59:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

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