Submission #205054

#	Time	Username	Problem	Language	Result	Execution time	Memory
205054		mode149256	Hotter Colder (IOI10_hottercolder)	C++17	89 / 100	726 ms	24444 KiB

hottercolder

/*input

*/
#include <bits/stdc++.h>
#include "grader.h"

using namespace std;

typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;

typedef vector<int> vi;
typedef vector<vi> vii;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<vl> vll;
typedef vector<pi> vpi;
typedef vector<vpi> vpii;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
typedef vector<pd> vpd;
typedef vector<bool> vb;
typedef vector<vb> vbb;
typedef std::string str;
typedef std::vector<str> vs;

#define x first
#define y second
#define debug(...) cout<<"["<<#__VA_ARGS__<<": "<<__VA_ARGS__<<"]\n"

const int MOD = 1000000007;
const ll INF = std::numeric_limits<ll>::max();
const int MX = 100101;
const ld PI = 3.14159265358979323846264338327950288419716939937510582097494L;

template<typename T>
pair<T, T> operator+(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x + b.x, a.y + b.y); }
template<typename T>
pair<T, T> operator-(const pair<T, T> &a, const pair<T, T> &b) { return pair<T, T>(a.x - b.x, a.y - b.y); }
template<typename T>
T operator*(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.x + a.y * b.y); }
template<typename T>
T operator^(const pair<T, T> &a, const pair<T, T> &b) { return (a.x * b.y - a.y * b.x); }

template<typename T>
void print(vector<T> vec, string name = "") {
	cout << name;
	for (auto u : vec)
		cout << u << ' ';
	cout << '\n';
}

//Guess
int HC(int N) {
	int l = 1;
	int r = N;
	int last = 1;
	Guess(1);

	while (l < r) {
		// printf("l = %d, r = %d, last = %d\n", l, r, last);
		int mid = (l + r) / 2;

		int ans;

		if (last == r) {
			ans = Guess(l);
			last = l;
			if (ans == 0) return (l + r) / 2;

			if (ans > 0)
				r = (l + r - 1) / 2;
			else
				l = (l + r + 2) / 2;

		}
		else if (last == l) {
			ans = Guess(r);
			last = r;
			if (ans == 0) return (l + r) / 2;

			if (ans > 0)
				l = (l + r + 2) / 2;
			else
				r = (l + r - 1) / 2;

		}
		else {

			// (kitas + last)/2 == mid
			int kitas = 2 * mid - last;

			// printf("kitas = %d\n", kitas);
			if (1 <= kitas and kitas <= N) {
				ans = Guess(kitas);
				int nxt = kitas;
				if (ans == 0) return (last + kitas) / 2;

				if ((ans > 0 and last < kitas) or (ans < 1 and kitas < last))
					l = (last + kitas + 2) / 2;
				else
					r = (last + kitas - 1) / 2;

				last = nxt;
			} else {
				if (last < l) Guess(l), last = l;
				else Guess(r), last = r;
			}
		}
	}

	// printf("returninu %d\n", l);
	return l;
}

/* Look for:
* special cases (n=1?)
* overflow (ll vs int?)
* the exact constraints (multiple sets are too slow for n=10^6 :( )
* array bounds
*/

• Subtask 1: 25 / 25
• Subtask 2: 25 / 25
• Subtask 3: 25 / 25
• Subtask 4: 14 / 25