oj.uz

Submission #209437

# Submission time Handle Problem Language Result Execution time Memory
209437 2020-03-14T07:58:22 Z my99n Unscrambling a Messy Bug (IOI16_messy) C++14
100 / 100
 7 ms 504 KB 
#include <bits/stdc++.h>
#include "messy.h"
using namespace std;

vector<int> p;
int n;
void solve (int l, int r, vector<int>& v) {

    if (l == r) { p[v[0]] = l; return; }

    // cerr << l << ' ' << r << " : ";
    // for (int x : v) cerr << x << ' ';
    // cerr << endl;

    string s(n, '1');
    vector<int> first, last;
    for (auto x : v) s[x] = '0';
    for (auto x : v) {
        s[x] = '1';
        // cerr << "checking " << s << ' ' << check_element(s) << endl;
        if (check_element(s)) first.push_back(x);
        else last.push_back(x);
        s[x] = '0';
    }
    int mid = (l+r)/2;
    solve(l, mid, first);
    solve(mid+1, r, last);
}

void add (int l, int r) {
    string s(n, '1');
    for (int i = l; i <= r; i++) s[i] = '0';
    for (int i = l; i <= (r+l)/2; i++) {
        s[i] = '1';
        // cerr << s << endl;
        add_element(s);
        s[i] = '0';
    } 
}
void add_all (int l, int r) {
    if (l == r) return;
    add(l, r);
    int mid = (l+r)/2;
    add_all(l, mid);
    add_all(mid+1, r);
}

vector<int> restore_permutation(int N, int w, int r) {
    n = N;
    p.resize(n);
    add_all(0, n-1);
    vector<int> v;
    // cerr << "added" << endl;
    for (int i = 0; i < n; i++) v.push_back(i);
    compile_set();
    solve(0, n-1, v);
    return p;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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