제출 #1116713

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1116713		Zflop	동굴 (IOI13_cave)	C++14	100 / 100	135 ms	844 KiB

cave

#include "cave.h"
#include <bits/stdc++.h>
using namespace std;
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
 
const int NMAX = (int)1e3 * 6;
int S[NMAX],D[NMAX];
bool fixat[NMAX];
void exploreCave(int N) {
	vector<pair<int,int>>buton;
	buton.push_back({0,0});
	for (int i = 0; i < N;++i)
		buton.push_back({0,i});
	for (int i = 0; i < N;++i) {
		//for (auto j : buton)
		//	cout << j.second << ' ';
		//cout << '\n';
		//for (int j = 0; j < N;++j)
		//	cout << S[j] << ' ';
		//cout << '\n';
		int a = tryCombination(S);
		//cout << a << '\n';
		if (a == i) {
			for (int j = 1; j < (int)buton.size();++j)
				S[buton[j].second] ^= 1;
			}
		int l = 1,r = (int)buton.size() - 1;
		int ans = 1;
		//cout << l << ' ' << r << '\n';
		
		while (l <= r) {
			int mid = (l + r) / 2;
			for (int g = l; g <= mid;++g)
				S[buton[g].second] ^= 1;
			a = tryCombination(S);
			//cout << l << ' ' << mid << ' ' << r << ' ' << a << '\n';
			//for (int j = 0; j < N;++j)
			//	cout << S[j] << ' ';
			//cout << "!\n";
			if (a == i) {
				ans = mid;
				r = mid - 1;
				for (int g = l; g <= mid;++g)
					S[buton[g].second] ^= 1;
				}
			else {
				l = mid + 1;
				}
			}
		//cout << buton[ans].second << ' ' << ans << '\n';
		int t = buton[ans].second;
      if (tryCombination(S) == i)
        S[t]^=1;
		buton.erase(buton.begin() + ans);
		D[t] = i;
		}
	answer(S,D);
	}

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