ASeDatAb Solution Round 1B 2022 - Code Jam 2022

ASeDatAb Solution Round 1B 2022 - Code Jam 2022

Problem

A research consortium has been looking for the best possible database for three years, but they are still having problems. The database stores values as records that hold 8$8$-bit binary strings. Unfortunately, their implementation of the function to set the value of a record is flawed.

Each record of the database is an 8$8$⁠-bit binary string. The bits of the binary string are indexed from 0$0$ to 7$7$ from left to right. When an instruction to set a specific record to a new value V$V$ is received, instead of setting the value to V$V$ the database does the following:

1. Choose an integer r$r$ between 0$0$ and 7$7$, inclusive, and let W$W$ be like V$V$ but rotated by r$r$ to the right. That is, the ((i+r)mod8)$((i+r)mod8)$⁠-th bit of W$W$ is the i$i$⁠-th bit of V$V$.
2. Replace the current value X$X$ of the record with X$X$ XOR W$W$. That is, the new value of the record has a 1$1$ as its i$i$⁠-th bit if and only if the i$i$⁠-th bits of X$X$ and W$W$ are different.
3. Finally, return the number of bits that are 1$1$ in the new value to the user.

Luckily, it turns out that no matter what the initial value is or what rotation values the database chooses, it is always possible to reset the value of a record to have all bits be 0$0$ with no more than 300$300$ uses of this operation. Implement a program to interact with the database that does this.

Input and output

This is an interactive problem. You should make sure you have read the information in the Interactive Problems section of our FAQ.

Initially, your program should read a single line containing an integer T$T$, the number of test cases. Then, T$T$ test cases must be processed.

At the beginning of each test case, the record in the database is set to a value that is not 00000000. In each test case, your program must process up to 300$300$ exchanges.

The i$i$⁠-th exchange starts with you outputting a single line containing a single 8$8$⁠-bit binary string to be used as the value V$V$ for the operation above. Then, the judge program performs the operation as described and sends you a single line containing a single integer Ni${\mathbf{N}}_{\mathbf{i}}$ representing the number of bits that are equal to 1$1$ in the updated value of the record.

• If Ni=0${\mathbf{N}}_{\mathbf{i}}=0$, it means that you have succeeded and you must start the next test case, or finish the program if it was the last one.
• If Ni=−1${\mathbf{N}}_{\mathbf{i}}=-1$ it means that this was the 300$300$-th exchange of the test case but the record never got to a value of all zeroes, so the test is failed. No further test cases will be processed.
• If 1≤Ni≤8$1\le {\mathbf{N}}_{\mathbf{i}}\le 8$, it means that the updated value of the record has Ni${\mathbf{N}}_{\mathbf{i}}$ ones and you may proceed to the next exchange to keep trying to make it contain only zeroes.

Solution Click Below:- 

Your solution is considered correct if and only if you succeed in setting the value of the record to 00000000 for all test cases.

If the judge receives an invalidly formatted or invalid line from your program at any moment, the judge will print a single number −1$-1$ and will not print any further output. If you receive a −1$-1$, you must finish correctly and without exceeding the time or memory limits to receive a Wrong Answer judgement. Otherwise, you will receive a judgement informing the exceeded resource or the incorrect termination condition.

Limits

Time limit: 10 seconds.
Memory limit: 1 GB.
1≤T≤100$1\le \mathbf{T}\le 100$.
−1≤Ni≤8$-1\le {\mathbf{N}}_{\mathbf{i}}\le 8$ for all i$i$.

Test Set 1 (Visible Verdict)

The initial value of the record is chosen uniformly at random from all 8$8$-bit binary strings that are not 00000000.

Each rotation value is chosen uniformly at random, and independently of all previous choices and interactions.

Test Set 2 (Visible Verdict)

The judge is adversarial. This means, among other things, that the judge can change the initial value or rotation values as long as it is consistent with all interactions. The initial value is guaranteed to never be 00000000.

Testing Tool

You can use this testing tool to test locally or on our platform. To test locally, you will need to run the tool in parallel with your code; you can use our interactive runner for that. For more information, read the instructions in comments in that file, and also check out the Interactive Problems section of the FAQ.

Instructions for the testing tool are included in comments within the tool. We encourage you to add your own test cases. Please be advised that although the testing tool is intended to simulate the judging system, it is NOT the real judging system and might behave differently. If your code passes the testing tool but fails the real judge, please check the Coding section of the FAQ to make sure that you are using the same compiler as us.

Pancake Deque Solution Round 1B 2022 - Code Jam 2022

Controlled Inflation Solution Round 1B 2022 - Code Jam 2022

Join Now for Solution:-