oj.uz

Submission #95204

# Submission time Handle Problem Language Result Execution time Memory
95204 2019-01-28T14:35:56 Z someone_aa Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 6 ms 512 KB 
#include <vector>
#include <bits/stdc++.h>
#include "messy.h"
#define pb push_back
#define mp make_pair
using namespace std;
const int maxn = 130;
bool taken[130];
string zeros;
int n;


void add(int l, int r) {
    if(l == r) return;
    else {
        int mid = (l + r) / 2;
        string tmp = zeros;
        for(int i=0;i<n;i++) {
            if(i < l || i > r) tmp[i] = '1';
        }
        for(int i=l;i<=mid;i++) {
            tmp[i] = '1';
            add_element(tmp);
            tmp[i] = '0';
        }

        add(l, mid);
        add(mid+1, r);

    }
}

vector<int>result;

bool here[maxn];
void solve(int l, int r, vector<int>possible) {
    if(l == r) {
        result[possible[0]] = l;
        return;
    }
    else {
        // for each element that is not in possible put 1 on bit searching mask

        int mid = (l + r) / 2;

        memset(here,false,sizeof(here));
        string tmp = zeros;

        for(int i:possible) here[i] = true;

        vector<int>ls;
        vector<int>rs;
        for(int i=0;i<n;i++) {
            if(!here[i]) tmp[i] = '1';
        }

        for(int i=0;i<n;i++) {
            if(here[i]) {
                tmp[i] = '1';
                if(check_element(tmp)) {
                    ls.pb(i);
                }
                else {
                    rs.pb(i);
                }
                tmp[i] = '0';
            }
        }

        /*cout<<"["<<l<<", "<<mid<<"] -> ";
        for(int i:ls) cout<<i<<" ";
        cout<<"\n";
        cout<<"["<<mid+1<<", "<<r<<"] -> ";
        for(int i:rs) cout<<i<<" ";
        cout<<"\n";*/
        solve(l, mid, ls);
        solve(mid+1,r, rs);
    }
}

std::vector<int> restore_permutation(int N, int w, int r) {
    n = N;
    vector<int>possible;
    for(int i=0;i<n;i++) {
        zeros += "0";
        result.pb(0);
        possible.pb(i);
    }

    add(0, n-1);
    compile_set();
    solve(0, n-1, possible);
    return result;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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