oj.uz

Submission #288367

# Submission time Handle Problem Language Result Execution time Memory
288367 2020-09-01T12:52:27 Z arayi Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 3 ms 576 KB 
#include <bits/stdc++.h>
#include "messy.h"
#define ad push_back
using namespace std;

int n, sm, sm1;
vector <int> p;
void rec1(int l, int r, string s)
{
    if(l == r) return;
    int md = (l + r)/2;
    for (int i = l; i <= md; i++)
    {
        s[i] = '1';
        add_element(s);
        s[i] = '0';
    }
    for (int i = md + 1; i <= r; i++) s[i] = '1';
    rec1(l, md, s);
    for (int i = md + 1; i <= r; i++) s[i] = '0';
    for (int i = l; i <= md; i++) s[i] = '1';
    rec1(md + 1, r, s);
}
void rec(int l, int r, string s, vector <int> sm)
{
    if(l == r)
    {
       p[l] = sm[0];
       return;
    }
    int md = (l + r)/2;
    vector <int> a, b;
    for(auto p : sm)
    {
        s[p] = '1';
        bool bl = check_element(s);
        if(bl) a.ad(p);
        else b.ad(p);
        s[p] = '0';
    }
    for(auto p : b) s[p] = '1';
    rec(l, md, s, a);
    for(auto p : b) s[p] = '0';
    for(auto p : a) s[p] = '1';
    rec(md + 1, r, s, b);
}
vector<int> restore_permutation(int N, int w, int r)
{
    n = N;
    string s;
    vector <int> sm;
    for (int i = 0; i < n; i++) s += '0', sm.ad(i);
    rec1(0, n - 1, s);
    p.resize(n);
    compile_set();
    rec(0, n - 1, s, sm);
    sm = p;
    for (int i = 0; i < n; i++)
        p[sm[i]] = i;
    return p;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 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 384 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 384 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 #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB n = 128
2 Correct 2 ms 512 KB n = 128
3 Correct 2 ms 512 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 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 2 ms 512 KB n = 128

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB n = 128
2 Correct 2 ms 512 KB n = 128
3 Correct 2 ms 512 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 576 KB n = 128
10 Correct 2 ms 512 KB n = 128
11 Correct 3 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 2 ms 512 KB n = 128