oj.uz

Submission #1037306

# Submission time Handle Problem Language Result Execution time Memory
1037306 2024-07-28T13:17:33 Z RaresFelix Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 1 ms 856 KB 
#include <bits/stdc++.h>
#include "messy.h"

using namespace std;

using vi = vector<int>;


vi restore_permutation(int n, int w, int r) {
    vector<vi> S;
    vi V0;
    for(int i = 0; i < n; ++i) V0.push_back(i);

    S = {V0};

    while(S.size() != n) {
        vector<vi> Snou;
        for(auto &V : S) {
            int len = V.size();
            vi V1, V2;
            for(int i = 0; i < len / 2; ++i) V1.push_back(V[i]);
            for(int i = 0; i < len / 2; ++i) V2.push_back(V[i + len / 2]);
            Snou.push_back(V1);
            Snou.push_back(V2);
            string s;
            for(int i = 0; i < n; ++i) s += '0';
            for(auto it : V) s[it] = '1';
            for(auto it : V1) {
                s[it] = '0';
                add_element(s);
                s[it] = '1';
            }
        }
        S = Snou;
    }

    compile_set();
    S = {V0};

    while(S.size() != n) {
        vector<vi> Snou;
        for(auto &V : S) {
            int len = V.size();
            string s;
            for(int i = 0; i < n; ++i) s += '0';
            for(auto it : V) s[it] = '1';
            vi V1, V2;
            for(auto it : V) {
                s[it] = '0';
                auto re = check_element(s);
                if(re) V1.push_back(it);
                else V2.push_back(it);
                s[it] = '1';
            }
            Snou.push_back(V1);
            Snou.push_back(V2);
        }
        S = Snou;
    }
    vi Re(n, 0);
    for(int i = 0; i < n; ++i)
        Re[S[i][0]] = i;
    return Re;
}

Compilation message

messy.cpp: In function 'vi restore_permutation(int, int, int)':
messy.cpp:16:20: warning: comparison of integer expressions of different signedness: 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   16 |     while(S.size() != n) {
      |           ~~~~~~~~~^~~~
messy.cpp:40:20: warning: comparison of integer expressions of different signedness: 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   40 |     while(S.size() != n) {
      |           ~~~~~~~~~^~~~
messy.cpp:43:17: warning: unused variable 'len' [-Wunused-variable]
   43 |             int len = V.size();
      |                 ^~~

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 1 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 1 ms 344 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 344 KB n = 8
12 Correct 1 ms 348 KB n = 8
13 Correct 0 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 0 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 440 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 0 ms 388 KB n = 32
9 Correct 0 ms 344 KB n = 32
10 Correct 0 ms 348 KB n = 32
11 Correct 0 ms 348 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
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB n = 32
2 Correct 0 ms 348 KB n = 32
3 Correct 0 ms 344 KB n = 32
4 Correct 0 ms 348 KB n = 32
5 Correct 0 ms 348 KB n = 32
6 Correct 0 ms 348 KB n = 32
7 Correct 0 ms 348 KB n = 32
8 Correct 0 ms 348 KB n = 32
9 Correct 0 ms 348 KB n = 32
10 Correct 0 ms 348 KB n = 32
11 Correct 0 ms 348 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 #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB n = 128
2 Correct 1 ms 600 KB n = 128
3 Correct 1 ms 600 KB n = 128
4 Correct 1 ms 424 KB n = 128
5 Correct 1 ms 604 KB n = 128
6 Correct 1 ms 604 KB n = 128
7 Correct 1 ms 604 KB n = 128
8 Correct 1 ms 604 KB n = 128
9 Correct 1 ms 604 KB n = 128
10 Correct 1 ms 604 KB n = 128
11 Correct 1 ms 856 KB n = 128
12 Correct 1 ms 656 KB n = 128
13 Correct 1 ms 604 KB n = 128
14 Correct 1 ms 600 KB n = 128
15 Correct 1 ms 604 KB n = 128