Submission #64612

#	Time	Username	Problem	Language	Result	Execution time	Memory
64612		nvmdava	커다란 상품 (IOI17_prize)	C++17	0 / 100	7 ms	5120 KiB

prize

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




vector<int> ans[200001];
map<int, set<int> > v;
int L, R;
int find_best(int n) {
	L = 0;
	R = n - 1;
	queue<pair<int, int> > q;
	q.push(make_pair(L, R));
	int l, r, m;
	while(!q.empty()){
		l = q.front().first;
		r = q.front().second;
		q.pop();
		cout<<l<<" "<<r<<"\n";
		if(L > r ||  l > R || l > r){
			continue;
		}
		m = (l + r) >> 1;
		ans[m] = ask(m);
		if(ans[m][0] + ans[m][1] == 0){
			return m;
		}
		
		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()){
			tmp--;
			if(ans[m][0] != ans[*tmp][0]){
				in = 1;
				tmp++;
				q.push(make_pair(l, *tmp));
				break;
			}
		}
		if(in == 0){
			q.push(make_pair(l, *(it->second.begin())));
		} else {
			in = 0;
		}
		cout<<"DAS";
		tmp = loc;
		while(tmp != it -> second.end()){
			if(ans[m][0] != ans[*tmp][0]){
				in = 1;
				tmp--;
				q.push(make_pair(*tmp, r));
				break;
			}
			tmp++;
		}
		if(in == 0){
			q.push(make_pair(*(it->second.end()--), r));
		}
	}
}

Compilation message (stderr)

prize.cpp: In function 'int find_best(int)':
prize.cpp:65:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

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