제출 #788286

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
788286		horiiseun	Unscrambling a Messy Bug (IOI16_messy)	C++17	100 / 100	2 ms	496 KiB

messy

#include <iostream>
#include <vector>
#include <tuple>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <map>
#include <cmath>
#include <random>
#include <string>
#include <bitset>
#include <cassert>
#include <climits>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>
#include "messy.h"
using namespace std;
 
#define ll long long
#define f first
#define s second

void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
 
template<typename A> void __print(const A &x);
template<typename A, typename B> void __print(const pair<A, B> &p);
template<typename... A> void __print(const tuple<A...> &t);
template<typename T> void __print(stack<T> s);
template<typename T> void __print(queue<T> q);
template<typename T, typename... U> void __print(priority_queue<T, U...> q);
 
template<typename A> void __print(const A &x) {
    bool first = true;
    cerr << '{';
    for (const auto &i : x) {
        cerr << (first ? "" : ","), __print(i);
        first = false;
    }
    cerr << '}';
}
 
template<typename A, typename B> void __print(const pair<A, B> &p) {
    cerr << '(';
    __print(p.f);
    cerr << ',';
    __print(p.s);
    cerr << ')';
}
 
template<typename... A> void __print(const tuple<A...> &t) {
    bool first = true;
    cerr << '(';
    apply([&first] (const auto &...args) { ((cerr << (first ? "" : ","), __print(args), first = false), ...); }, t);
    cerr << ')';
}
 
template<typename T> void __print(stack<T> s) {
    vector<T> debugVector;
    while (!s.empty()) {
        T t = s.top();
        debugVector.push_back(t);
        s.pop();
    }
    reverse(debugVector.begin(), debugVector.end());
    __print(debugVector);
}
 
template<typename T> void __print(queue<T> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.front();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}
 
template<typename T, typename... U> void __print(priority_queue<T, U...> q) {
    vector<T> debugVector;
    while (!q.empty()) {
        T t = q.top();
        debugVector.push_back(t);
        q.pop();
    }
    __print(debugVector);
}
 
void _print() { cerr << "]\n"; }
 
template <typename Head, typename... Tail> void _print(const Head &H, const Tail &...T) {
    __print(H);
    if (sizeof...(T)) cerr << ", ";
    _print(T...);
}
 
#ifdef DEBUG
	#define D(...) cerr << "Line: " << __LINE__ << " [" << #__VA_ARGS__ << "] = ["; _print(__VA_ARGS__)
#else
    #define D(...)
#endif

int n;
vector<int> ans;

void build(int l, int r) {
	if (l == r) {
		return;
	}
	int m = (l + r) / 2;
	string curr(n, '1');
	for (int i = l; i <= r; i++) {
		curr[i] = '0';
	}
	for (int i = l; i <= m; i++) {
		curr[i] = '1';
		add_element(curr);
		curr[i] = '0';
	}
	build(l, m);
	build(m + 1, r);
}

void dnc(int l, int r, vector<int> &pos) {
	if (l == r) {
		ans[pos[0]] = l;
		return;
	}
	int m = (l + r) / 2;
	vector<int> v[2];
	string curr(n, '1');
	for (int i : pos) {
		curr[i] = '0';
	}
	for (int i : pos) {
		curr[i] = '1';
		v[check_element(curr)].push_back(i);
		curr[i] = '0';
	}
	dnc(l, m, v[1]);
	dnc(m + 1, r, v[0]);
}

vector<int> restore_permutation(int N, int W, int R) {
	n = N;
	ans.resize(128, 0);
	build(0, n - 1);
	compile_set();

	vector<int> pos;
	for (int i = 0; i < n; i++) {
		pos.push_back(i);
	}
	
	dnc(0, n - 1, pos);
	ans.resize(n);
	D(ans);
	return ans;
}

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