Submission #431275

#	Time	Username	Problem	Language	Result	Execution time	Memory
431275		Mazaalai	The Big Prize (IOI17_prize)	C++14	20 / 100	177 ms	856 KiB

prize

#include "prize.h"
#include <bits/stdc++.h>
#define ff first
#define ss second
using namespace std;
typedef pair <int, int> PII;

map <int, PII> asked;
int ans = -1;
bool found;
PII askPos(int n) {
	if (asked.count(n)) return asked[n];
	vector <int> res = ask(n);
	PII cur = {res[0], res[1]};
	if (cur.ff + cur.ss == 0) {
		ans = n;
		found = 1;
	}
	return asked[n] = cur;
}
int middle(PII&a, PII&b) {
	return abs(a.ff - b.ff);
}
int sum(PII a) {
	return a.ff + a.ss;
}
int find_best(int n) {
	found = 0;
	int m = 200, st = 0, miniCnt = 0;
	PII last;
	for (int i = 0; i < m && !found; i++) {
		PII cur = askPos(i);
		int curSum = sum(cur);
		if (curSum > miniCnt) miniCnt = curSum;
		if (curSum == miniCnt) {
			last = cur;
			st = i;
		}
	}
	// cout << miniCnt << '\n';
	int jumped = 0, addPos = 0;
	map <int, int> jumpIdx;
	while(st < n && !found) {
		// cout << st << ' ' << n << '\n';
		last = askPos(st);
		int l = st, r = n-1, res = l;
		while(l <= r) {
			int mid = (l+r)/2;
			PII cur = askPos(mid);
			if (last == cur) {
				res = max(res, mid);
				l = mid+1;
			} else {
				r = mid-1;
			}
		}
		
		st = res;
		for (int k = 0; !found && k < 5; k++) {
			st++;
			PII cur = askPos(st);
			int curSum = sum(cur);
		}
		bool x = sum(askPos(st)) != miniCnt;
		while(x && !found) {
			x = 0;
			PII cur = askPos(st);
			int curSum = sum(cur);
			if (curSum != miniCnt) {
				x = 1;
				st++;
			}
		}
	}
	return ans;
}

Compilation message (stderr)

prize.cpp: In function 'int find_best(int)':
prize.cpp:62:8: warning: unused variable 'curSum' [-Wunused-variable]
   62 |    int curSum = sum(cur);
      |        ^~~~~~
prize.cpp:41:6: warning: unused variable 'jumped' [-Wunused-variable]
   41 |  int jumped = 0, addPos = 0;
      |      ^~~~~~
prize.cpp:41:18: warning: unused variable 'addPos' [-Wunused-variable]
   41 |  int jumped = 0, addPos = 0;
      |                  ^~~~~~

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