# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1224700 | LIA | Unscrambling a Messy Bug (IOI16_messy) | C++17 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef tuple <ll,ll,ll> plll;
typedef vector <plll> vplll;
typedef pair <ll,ll> pll;
typedef vector <ll> vll;
typedef vector <pll> vpll;
typedef vector <vector <pll>> vvpll;
typedef vector <vector <ll>> vvll;
typedef vector <bool> vb;
typedef vector <vector <bool>> vvb;
#define loop(i, s, e) for (ll i = (s); i < (e); ++i)
#define loopr(i, e, s) for (ll i = (e)-1; i >= (s); --i)
#define all(a) a.begin(), a.end()
const ll inf = 1e9 + 7;
#include "messy.h"
vector<int> restore_permutation(int n, int w, int r) {
string s(n,'0');
loop(i,0,n) {
s[i] = '1';
add_element(s);
}
s.assign(n,'0');
vll res(n);
loop(i,0,n) {
loop(j,0,n) {
if (s[j]!='1') {
s[j] = '1';
if (check_element(s)) {
res[j] = i;
break;
}
else s[j] = '0';
}
}
}
return res;
}