제출 #586157

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
586157		tamthegod	Unscrambling a Messy Bug (IOI16_messy)	C++14	0 / 100	36 ms	49248 KiB

messy

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

#define pb push_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxN = 1e3 + 5;
const int mod = 1e9 + 7;
const ll oo = 1e18;
vector<int> p;
vector<int> vc[maxN][maxN];
string s;
void Prepair(int l, int r)
{
    if(l == r) return;
    int mid = (l + r) / 2;
    for(int i=l; i<=mid; i++)
    {
        s[i] = '1';
        add_element(s);
        s[i] = '0';
    }
    for(int i=mid+1; i<=r; i++) s[i] = '1';
    Prepair(l, mid);
    for(int i=mid+1; i<=r; i++) s[i] = '0';
    for(int i=mid+1; i<=r; i++)
    {
        s[i] = '1';
        add_element(s);
        s[i] = '0';
    }
    for(int i=l; i<=mid; i++) s[i] = '1';
    Prepair(mid + 1, r);
    for(int i=l; i<=mid; i++) s[i] = '0';
}
void DnC(int l, int r)
{
    if(l == r) return;
    int mid = (l + r) / 2;
    for(int i=l; i<=mid; i++)
    {
        s[i] = '1';
        if(check_element(s)) vc[l][mid].pb(i);
        else vc[mid + 1][r].pb(i);
        s[i] = '0';
    }
    for(int i : vc[mid + 1][r]) s[i] = '1';
    DnC(l, mid);
    for(int i : vc[mid + 1][r]) s[i] = '0';
    for(int i : vc[l][mid]) s[i] = '1';
    DnC(mid + 1, r);
    for(int i : vc[l][mid]) s[i] = '0';
}
vector<int> restore_permutation(int n, int w, int r)
{
    p.resize(n);
    for(int i=0; i<n; i++)
        vc[0][n - 1].pb(i);
    for(int i=0; i<n; i++) s += '0';
    Prepair(0, n - 1);
    compile_set();
    for(int i=0; i<n; i++) s[i] = '0';
    DnC(0, n - 1);
    for(int i=0; i<n; i++) p[i] = vc[i][i][0];
    return p;
}
/*void Solve()
{

}
int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    ReadInput();
    Solve();
}*/

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