oj.uz

Submission #107215

# Submission time Handle Problem Language Result Execution time Memory
107215 2019-04-22T15:17:56 Z popovicirobert Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 11 ms 512 KB 
#include <bits/stdc++.h>
#include "messy.h"

using namespace std;

void divide_add(int l, int r, int n) {

    if(l == r) {
        return ;
    }

    string str;
    str.resize(n);

    for(int i = 0; i < n; i++) {
        str[i] = '1';
        if(l <= i && i <= r) {
            str[i] = '0';
        }
    }

    int mid = (l + r) / 2;

    for(int i = l; i <= mid; i++) {
        if(i != l) {
            str[i - 1] = '0';
        }
        str[i] = '1';
        add_element(str);
    }

    divide_add(l, mid, n);
    divide_add(mid + 1, r, n);

}

void divide_check(int l, int r, int n, vector <int> &sol, string &str) {

    if(l == r) {

        for(int i = 0; i < n; i++) {
            if(str[i] == '0') {
                sol[i] = l;
            }
        }

        return ;
    }

    string a, b;
    a = b = str;

    for(int i = 0; i < n; i++) {
        if(str[i] == '0') {
            str[i] = '1';

            if(check_element(str)) {
                b[i] = '1';
            }
            else {
                a[i] = '1';
            }

            str[i] = '0';
        }
    }

    int mid = (l + r) / 2;
    divide_check(l, mid, n, sol, a);
    divide_check(mid + 1, r, n, sol, b);

}

vector<int> restore_permutation(int n, int w, int r) {

    divide_add(0, n - 1, n);

    compile_set();

    vector <int> sol(n);
    string str(n, '0');

    divide_check(0, n - 1, n, sol, str);

    return sol;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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