oj.uz

Submission #635118

# Submission time Handle Problem Language Result Execution time Memory
635118 2022-08-25T12:36:30 Z JeanBombeur Unscrambling a Messy Bug (IOI16_messy) C++17
100 / 100
 2 ms 472 KB 
#include "messy.h"

#include <vector>
using namespace std;

//  <|°_°|>

//  JeanBombeur & M. Broccoli

//  The hardest choices require the strongest wills

//  What is better - to be born good, or to overcome your evil nature with great effort ?

vector <int> restore_permutation(int nbBits, int nbWrites, int nbReads) {
    vector <int> Ans(nbBits, 0);
    string word(nbBits, '0');
    
    for (int bit = 1; bit < nbBits; bit <<= 1)
    {
        for (int i = 0; i < nbBits; i ++)
        {
            if (i & bit)
            {
                word[i] ^= '0' ^ '1';
                add_element(word);
                word[i] ^= '0' ^ '1';
            }
        }
        for (int i = 0; i < nbBits; i ++)
        {
            if (i & bit)
                word[i] ^= '0' ^ '1';
        }
    }
    compile_set();
    word = string(nbBits, '0');
    for (int bit = 1; bit < nbBits; bit <<= 1)
    {
        for (int i = 0; i < nbBits; i ++)
        {
            word[i] ^= '0' ^ '1';
            if (check_element(word))
                Ans[i] ^= bit;
            word[i] ^= '0' ^ '1';
        }
        for (int i = 0; i < nbBits; i ++)
        {
            if (Ans[i] & bit)
                word[i] ^= '0' ^ '1';
        }
    }
    
    return Ans;
}

Subtask #1
20.0 / 20.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
21.0 / 21.0

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

Subtask #5
30.0 / 30.0

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