oj.uz

Submission #836552

# Submission time Handle Problem Language Result Execution time Memory
836552 2023-08-24T12:49:45 Z Victor Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 468 KB 
#include "messy.h"
#include <bits/stdc++.h>
using namespace std;

#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define per(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define trav(a,x) for(auto&a:x)

#define all(x) x.begin(),x.end()
#define sz(x) ll(x.size())
#define pb push_back

typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;

ll logn;

std::vector<int> restore_permutation(int n, int w, int r) {
    vll ids,nums;
    rep(i,0,n) {
        ids.pb(i);
        nums.pb(i);
    }

    logn=__builtin_ctz(n);
    {
        string s=string(n,'0');
        rep(i,0,n/2) {
            s[i]='1';
            add_element(s);
            s[i]='0';
        }
    }

    vector<vll> groups;
    {
        rep(j,0,2) {
            vll group;
            rep(i,0+j*(n/2),n/2+j*(n/2)) group.pb(i);
            groups.pb(group);
        }
    }

    rep(i,1,logn) {
        ll k=sz(groups);
        for(int j=0;j<k;j+=2) {
            vll g1=groups[j];
            vll g2=groups[j+1];


            rep(a,0,2) {
                string el=string(n,'0');
                trav(val,g2) el[val]='1';

                rep(b,0,sz(g1)/2) {
                    el[g1[b]]='1';
                    add_element(el);
                    el[g1[b]]='0';
                }

                g1.swap(g2);
            }
        }

        vector<vll> ngroups;
        trav(group,groups) {
            rep(j,0,2) {
                vll ngroup;
                rep(a,0,sz(group)/2) ngroup.pb(group[a+j*sz(group)/2]);
                ngroups.pb(ngroup);
            }
        }
        groups.swap(ngroups);
    }

    compile_set();

    groups.assign(2,vll());
    {
        string el=string(n,'0');
        rep(i,0,n) {
            el[i]='1';
            groups[!check_element(el)].pb(i);
            el[i]='0';
        }
    }

    //trav(group,groups) {
    //    trav(val,group) cout<<val<<' ';
    //    cout<<endl;
    //}
    
    rep(i,1,logn) {
        ll k=sz(groups);
        vector<vll> ngroups;
        for(int j=0;j<k;j+=2) {
            vll g1=groups[j];
            vll g2=groups[j+1];

            rep(a,0,2) {
                string el=string(n,'0');
                trav(val,g2) el[val]='1';

                vll ng1,ng2;
                trav(val,g1) {
                    el[val]='1';
                    //cout<<"el = "<<el<<" check = "<<check_element(el)<<endl;
                    if(check_element(el)) ng1.pb(val);
                    else ng2.pb(val);
                    el[val]='0';
                }
                ngroups.pb(ng1);
                ngroups.pb(ng2);
                g1.swap(g2);
            }
        }
        groups.swap(ngroups);
    }

    vector<int> ans(n);
    rep(i,0,n) ans[groups[i][0]]=i;
    //cout<<sz(groups)<<endl;
    //cout<<sz(groups[0])<<endl;
    //cout<<"ans = ";
    //rep(i,0,n) cout<<ans[i]<<' ';
    //cout<<endl;

    return ans;
}

