# [Solution] Twisty Little Passages solution codejam

## Twisty Little Passages solution codejam

You are investigating a cave. The cave has NN rooms. There are underground passages that bidirectionally connect some pairs of rooms. Each room has at least one passage connected to it. No passage goes from a room to itself, and no two rooms are connected by more than one passage.

When in a room, you can identify what room you are in and see how many passages it connects to, but you cannot distinguish the passages. You want to estimate the number of passages that exist in the cave. You are allowed to do up to KK operations. An operation is either:

• be magically teleported to a room of your choice, or
• walk through a random passage connected to the room you are in, taking you to the room at the other end of that passage.

When you decide to walk through a passage, you are unable to choose which one, because they are all alike. A passage is chosen for you uniformly at random.

## Twisty Little Passages solution codejam

You begin the investigation in an arbitrary room. Estimate the number of passages between rooms in the cave with at most KK operations.

If EE is your estimate and PP is the actual number of passages, your solution is considered correct for a test case if and only if P2/3EP4/3P⋅2/3≤E≤P⋅4/3.

To pass a test set, your solution must be correct for at least 90% of the test cases in that set.

### Twisty Little Passages solution codejam 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, TT, the number of test cases. Then, TT test cases must be processed.

For each test case, your program must first read a line containing two integers NN and KK: the number of rooms in the cave, and the maximum number of room operations you are allowed. Rooms are numbered between 11 and NN. Then, your program must process up to K+1K+1 exchanges.

The ii-th exchange starts with you reading a line containing two integers RiRi and PiPi, representing the number of the room you are currently in and the number of passages it connects to. Then, you must output a single line containing one of the following:

• A single uppercase W: this means you want to walk through a random passage.
• A single uppercase T and an integer SS: this means you want to teleport to room SS.
• A single uppercase E and an integer EE: this means you want to finish exploring and estimate that the cave contains EE passages.

After an estimation operation, the judge will immediately start the next test case if there is one, regardless of the correctness of your estimation. If there is no next test case, the judge will wait for you to finish without any further output.

## Twisty Little Passages solution codejam

Time limit: 120 seconds.
Memory limit: 1 GB.

#### Test Set 1 (Visible Verdict)

1T1001≤T≤100.
2N1052≤N≤105.
K=8000K=8000.
Each room has at least one passage connected to it.

### 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.

## Twisty Little Passages solution codejam

Sample Interaction
Judge
Solution
1

5 3

Judge gives N=5,K=3N=5,K=3.
4 1

We start at room 44 which has 11 passage.
T 5

Teleport to room 5.
5 2

It has two passages.
W

Walk through a passage.
4 1

We arrived at room 4 again.
T 1

Teleport to room 1.
1 3

It has three passages.
E 5

Guess 5 passages.
(It can be shown that the actual number of passages is either 4 or 5. The two possible graphs for this test case are shown below.)