Submission #103162

#	Time	Username	Problem	Language	Result	Execution time	Memory
103162		bert30702	The Big Prize (IOI17_prize)	C++17	0 / 100	3 ms	512 KiB

prize

#include <bits/stdc++.h>
#include "prize.h"
#define pii pair<int, int>
#define F first
#define S second
using namespace std;
unordered_map<int, pii> mp;
pii query(int p) {
	if(mp.find(p) != mp.end()) return mp[p];
	vector<int> v = ask(p);
	return mp[p] = {v[0], v[1]};
}
vector<pii> ans;
void dfs(int l, int r, pii a, pii b) {
	if(l == r) return ans.push_back({b.F + b.S, l});
	if(a == b) return;
	int m = l + r >> 1;
	pii v = query(m);
	if(v == a) return dfs(m + 1, r, v, b);
	if(v == b) return dfs(    l, m, a, v);
	dfs(    l, m, a, v);
	dfs(m + 1, r, v, b);
}
int find_best(int n) {
	dfs(0, n - 1, query(0), query(n - 1));
	for(auto it: ans) if(it.F == 0) return it.S;
}

Compilation message (stderr)

prize.cpp: In function 'void dfs(int, int, std::pair<int, int>, std::pair<int, int>)':
prize.cpp:17:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int m = l + r >> 1;
          ~~^~~
prize.cpp: In function 'int find_best(int)':
prize.cpp:27:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

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