제출 #139768

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

messy

#include "messy.h"
#include <bits/stdc++.h>

#define pb push_back
#define mp make_pair
#define inside sl<=l&&r<=sr
#define outside r<sl||sr<l
#define orta ((l+r)>>1)
#define INF 1000000009
#define mod 1000000007
#define ppair(x); cerr << "(" << x.first << ", " << x.second << ")\n";
#define bas(x) #x << ": " << x << " "
#define prarr(x, n); cerr << #x << ": "; for(int qsd = 0; qsd < n; qsd++) cerr << x[qsd] << " "; cerr << "\n";
#define prarrv(x); cerr << #x << ": "; for(int qsd = 0; qsd < (int)x.size(); qsd++) cerr << x[qsd] << " "; cerr << "\n";
using namespace std;
typedef long long ll;

int n, w, r;

vector<int> restore_permutation(int N, int W, int R) {
	n = N;
	w = W;
	r = R;
	
	string add = "";
	for (int i = 0; i < n; i++) add += "0";
	for (int i = 0; i < n; i++){
		add[i] = '1';
		add_element(add);
	}
	
	compile_set();
	
	vector<int> perm(n);
	string res = "";
	for (int i = 0; i < n; i++) res += "0";
	for (int i = 0; i < n; i++){
		for (int j = 0; j < n; j++){
			if (res[j] == '1') continue;
			string sor = res;
			sor[j] = '1';
			if (check_element(sor)){
				perm[j] = i;
				res[j] = '1';
				break;
			}
		}
	}
	
	return perm;
	
    /*add_element("0000");
    compile_set();
    check_element("0000");
    return vector<int>{0, 1, 2, 3};*/
}

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