제출 #393691

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
393691		JimmyZJX	Unscrambling a Messy Bug (IOI16_messy)	C++14	38 / 100	2 ms	332 KiB

messy

#include <iostream>
#include <fstream>
#include <algorithm>
#include <cstring>
#include <climits>
#include <cassert>
#include <tuple>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <unordered_set>
#include <unordered_map>
#include <numeric>

using namespace std;

typedef long long LL;
typedef vector<int> Vi;
typedef vector<LL> VL;
typedef vector<bool> Vb;
typedef vector<vector<int>> Vii;
typedef vector<vector<vector<int>>> Viii;
typedef vector<vector<pair<int, int>>> Vip;

#define forR(i, n) for (int i = 0; i < (n); i++)

void add_element(string x);
void compile_set();
bool check_element(string x);

Vi restore_permutation(int n, int w, int r) {
	for (int i = 1; i <= n; i++) {
		// i*0 + (n-i)*1
		string s;
		s.append(i, '0');
		s.append(n - i, '1');
		add_element(s);
	}
	compile_set();

	string cur; cur.append(n, '1');
	Vi p(n);
	for (int i = 0; i < n; i++) {
		forR(j, n) {
			if (cur[j] == '0') continue;
			cur[j] = '0';
			if (check_element(cur)) {
				// j-th is original i
				p[j] = i;
				break;
			}
			cur[j] = '1';
		}
	}
	
	return p;
}

#ifdef TEST_LOCAL
Vi _p { 2,1,3,0 };
set<string> _comp;
void add_element(string x) {
	string y;
	for (int d : _p) {
		y.append(1, x[d]);
	}
	_comp.insert(y);
}
void compile_set() {}
bool check_element(string x) {
	return _comp.count(x) > 0;
}

int main() {
	auto r = restore_permutation(4, 16, 16);

	return 0;
}
#endif

• Subtask 1: 20 / 20
• Subtask 2: 18 / 18
• Subtask 3: 0 / 11
• Subtask 4: 0 / 21
• Subtask 5: 0 / 30