oj.uz

Submission #837771

# Submission time Handle Problem Language Result Execution time Memory
837771 2023-08-25T16:32:29 Z oscar1f Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 468 KB 
#include<bits/stdc++.h>
#include "messy.h"

using namespace std;
int nbBits;
vector<int> rep;

string transfo(vector<int> v) {
    string s;
    for (int i:v) {
        if (i==0) {
            s+='0';
        }
        else {
            s+='1';
        }
    }
    //cout<<s<<endl;
    return s;
}

void ajout(int deb,int fin) {
    if (deb==fin) {
        return;
    }
    vector<int> quest(nbBits);
    for (int i=0;i<nbBits;i++) {
        quest[i]=1;
    }
    for (int i=deb;i<=fin;i++) {
        quest[i]=0;
    }
    int mid=(deb+fin)/2;
    for (int i=deb;i<=mid;i++) {
        quest[i]=1;
        add_element(transfo(quest));
        quest[i]=0;
    }
    ajout(deb,mid);
    ajout(mid+1,fin);
}

void calc(int deb,int fin,vector<int> possi) {
    /*cout<<deb<<" "<<fin<<" : ";
    for (int i:possi) {
        cout<<i<<" ";
    }
    cout<<endl;*/
    if (deb==fin) {
        rep[possi[0]]=deb; 
        return;
    }
    vector<int> quest(nbBits);
    for (int i=0;i<nbBits;i++) {
        quest[i]=1;
    }
    for (int i:possi) {
        quest[i]=0;
    }
    vector<int> petit,grand;
    int mid=(deb+fin)/2;
    for (int i:possi) {
        quest[i]=1;
        if (check_element(transfo(quest))) {
            petit.push_back(i);
        }
        else {
            grand.push_back(i);
        }
        quest[i]=0;
    }
    calc(deb,mid,petit);
    calc(mid+1,fin,grand);
}

vector<int> restore_permutation(int n, int w, int r) {
    nbBits=n;
    ajout(0,nbBits-1);
    vector<int> initPossi;
    compile_set();
    rep.resize(nbBits);
    for (int i=0;i<nbBits;i++) {
        initPossi.push_back(i);
    }
    calc(0,nbBits-1,initPossi);
    return rep;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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