Submission #635118

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
635118	2022-08-25 12:36:30	JeanBombeur	Unscrambling a Messy Bug (IOI16_messy)	C++17	100 / 100	2 ms	472 KiB

messy

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#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 ++)
        {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 20 / 20
• Subtask 2: 18 / 18
• Subtask 3: 11 / 11
• Subtask 4: 21 / 21
• Subtask 5: 30 / 30