oj.uz

Submission #289896

# Submission time Handle Problem Language Result Execution time Memory
289896 2020-09-03T08:06:35 Z SamAnd Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 3 ms 512 KB 
#include <vector>
#include "messy.h"
#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define fi first
#define se second
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
typedef long long ll;

int n;

void rec0(int l, int r, string s)
{
    if (l == r)
        return;
    int m = (l + r) / 2;
    for (int i = l; i <= m; ++i)
    {
        s[i] = '1';
        add_element(s);
        s[i] = '0';
    }
    for (int i = m + 1; i <= r; ++i)
        s[i] = '1';
    rec0(l, m, s);
    for (int i = m + 1; i <= r; ++i)
        s[i] = '0';
    for (int i = l; i <= m; ++i)
        s[i] = '1';
    rec0(m + 1, r, s);
}

vector<int> ans;

void rec1(int l, int r, string s)
{
    if (l == r)
    {
        for (int i = 0; i < n; ++i)
        {
            if (s[i] == '0')
            {
                ans[i] = l;
            }
        }
        return;
    }
    int m = (l + r) / 2;
    vector<int> v;
    for (int i = 0; i < n; ++i)
    {
        if (s[i] == '0')
        {
            s[i] = '1';
            if (check_element(s))
                v.push_back(i);
            s[i] = '0';
        }
    }

    string sl = s;
    for (int i = 0; i < n; ++i)
    {
        if (s[i] == '0')
        {
            if (!binary_search(all(v), i))
                sl[i] = '1';
        }
    }
    rec1(l, m, sl);

    for (int i = 0; i < sz(v); ++i)
        s[v[i]] = '1';
    rec1(m + 1, r, s);
}

std::vector<int> restore_permutation(int n, int w, int r)
{
    ::n = n;

    string s;
    for (int i = 0; i < n; ++i)
        s += '0';
    rec0(0, n - 1, s);

    compile_set();

    ans.assign(n, 0);
    rec1(0, n - 1, s);
    return ans;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB n = 8
2 Correct 1 ms 256 KB n = 8
3 Correct 1 ms 256 KB n = 8
4 Correct 1 ms 256 KB n = 8
5 Correct 0 ms 256 KB n = 8
6 Correct 1 ms 256 KB n = 8
7 Correct 1 ms 384 KB n = 8
8 Correct 1 ms 256 KB n = 8
9 Correct 1 ms 256 KB n = 8
10 Correct 1 ms 256 KB n = 8
11 Correct 1 ms 256 KB n = 8
12 Correct 1 ms 256 KB n = 8
13 Correct 1 ms 256 KB n = 8
14 Correct 1 ms 256 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 384 KB n = 32
2 Correct 1 ms 384 KB n = 32
3 Correct 1 ms 384 KB n = 32
4 Correct 1 ms 384 KB n = 32
5 Correct 1 ms 384 KB n = 32
6 Correct 1 ms 288 KB n = 32
7 Correct 1 ms 384 KB n = 32
8 Correct 1 ms 384 KB n = 32
9 Correct 1 ms 384 KB n = 32
10 Correct 1 ms 384 KB n = 32
11 Correct 1 ms 384 KB n = 32
12 Correct 1 ms 384 KB n = 32
13 Correct 1 ms 384 KB n = 32
14 Correct 1 ms 384 KB n = 32
15 Correct 1 ms 384 KB n = 32

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB n = 32
2 Correct 1 ms 384 KB n = 32
3 Correct 1 ms 384 KB n = 32
4 Correct 1 ms 384 KB n = 32
5 Correct 1 ms 384 KB n = 32
6 Correct 1 ms 416 KB n = 32
7 Correct 1 ms 384 KB n = 32
8 Correct 1 ms 384 KB n = 32
9 Correct 1 ms 360 KB n = 32
10 Correct 1 ms 384 KB n = 32
11 Correct 1 ms 384 KB n = 32
12 Correct 1 ms 384 KB n = 32
13 Correct 1 ms 384 KB n = 32
14 Correct 1 ms 384 KB n = 32
15 Correct 1 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 2 ms 512 KB n = 128
3 Correct 2 ms 512 KB n = 128
4 Correct 3 ms 512 KB n = 128
5 Correct 2 ms 500 KB n = 128
6 Correct 2 ms 512 KB n = 128
7 Correct 2 ms 512 KB n = 128
8 Correct 2 ms 512 KB n = 128
9 Correct 2 ms 512 KB n = 128
10 Correct 2 ms 512 KB n = 128
11 Correct 2 ms 512 KB n = 128
12 Correct 2 ms 512 KB n = 128
13 Correct 2 ms 512 KB n = 128
14 Correct 2 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 496 KB n = 128
2 Correct 2 ms 512 KB n = 128
3 Correct 2 ms 488 KB n = 128
4 Correct 2 ms 512 KB n = 128
5 Correct 2 ms 512 KB n = 128
6 Correct 2 ms 512 KB n = 128
7 Correct 2 ms 512 KB n = 128
8 Correct 2 ms 512 KB n = 128
9 Correct 2 ms 512 KB n = 128
10 Correct 3 ms 512 KB n = 128
11 Correct 2 ms 512 KB n = 128
12 Correct 3 ms 512 KB n = 128
13 Correct 3 ms 512 KB n = 128
14 Correct 2 ms 512 KB n = 128
15 Correct 2 ms 512 KB n = 128