oj.uz

Submission #65244

# Submission time Handle Problem Language Result Execution time Memory
65244 2018-08-07T06:54:44 Z FedericoS Unscrambling a Messy Bug (IOI16_messy) C++14
38 / 100
 3 ms 428 KB 
#include <vector>
#include <iostream>
#include <assert.h>
#include "messy.h"
using namespace std;

bool controlla(string g){
    bool flag=check_element(g);
    //cout<<"controlla(\""<<g<<"\")="<<flag<<endl;
    return flag;
}

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

    vector<int> P(N,-1);
    string S(N,'0');

    for(int i=0;i<N;i++){
        S[i]='1';
        add_element(S);
        //cout<<S<<endl;
    }

    compile_set();

    string R(N,'0');

    for(int i=0;i<N;i++)
        for(int j=0;j<N;j++){
            if(R[j]=='0'){
                R[j]='1';
                if(controlla(R)){
                    P[j]=i;
                    break;
                }
                else
                    R[j]='0';
            }
        }

    return P;
}
/*
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 256 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 384 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 3 ms 384 KB n = 8
11 Correct 2 ms 384 KB n = 8
12 Correct 2 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 308 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 256 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 256 KB n = 32

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB n = 32
2 Correct 2 ms 384 KB n = 32
3 Incorrect 2 ms 428 KB grader returned WA
4 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

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

Subtask #5
0 / 30.0

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