oj.uz

Submission #592771

# Submission time Handle Problem Language Result Execution time Memory
592771 2022-07-09T15:03:11 Z PiejanVDC Unscrambling a Messy Bug (IOI16_messy) C++17
38 / 100
 1 ms 340 KB 
#include <bits/stdc++.h>
#include "messy.h"
using namespace std;

void add_element(string x);
bool check_element(string x);
void compile_set();

vector<int>restore_permutation(int n, int w, int r) {
    string s = "";
    for(int i = 0 ; i < n ; i++) {
        s += '0';
    }
    
    for(int i = 0 ; i < n ; i++) {
        s[i] = '1';
        add_element(s);
    }

    compile_set();

    s = "";

    for(int i = 0 ; i < n ; i++)
        s += '0';

    vector<int>p(n, -1);

    for(int i = 1 ; i <= n ; i++) {
        
        vector<int>l;

        for(int ii = 0 ; ii < n ; ii++)
            if(s[ii] == '0')
                l.push_back(ii);

        random_shuffle(l.begin(), l.end());

        for(int ii = 0 ; ii < l.size() ; ii++) {
            s[l[ii]] = '1';
            if(check_element(s)) {
                p[l[ii]] = i-1;
                break;
            }
            s[l[ii]] = '0';            
        }
    }

    return p;
}

Compilation message

messy.cpp: In function 'std::vector<int> restore_permutation(int, int, int)':
messy.cpp:39:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |         for(int ii = 0 ; ii < l.size() ; ii++) {
      |                          ~~~^~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB n = 8
2 Correct 0 ms 212 KB n = 8
3 Correct 1 ms 212 KB n = 8
4 Correct 0 ms 212 KB n = 8
5 Correct 0 ms 212 KB n = 8
6 Correct 0 ms 212 KB n = 8
7 Correct 0 ms 212 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 0 ms 212 KB n = 8
12 Correct 0 ms 212 KB n = 8
13 Correct 0 ms 212 KB n = 8
14 Correct 1 ms 212 KB n = 8
15 Correct 0 ms 212 KB n = 8

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB n = 32
2 Correct 0 ms 212 KB n = 32
3 Correct 0 ms 212 KB n = 32
4 Correct 0 ms 212 KB n = 32
5 Correct 0 ms 212 KB n = 32
6 Correct 0 ms 288 KB n = 32
7 Correct 1 ms 212 KB n = 32
8 Correct 0 ms 212 KB n = 32
9 Correct 0 ms 212 KB n = 32
10 Correct 0 ms 212 KB n = 32
11 Correct 0 ms 212 KB n = 32
12 Correct 1 ms 212 KB n = 32
13 Correct 0 ms 212 KB n = 32
14 Correct 0 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 Incorrect 1 ms 212 KB grader returned WA
2 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 -