oj.uz

Submission #851009

# Submission time Handle Problem Language Result Execution time Memory
851009 2023-09-18T07:57:22 Z 12345678 Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 856 KB 
#include "messy.h"
#include <bits/stdc++.h>

using namespace std;

const int nx=128;
int N;
bool vs[nx], t[nx];
vector<int> ans;
string s;

void add(int l, int r)
{
    int md=(l+r)/2;
    for (int i=0; i<N; i++) s[i]='1';
    for (int i=l; i<r; i++) s[i]='0';
    for (int i=l; i<md; i++) s[i]='1', add_element(s), s[i]='0';
    if (r-l>2) add(l, md), add(md, r);
}

void check(vector<int> c, int l, int r)
{
    vector<int> g1, g2;
    int md=(l+r)/2;
    for (int i=0; i<N; i++) s[i]='1';
    for (auto x:c) s[x]='0';
    for (auto x:c)
    {
        s[x]='1';
        if (check_element(s)) g1.push_back(x);
        else g2.push_back(x);
        s[x]='0';
    }
    if (c.size()>2) check(g1, l, md), check(g2, md, r);
    else ans[g1[0]]=l, ans[g2[0]]=l+1;
}

vector<int> restore_permutation(int n, int w, int r) {
    N=n;
    ans.resize(N);
    for (int i=0; i<n; i++) s+='0';
    add(0, n);
    compile_set();
    vector<int> tmp;
    for (int i=0; i<n; i++) tmp.push_back(i);
    check(tmp, 0, n);
    return ans;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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