oj.uz

Submission #388822

# Submission time Handle Problem Language Result Execution time Memory
388822 2021-04-13T05:29:00 Z ParsaAlizadeh Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 3 ms 472 KB 
#include <bits/stdc++.h>
#include "messy.h"
using namespace std;

string to_string(vector<bool> const& mask) {
    string res;
    for (bool b : mask)
        res.push_back(b ? '1' : '0');
    return res;
}

void insert(int l, int r, vector<bool>& mask) {
    if (r - l == 1)
        return;
    int mid = (l + r) >> 1;
    for (int i = l; i < mid; i++) {
        mask[i] = true;
        add_element(to_string(mask));
        mask[i] = false;
    }
    for (int i = mid; i < r; i++)
        mask[i] = true;
    insert(l, mid, mask);
    for (int i = l; i < r; i++)
        mask[i] = i < mid;
    insert(mid, r, mask);
    for (int i = l; i < mid; i++)
        mask[i] = false;
}

void solve(int l, int r, vector<bool>& mask, vector<int>& perm) {
    if (r - l == 1) {
        int ind;
        for (int i = 0; i < mask.size(); i++)
            if (!mask[i])
                ind = i;
        perm[ind] = l;
        return;
    }
    vector<int> lft, rgt;
    for (int i = 0; i < mask.size(); i++) {
        if (!mask[i]) {
            mask[i] = true;
            (check_element(to_string(mask)) ? lft : rgt).push_back(i);
            mask[i] = false;
        }
    }
    int mid = (l + r) >> 1;
    for (int i : rgt)
        mask[i] = true;
    solve(l, mid, mask, perm);
    for (int i : lft)
        mask[i] = true;
    for (int i : rgt)
        mask[i] = false;
    solve(mid, r, mask, perm);
    for (int i : lft)
        mask[i] = false;
}

vector<int> restore_permutation(int n, int w, int r) {
    vector<bool> mask(n, false);
    insert(0, n, mask);
    compile_set();
    vector<int> perm(n);
    solve(0, n, mask, perm);
    return perm;
}

Compilation message

messy.cpp: In function 'void solve(int, int, std::vector<bool>&, std::vector<int>&)':
messy.cpp:34:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<bool>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |         for (int i = 0; i < mask.size(); i++)
      |                         ~~^~~~~~~~~~~~~
messy.cpp:41:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<bool>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |     for (int i = 0; i < mask.size(); i++) {
      |                     ~~^~~~~~~~~~~~~
messy.cpp:37:17: warning: 'ind' may be used uninitialized in this function [-Wmaybe-uninitialized]
   37 |         perm[ind] = l;
      |                 ^

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.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 208 KB n = 32
4 Correct 1 ms 204 KB n = 32
5 Correct 1 ms 204 KB n = 32
6 Correct 1 ms 204 KB n = 32
7 Correct 1 ms 292 KB n = 32
8 Correct 1 ms 204 KB n = 32
9 Correct 1 ms 208 KB n = 32
10 Correct 1 ms 204 KB n = 32
11 Correct 1 ms 204 KB n = 32
12 Correct 1 ms 204 KB n = 32
13 Correct 1 ms 204 KB n = 32
14 Correct 1 ms 204 KB n = 32
15 Correct 1 ms 208 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 204 KB n = 32
4 Correct 1 ms 204 KB n = 32
5 Correct 1 ms 204 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 204 KB n = 32
10 Correct 1 ms 204 KB n = 32
11 Correct 1 ms 204 KB n = 32
12 Correct 1 ms 208 KB n = 32
13 Correct 1 ms 204 KB n = 32
14 Correct 1 ms 204 KB n = 32
15 Correct 1 ms 204 KB n = 32

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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