제출 #683120

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
683120		thegamercoder19	동굴 (IOI13_cave)	C++14	100 / 100	871 ms	460 KiB

cave

#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include "cave.h"
#define M_PI       3.14159265358979323846
#define FILER 0
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll MOD = pow(10, 9) + 7;
const ll INFL = 0x3f3f3f3f3f3f3f3f;
const ull INFUL = 0x3f3f3f3f3f3f3f3f;
const ll INFT = 0x3f3f3f3f;
const ull MAX = 1LL << 24;
const ll MODD = 998244353;
const double EPS = 1e-10;
#define V vector
#define pll pair<ll, ll>
#define pull2 pair<ull,ull>
#define MS multiset
#define M map
#define Q queue
#define PQ priority_queue
#define IOF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define FOR(typ,i,a,b,c) for(typ i = a; i < b; i += c)
#define FORR(typ,i,a,b,c) for(typ i = a; i > b; i -= c)
#define FORA(a,i) for(auto &i : a)
#define all(v) v.begin(),v.end()
#define sz(v) v.size()
#define sorta(a) sort(all(a))
#define sortd(a) sort(all(a), greater<ll>())
#define setp(x) setprecision(x)<<fixed
#define RET return
#define log(a,b) log(b)/log(a)
#define WH(s) while(s)
#define WHI(t) WH(t--)
#define YES cout<<"YES"<<endl;
#define NO cout<<"NO"<<endl;
#define Yes cout<<"Yes"<<endl;
#define No cout<<"No"<<endl;
#define YESNO(s) cout << (s ? "YES" : "NO") << endl;
#define YesNo(s) cout<<(s?"Yes":"No")<<endl;
#define TYP 0
using namespace std;

void exploreCave(int n) {
	V<int>s, s1,d;
	V<bool> used;
	s.resize(n); s1.resize(n); d.resize(n); used.resize(n);
	ll i = 0, x = 0, l = 0, r = 0, m = 0, ans = 0;
	WH(i<n)
	{
		x = tryCombination(&s[0]);
		s1 = s;
		if (x > i || x == -1)
			FOR(ll, j, 0, n, 1)if (!used[j])s1[j] ^= 1;
		l = 0, r = n - 1, m = 0, ans = 0;
		WH(l <= r)
		{
			m = (l + r) >> 1;
			FOR(ll,j,0,m+1,1)if (!used[j])s1[j] ^= 1;
			x = tryCombination(&s1[0]);
			FOR(ll, j, 0, m + 1, 1)if (!used[j])s1[j] ^= 1;
			if (x > i || x == -1)r = m - 1, ans = m;
			else l = m + 1;

		}
		used[ans] = 1;
		s[ans] = s1[ans]^1;
		d[ans] = i;
		i++;
	}
	answer(&s[0], &d[0]);
}

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