oj.uz

Submission #65301

# Submission time Handle Problem Language Result Execution time Memory
65301 2018-08-07T10:31:19 Z FedericoS Unscrambling a Messy Bug (IOI16_messy) C++14
70 / 100
 4 ms 512 KB 
#include <vector>
#include <iostream>
#include <assert.h>
#include "messy.h"
using namespace std;

int P[200];
int N;

void inserimento(string s){
    //cout<<"ins "<<s<<endl;
    add_element(s);
}

bool controllo(string s){
    bool f=check_element(s);
    //cout<<"con "<<s<<" "<<f<<endl;
    return f;
}

void crea(int a, int b){

    if(a==b)
        return;

    string s(N,'0');

    for(int i=0;i<a;i++)
        s[i]='1';
    for(int i=b+1;i<N;i++)
        s[i]='1';

    s[a]='1';
    inserimento(s);
    for(int i=a+1;i<=(a+b)/2;i++){
        s[i]='1';
        inserimento(s);
        s[i]='0';
    }

    crea(a,(a+b)/2);
    crea((a+b)/2+1,b);

}

void cerca(string S, int a, int b){

    int pos=-1;
    vector<int> X,Y;

    for(int i=0;i<N;i++)
        if(S[i]=='0'){
            S[i]='1';
            if(controllo(S)){
                pos=i;
                X.push_back(i);
                break;
            }
            S[i]='0';
        }

    assert(pos!=-1);

    for(int i=0;i<N;i++)
        if(S[i]=='0'){
            S[i]='1';
            if(controllo(S))
                X.push_back(i);
            else
                Y.push_back(i);
            S[i]='0';
        }

    assert(X.size()==Y.size());
    if(X.size()==1){
        P[X[0]]=a;
        P[Y[0]]=b;
    }
    else{
        string A(N,'1'),B(N,'1');

        for(int i:X)
            A[i]='0';
        cerca(A,a,(a+b)/2);

        for(int i:Y)
            B[i]='0';
        cerca(B,(a+b)/2+1,b);
    }


}

vector<int> restore_permutation(int n, int w, int r) {

    N=n;

    crea(0,N-1);
    compile_set();
    string v(N,'0');
    cerca(v,0,N-1);

    vector<int> ans(N);
    for(int i=0;i<N;i++)
        ans[i]=P[i];

    return ans;

}
/*
32 320 1024
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31
*/

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 256 KB n = 8
5 Correct 2 ms 384 KB n = 8
6 Correct 2 ms 256 KB n = 8
7 Correct 2 ms 256 KB n = 8
8 Correct 2 ms 256 KB n = 8
9 Correct 2 ms 256 KB n = 8
10 Correct 2 ms 256 KB n = 8
11 Correct 2 ms 256 KB n = 8
12 Correct 2 ms 384 KB n = 8
13 Correct 2 ms 256 KB n = 8
14 Correct 2 ms 256 KB n = 8
15 Correct 2 ms 256 KB n = 8

Subtask #2
18.0 / 18.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 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 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 384 KB n = 32
13 Correct 2 ms 256 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 256 KB n = 32
2 Correct 2 ms 256 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 256 KB n = 32
7 Correct 2 ms 384 KB n = 32
8 Correct 2 ms 256 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 256 KB n = 32
14 Correct 2 ms 256 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 4 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 3 ms 512 KB n = 128
8 Correct 3 ms 512 KB n = 128
9 Correct 3 ms 512 KB n = 128
10 Correct 3 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

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 512 KB grader returned WA
2 Halted 0 ms 0 KB -