제출 #531934

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
531934		BorisBarca	동굴 (IOI13_cave)	C++14	25 / 100	266 ms	512 KiB

cave

/*
$$$$$$$\                      $$\           $$$$$$$\
$$  __$$\                     \__|          $$  __$$\
$$ |  $$ | $$$$$$\   $$$$$$\  $$\  $$$$$$$\ $$ |  $$ | $$$$$$\   $$$$$$\   $$$$$$$\ $$$$$$\
$$$$$$$\ |$$  __$$\ $$  __$$\ $$ |$$  _____|$$$$$$$\ | \____$$\ $$  __$$\ $$  _____|\____$$\
$$  __$$\ $$ /  $$ |$$ |  \__|$$ |\$$$$$$\  $$  __$$\  $$$$$$$ |$$ |  \__|$$ /      $$$$$$$ |
$$ |  $$ |$$ |  $$ |$$ |      $$ | \____$$\ $$ |  $$ |$$  __$$ |$$ |      $$ |     $$  __$$ |
$$$$$$$  |\$$$$$$  |$$ |      $$ |$$$$$$$  |$$$$$$$  |\$$$$$$$ |$$ |      \$$$$$$$\\$$$$$$$ |
\_______/  \______/ \__|      \__|\_______/ \_______/  \_______|\__|       \_______|\_______|
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

#define PB push_back
#define MP make_pair
#define INS insert
#define LB lower_bound
#define UB upper_bound
#define pii pair <int,int>
#define pll pair <long long, long long>
#define X first
#define Y second
#define _ << " " <<
#define sz(x) (int)x.size()
#define all(a) (a).begin(),(a).end()
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORD(i, a, b) for (int i = (a); i > (b); --i)
#define FORA(i, x) for (auto &i : x)
#define REP(i, n) FOR(i, 0, n)
#define BITS(x) __builtin_popcount(x)
#define SQ(a) (a) * (a)
#define TRACE(x) cout << #x " = " << (x) << '\n';
#define YES cout << "YES\n"
#define NO cout << "NO\n"
#define umap unordered_map

typedef long long ll;
typedef long double ld;
typedef vector <int> vi;
typedef vector <pii> vpi;
typedef vector <ll> vll;
typedef vector <pll> vpl;
typedef vector <double> vd;
typedef vector <ld> vld;
typedef vector<string> vs;
typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;
//find_by_order -> kti najmanji
//order_of_key -> koliko ima manjih od x
//((float) t)/CLOCKS_PER_SEC

const int MOD = 1e9 + 7;
const double PI = acos(-1);
const int INF = 1e9 + 10;
const ll INFL = 1e18 + 10;
const int ABC = 30;
const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const int dox[] = {-1, 1, 0, 0, -1, -1, 1, 1};
const int doy[] = {0, 0, -1, 1, -1, 1, -1, 1};

inline int sum(int a, int b){
	if (a + b < 0)
		return (a + b + MOD) % MOD;
	return (a + b) % MOD;
}

inline void add(int &a, int b){
	a = sum(a, b);
}

inline int mul(ll a, ll b){
	return ((a % MOD) * ((ll)b % MOD)) % MOD;
}

inline int sub(int a, int b){
	return (a - b + MOD) % MOD;
}

inline int fast_pot(ll pot, ll n){
	ll ret = 1;
	while (n){
		if (n & 1LL)
			ret = (ret * pot) % MOD;
		pot = (pot * pot) % MOD;
		n >>= 1LL;
	}
	return ret;
}

inline int divide(int a, int b){
	return mul(a, fast_pot(b, MOD - 2));
}

ll lcm(ll a, ll b){
	return abs(a * b) / __gcd(a, b);
}

inline int ccw(pii a, pii b, pii c) {
	return a.X * (b.Y - c.Y) + b.X * (c.Y - a.Y) + c.X * (a.Y - b.Y);
}


inline int CCW(pii A, pii B, pii C){
	double val = ccw(A, B, C);
	double eps = max(max(abs(A.X), abs(A.Y)), max(max(abs(B.X), abs(B.Y)), max(abs(C.X), abs(C.Y)))) / 1e9;
	if (val <= -eps)
		return -1;
	if (val >= eps)
		return 1;
	return 0;
}

void to_upper(string &x){
	REP(i, sz(x))
		x[i] = toupper(x[i]);
}

void to_lower(string &x){
	REP(i, sz(x))
		x[i] = tolower(x[i]);
}

string its(ll x){
	if (x == 0)
		return "0";
	string ret = "";
	while (x > 0){
		ret += (x % 10) + '0';
		x /= 10;
	}
	reverse(all(ret));
	return ret;
}

ll sti(string s){
	ll ret = 0;
	REP(i, sz(s)){
		ret *= 10;
		ret += (s[i] - '0');
	}
	return ret;
}

#include "cave.h"

const int N = 5005;

int s[N], d[N], rijesio[N];

void flip(int l, int r){
	FOR(i, l, r + 1)
		if (!rijesio[i])
			s[i] = !s[i];
}

void exploreCave(int n) {
	REP(i, n)
		s[i] = 0;

	/*int curr = tryCombination(s);
	REP(i, n){
		s[i] = !s[i];
		int t = tryCombination(s);
		if (t == -1)
			t = n;
		if (curr == 0){
			if (t > 0){
				d[i] = 0;
				rijesio[i] = 1;
				break;
			}
		} else {
			if (t == 0){
				d[i] = 0;
				s[i] = !s[i];
				rijesio[i] = 1;
				break;
			}
		}
		s[i] = !s[i];
	}*/

	FOR(door, 0, n){
		int curr = tryCombination(s);
		if (curr == -1)
			curr = n;
		//cout << curr << '\n';
		bool flipped = (curr == n ? 0 : 1);
		int lo = 0, hi = n - 1;
		while (lo < hi){
			int mid = (lo + hi) / 2;
			flip(lo, mid);

			int t = tryCombination(s);
			if (t == -1)
				t = n;
			flip(lo, mid);
			//cout << lo _ mid _ t _ curr << '\n';

			if (curr == door){
				if (t > door){
					flipped = 1;
					hi = mid;
					continue;
				}
			} else if (t == door){
				flipped = 0;
				hi = mid;
				continue;
			}

			lo = mid + 1;
		}

		s[lo] = flipped;
		rijesio[lo] = 1;
		d[lo] = door;
		//cout << lo _ s[lo] << '\n';

		//cout << curr << '\n';
		/*REP(j, n){
			if (rijesio[j])
				continue;
			s[j] = !s[j];
			int t = tryCombination(s);
			if (t == -1)
				t = n;
			if (curr == door){
				if (t > curr){
					rijesio[j] = 1;
					d[j] = door;
					//cout << door _ j _ s[j] _ "type1" << '\n';
					break;
				}
			} else if (t == door){
				rijesio[j] = 1;
				d[j] = door;
				s[j] = !s[j];
				//cout << door _ j _ s[j] _ "type2" << '\n';
				break;
			}
			s[j] = !s[j];
		}*/

	}

	answer(s, d);
}

• Subtask 1: 12 / 12
• Subtask 2: 13 / 13
• Subtask 3: 0 / 21
• Subtask 4: 0 / 30
• Subtask 5: 0 / 24