/*
#include <vector>
#include <cstdio>
#include <string>
#include <set>
#include <cstdlib>
#include <iostream>
#include "messy.h"

using namespace std;

namespace helper {

    set<string> set_;
    bool compiled = false;
    int n;
    vector<int> p;
    int w;
    int r;

    int read_int() {
        int x;
        cin >> x;
        return x;
    }

}

using namespace helper;


// A convenience function.
int get_p(int i) {
    int ret = p[i];
    return ret;
}

int main() {
    n = read_int();
    w = read_int();
    r = read_int();
    p = vector<int>(n);
    for (int i = 0; i < n; i++) {
        p[i] = read_int();
    }
    vector<int> answer = restore_permutation(n, w, r);
    
    if (answer.size() != n) {
        printf("WA\n");
        return 0;
    }


    printf("%d", answer[0]);

    for (int i = 1; i < n; i++) {
        printf(" %d", answer[i]);
    }
    printf("\n");
    return 0;
}

void wa() {
    printf("WA\n");
    exit(0);
}

bool check(const string& x) {
    if ((int)x.length() != n) {
        return false;
    }
    for (int i = 0; i < n; i++) {
        if (x[i] != '0' && x[i] != '1') {
            return false;
        }
    }
    return true;
}

void add_element(string x) {
    if (--w < 0 || compiled || !check(x)) {
        wa();
    }
    set_.insert(x);
}

bool check_element(string x) {
    if (--r < 0 || !compiled || !check(x)) {
        wa();
    }
    return set_.count(x);
}

void compile_set() {
    if (compiled) {
        wa();
    }
    compiled = true;
    set<string> compiledSet;
    string compiledElement = string(n, ' ');
    for (set<string>::iterator it = set_.begin(); it != set_.end(); it++) {
        string s = *it;
        for (int i = 0; i < n; i++) {
            compiledElement[i] = s[get_p(i)];
        }
        compiledSet.insert(compiledElement);
    }
    set_ = compiledSet;
}*/

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 8
2 Correct 0 ms 212 KB n = 8
3 Correct 0 ms 212 KB n = 8
4 Correct 1 ms 212 KB n = 8
5 Correct 0 ms 212 KB n = 8
6 Correct 0 ms 296 KB n = 8
7 Correct 0 ms 212 KB n = 8
8 Correct 0 ms 212 KB n = 8
9 Correct 0 ms 212 KB n = 8
10 Correct 1 ms 212 KB n = 8
11 Correct 1 ms 212 KB n = 8
12 Correct 1 ms 300 KB n = 8
13 Correct 0 ms 212 KB n = 8
14 Correct 0 ms 212 KB n = 8
15 Correct 1 ms 296 KB n = 8

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 32
2 Correct 1 ms 212 KB n = 32
3 Correct 1 ms 328 KB n = 32
4 Correct 1 ms 212 KB n = 32
5 Correct 1 ms 300 KB n = 32
6 Correct 1 ms 212 KB n = 32
7 Correct 1 ms 212 KB n = 32
8 Correct 0 ms 212 KB n = 32
9 Correct 0 ms 212 KB n = 32
10 Correct 1 ms 212 KB n = 32
11 Correct 1 ms 212 KB n = 32
12 Correct 1 ms 212 KB n = 32
13 Correct 1 ms 296 KB n = 32
14 Correct 1 ms 212 KB n = 32
15 Correct 1 ms 212 KB n = 32

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 32
2 Correct 1 ms 300 KB n = 32
3 Correct 1 ms 212 KB n = 32
4 Correct 1 ms 212 KB n = 32
5 Correct 1 ms 212 KB n = 32
6 Correct 1 ms 212 KB n = 32
7 Correct 1 ms 212 KB n = 32
8 Correct 1 ms 300 KB n = 32
9 Correct 1 ms 300 KB n = 32
10 Correct 1 ms 304 KB n = 32
11 Correct 1 ms 212 KB n = 32
12 Correct 1 ms 212 KB n = 32
13 Correct 1 ms 212 KB n = 32
14 Correct 1 ms 212 KB n = 32
15 Correct 1 ms 212 KB n = 32

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB n = 128
2 Correct 1 ms 468 KB n = 128
3 Correct 1 ms 468 KB n = 128
4 Correct 1 ms 468 KB n = 128
5 Correct 1 ms 468 KB n = 128
6 Correct 1 ms 424 KB n = 128
7 Correct 2 ms 468 KB n = 128
8 Correct 1 ms 468 KB n = 128
9 Correct 1 ms 468 KB n = 128
10 Correct 2 ms 468 KB n = 128
11 Correct 1 ms 424 KB n = 128
12 Correct 1 ms 428 KB n = 128
13 Correct 1 ms 468 KB n = 128
14 Correct 1 ms 468 KB n = 128
15 Correct 1 ms 468 KB n = 128

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB n = 128
2 Correct 1 ms 428 KB n = 128
3 Correct 2 ms 432 KB n = 128
4 Correct 1 ms 468 KB n = 128
5 Correct 1 ms 468 KB n = 128
6 Correct 1 ms 468 KB n = 128
7 Correct 2 ms 468 KB n = 128
8 Correct 1 ms 428 KB n = 128
9 Correct 1 ms 468 KB n = 128
10 Correct 1 ms 468 KB n = 128
11 Correct 1 ms 468 KB n = 128
12 Correct 1 ms 468 KB n = 128
13 Correct 1 ms 468 KB n = 128
14 Correct 1 ms 468 KB n = 128
15 Correct 1 ms 468 KB n = 128