oj.uz

Submission #50692

# Submission time Handle Problem Language Result Execution time Memory
50692 2018-06-12T17:03:39 Z faishol27 Unscrambling a Messy Bug (IOI16_messy) C++14
38 / 100
 3 ms 432 KB 
////////////////////////////////////////////////
//                                            //
//  Author: Muhammad Faishol Amirul Mukminin  //
//                                            //
////////////////////////////////////////////////
#include "messy.h"

#include <bits/stdc++.h>
using namespace std;

vector<int>ans;

string solve(int cnt, string s){
    string ret = s;
    int len = s.length(),
        terkiri;
    
    for(int i=len-1;i>=0;i--)
        if(ret[i] == '0'){
            terkiri = i;
            break;
        }

    for(int i=0;i<terkiri;i++){
        if(ret[i]=='1') continue;

        ret[i] = '1';
        if(check_element(ret)){
            ans[i] = cnt-1;
            return ret;
        }else{
            ret[i] = '0';
        }

    }

    ans[terkiri] = cnt-1;
    ret[terkiri] = '1';
    return ret;
}

std::vector<int> restore_permutation(int N, int W, int R) {
    ans.resize(N, -1);
    string  B = "",
            tmp = "";

    for(int i=0;i<N;i++){
        B += "0";
        tmp += "0";
    }

    for(int i=0;i<N-1;i++){
        B[i] = '1';
        add_element(B);
    }
    
    compile_set();
    
    for(int i=1;i<N;i++){
        tmp = solve(i, tmp);
    }

    for(int i=0;i<N;i++) if(ans[i]==-1) ans[i] = N-1;

    return std::vector<int>(ans);
}

Compilation message

messy.cpp: In function 'std::__cxx11::string solve(int, std::__cxx11::string)':
messy.cpp:16:9: warning: 'terkiri' may be used uninitialized in this function [-Wmaybe-uninitialized]
         terkiri;
         ^~~~~~~

Subtask #1
20.0 / 20.0

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

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

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 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 3 ms 384 KB grader returned WA
2 Halted 0 ms 0 KB -