oj.uz

Submission #1022540

# Submission time Handle Problem Language Result Execution time Memory
1022540 2024-07-13T16:55:09 Z TroySer Unscrambling a Messy Bug (IOI16_messy) C++17
38 / 100
 1 ms 436 KB 
#include <bits/stdc++.h>
#include "messy.h"

using namespace std;

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

    string toAdd[n-1];
    for (int i = 1; i <= n-1; i++) {
        string s = "";
        for (int j = 0; j < i; j++) {
            s += "1";
        }
        for (int j = i; j < n; j++) {
            s += "0";
        }
        toAdd[i - 1] = s;
    }

    for (int i = 0; i < n-1; i++) {
        add_element(toAdd[i]);
    }

    compile_set();

    vector<int> perm(n, -1);
    string currString, prevString = "";

    for (int i = 0; i < n; i++) prevString.push_back('0');

    for (int i = 0; i < n-1; i++) {
        currString = prevString;
        bool getOut = false;
        for (int j = 0; j < n; j++) {
            if (currString[j] == '0') {
                currString[j] = '1';
                if (check_element(currString)) {
                    perm[j] = i;
                    break;
                }
                currString[j] = '0';
            }
        }
        prevString = currString;
    }

    for (int i = 0; i < n; i++) {
        if (perm[i] == -1) {
            perm[i] = n-1;
            break;
        }
    }

    return perm;
}

Compilation message

messy.cpp: In function 'std::vector<int> restore_permutation(int, int, int)':
messy.cpp:33:14: warning: unused variable 'getOut' [-Wunused-variable]
   33 |         bool getOut = false;
      |              ^~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB n = 32
2 Correct 1 ms 344 KB n = 32
3 Incorrect 1 ms 348 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 348 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 348 KB grader returned WA
2 Halted 0 ms 0 KB -