Submission #431227

#	Time	Username	Problem	Language	Result	Execution time	Memory
431227		Mazaalai	The Big Prize (IOI17_prize)	C++14	20 / 100	134 ms	868 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;
		}
	}
	int jumped = 0, addPos = 0;
	map <int, int> jumpIdx;
	while(st < n && !found) {
		// cout << st << '\n';
		last = askPos(st);
		int jump = 16;
		int askAdd = 0;
		while(jump >= 0 && !found) {
			int asking = st + askAdd + (1<<jump);
			if (asking >= n) {
				jump--;
				continue;
			}
			PII cur = askPos(asking);
			int curSum = sum(cur);
			int mid = middle(last, cur);
			if (curSum == miniCnt && mid == 0) {
				askAdd += (1<<jump);
			}
			jump--;
		}
		st += askAdd+1;
		bool x = 1;
		while(x && !found) {
			x = 0;
			for (int i = 0; i < 10 && !found; i++) {
				PII cur = askPos(st+i);
				int curSum = sum(cur);
				if (curSum != miniCnt) {
					x = 1;
				} else x = 0;
			}
			st += 9;
		}
	}
	// cout << st << ' ' << '\n';
	// for (int i = st; i < n && !found; i++) {
	// 	askPos(i);
	// }
	return ans;
}

Compilation message (stderr)

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

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