oj.uz

Submission #427483

# Submission time Handle Problem Language Result Execution time Memory
427483 2021-06-14T16:02:07 Z ivan24 Unscrambling a Messy Bug (IOI16_messy) C++14
70 / 100
 3 ms 596 KB 
#include "messy.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll,ll> ii;
typedef vector<ii> vii;
typedef vector<vii> vvii;

ll min(ll x, ll y){
    return ((x < y) ? x : y);
}

ll max(ll x, ll y){
    return ((x > y) ? x : y);
}

/*

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) {
    cout << "add_element: " << x << endl;
    if (--w < 0 || compiled || !check(x)) {
        wa();
    }
    set_.insert(x);
}

bool check_element(string x) {
    if (--r < 0 || !compiled || !check(x)) {
        wa();
    }
    bool  res = set_.count(x);
    cout << "check_element: " << x << " " << res << endl;
    return res;
}

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;
}

//*/

std::vector<int> restore_permutation(int n, int w, int r) {
    vi anchors;
    ll lg = log2(n);
    for (ll i = 0; lg > i; i++){
        for (ll j = 0; n > j; j++){
            ll bm = (1 << i);
            if ((j & bm) == 0) continue;
            //cout << j << ' ' << bm << ": " << (j & bm) <<endl;
            string s;
            s.assign(n,'0');
            for (auto i: anchors) s[i] = '1';
            s[j] = '1';
            add_element(s);
        }
        if (i != lg-1){
            ll cur_anch = 1;
            cur_anch <<= i;
            string s;
            s.assign(n,'1');
            s[cur_anch] = '0';
            add_element(s);
            anchors.push_back(cur_anch);
        }

    }
    compile_set();
    vi isAnchor;
    isAnchor.assign(n,0);
    for (ll i = 0; n > i; i++){
        string  s;
        s.assign(n,'1');
        s[i] = '0';
        bool res = check_element(s);
        if (res) isAnchor[i] = 1;
    }
    vi cur_anchors;
    vi isFoundAnchor;
    isFoundAnchor.assign(n,0);
    vector<int> p; p.assign(n,0);
    for (ll i = 0; lg > i; i++){
        ll found_anchor;
        for (ll j = 0; n > j; j++){
            if (isFoundAnchor[j]) continue;
            string s; s.assign(n,'0');
            s[j] = '1';
            for (auto k: cur_anchors) s[k] = '1';
            bool res = check_element(s);
            if (res){
                p[j] += (1 << i);
                if (isAnchor[j])found_anchor = j;
            }
        }
        cur_anchors.push_back(found_anchor);
        isFoundAnchor[found_anchor] = 1;
    }
    return p;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB n = 8
2 Correct 1 ms 204 KB n = 8
3 Correct 1 ms 292 KB n = 8
4 Correct 1 ms 204 KB n = 8
5 Correct 1 ms 204 KB n = 8
6 Correct 1 ms 204 KB n = 8
7 Correct 1 ms 204 KB n = 8
8 Correct 1 ms 256 KB n = 8
9 Correct 1 ms 256 KB n = 8
10 Correct 1 ms 204 KB n = 8
11 Correct 1 ms 204 KB n = 8
12 Correct 1 ms 204 KB n = 8
13 Correct 1 ms 204 KB n = 8
14 Correct 1 ms 292 KB n = 8
15 Correct 1 ms 256 KB n = 8

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB n = 32
2 Correct 1 ms 428 KB n = 32
3 Correct 1 ms 204 KB n = 32
4 Correct 1 ms 288 KB n = 32
5 Correct 1 ms 204 KB n = 32
6 Correct 1 ms 256 KB n = 32
7 Correct 1 ms 208 KB n = 32
8 Correct 1 ms 204 KB n = 32
9 Correct 1 ms 204 KB n = 32
10 Correct 1 ms 256 KB n = 32
11 Correct 1 ms 424 KB n = 32
12 Correct 1 ms 204 KB n = 32
13 Correct 1 ms 336 KB n = 32
14 Correct 1 ms 204 KB n = 32
15 Correct 1 ms 204 KB n = 32

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB n = 32
2 Correct 1 ms 204 KB n = 32
3 Correct 1 ms 292 KB n = 32
4 Correct 1 ms 204 KB n = 32
5 Correct 1 ms 328 KB n = 32
6 Correct 1 ms 204 KB n = 32
7 Correct 1 ms 204 KB n = 32
8 Correct 1 ms 204 KB n = 32
9 Correct 1 ms 424 KB n = 32
10 Correct 1 ms 204 KB n = 32
11 Correct 1 ms 208 KB n = 32
12 Correct 1 ms 256 KB n = 32
13 Correct 1 ms 288 KB n = 32
14 Correct 1 ms 252 KB n = 32
15 Correct 1 ms 256 KB n = 32

Subtask #4
21.0 / 21.0

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

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 548 KB grader returned WA
2 Halted 0 ms 0 KB -