oj.uz

Submission #609749

# Submission time Handle Problem Language Result Execution time Memory
609749 2022-07-27T20:39:45 Z APROHACK Unscrambling a Messy Bug (IOI16_messy) C++14
38 / 100
 1 ms 340 KB 
#include <vector>
#include <bits/stdc++.h>
using namespace std;
#include "messy.h"

std::vector<int> restore_permutation(int n, int w, int r) {
    string s= "", k = "";
    vector<int>permutation;

    for(int i = 0 ; i < n ; i ++)s+="0", permutation.push_back(0);
    k=s;
    for(int i = 0 ; i  < n ; i++){
        s[i]='1';
        add_element(s);
    }
    compile_set();
    bool past[n];
    memset(past, false, sizeof past);
    for(int i = 0 ; i  < n ; i++){
        for(int j = 0 ; j < n ; j ++){
            if(!past[j]){
                k[j]='1';
                if(check_element(k)){
                    past[j]=true;
                    permutation[j]=i;
                    break;
                }else k[j]='0';
            }
        }
        
    }
    return permutation;
}

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 0 ms 212 KB n = 8
5 Correct 1 ms 212 KB n = 8
6 Correct 1 ms 300 KB n = 8
7 Correct 1 ms 296 KB n = 8
8 Correct 0 ms 212 KB n = 8
9 Correct 0 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 0 ms 296 KB n = 8

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 284 KB n = 32
2 Correct 1 ms 304 KB n = 32
3 Correct 1 ms 212 KB n = 32
4 Correct 0 ms 212 KB n = 32
5 Correct 0 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 212 KB n = 32
9 Correct 1 ms 340 KB n = 32
10 Correct 1 ms 212 KB n = 32
11 Correct 0 ms 300 KB n = 32
12 Correct 0 ms 212 KB n = 32
13 Correct 1 ms 300 KB n = 32
14 Correct 1 ms 212 KB n = 32
15 Correct 0 ms 212 KB n = 32

Subtask #3
0 / 11.0

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

Subtask #4
0 / 21.0

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

Subtask #5
0 / 30.0

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