Orig Description
Score : 800 points
Problem StatementTakahashi and Aoki will play a game using a grid with H rows and W columns of square cells.
There are N obstacles on this grid; the i-th obstacle is at (X_i,Y_i).
Here, we represent the cell at the i-th row and j-th column (1 \leq i \leq H, 1 \leq j \leq W) by (i,j).
There is no obstacle at (1,1), and there is a piece placed there at (1,1).
Starting from Takahashi, he and Aoki alternately perform one of the following actions:
Move the piece to an adjacent cell.
Here, let the position of the piece be (x,y). Then Takahashi can only move the piece to (x+1,y), and Aoki can only move the piece to (x,y+1).
If the destination cell does not exist or it is occupied by an obstacle, this action cannot be taken.
Do not move the piece, and end his turn without affecting the grid.
The game ends when the piece does not move twice in a row.
Takahashi would like to perform as many actions (including not moving the piece) as possible before the game ends, while Aoki would like to perform as few actions as possible before the game ends.
How many actions will Takahashi end up performing?
Constraints
1 \leq H,W \leq 2\times 10^5
0 \leq N \leq 2\times 10^5
1 \leq X_i \leq H
1 \leq Y_i \leq W
If i \neq j, (X_i,Y_i) \neq (X_j,Y_j)
(X_i,Y_i) \neq (1,1)
X_i and Y_i are integers.
InputInput is given from Standard Input in the following format:
H W N
X_1 Y_1
:
X_N Y_N
OutputPrint the number of actions Takahashi will end up performing.
Sample Input 13 3 1
3 2
Sample Output 12
For example, the game proceeds as follows:
Takahashi moves the piece to (2,1).
Aoki does not move the piece.
Takahashi moves the piece to (3,1).
Aoki does not move the piece.
Takahashi does not move the piece.
Takahashi performs three actions in this case, but if both players play optimally, Takahashi will perform only two actions before the game ends.
Sample Input 210 10 14
4 3
2 2
7 3
9 10
7 7
8 1
10 10
5 4
3 4
2 8
6 4
4 4
5 8
9 2
Sample Output 26
Sample Input 3100000 100000 0
Sample Output 3100000
Extracted Specification
An integer H (1 ≤ H ≤ 2×10^5), representing some quantity or size.
An integer W (1 ≤ W ≤ 2×10^5), representing some quantity or size.
An integer N (0 ≤ N ≤ 2×10^5), representing some quantity or size.
A list of N tuples, where each tuple contains two integers (X, Y) such that (1 ≤ X ≤ H) and (1 ≤ Y ≤ W).
### Example Input:
```
3 3 1
3 2
```
### Function Signature:
Write a function f(H, W, N, obstacles) that takes in the input.
```python
def f(H: int, W: int, N: int, obstacles: List[Tuple[int, int]]):
'''
H: an integer
W: an integer
N: an integer
obstacles: a list of tuples, where each tuple contains two integers
'''
```
Test Case Generator
Certainly! Here's a Python function that generates test cases for the given problem statement about Takahashi and Aoki's game on a grid:
```python
import random
def tcgen():
# Constraints
H = random.randint(1, 2 * 10**5)
W = random.randint(1, 2 * 10**5)
N = random.randint(0, 2 * 10**5)
# Generate N unique obstacles
obstacles = set()
while len(obstacles) < N:
x = random.randint(1, H)
y = random.randint(1, W)
if (x, y) != (1, 1): # (1,1) should not have an obstacle
obstacles.add((x, y))
# Convert set to sorted list for consistent output
obstacles = sorted(list(obstacles))
# Format the output as described
output = f"{H} {W} {N}\n"
for (x, y) in obstacles:
output += f"{x} {y}\n"
return output.strip()
# Example usage
if __name__ == "__main__":
print(tcgen())
```
This function `tcgen` will generate random test cases based on the constraints provided:
1. `H` and `W` are chosen randomly between 1 and \(2 \times 10^5\).
2. `N` is chosen randomly between 0 and \(2 \times 10^5\).
3. Obstacles are generated as unique pairs that are not equal to (1,1) to ensure the start position is always free.
The set ensures that no duplicate obstacles are generated. Finally, the obstacles are formatted into the required input format.
You can run the `tcgen` function multiple times to generate different test cases for your competitive programming problem.
Extract Arguments
def extract_arguments(fh):
H, W, N = map(int, fh.readline().strip().split())
obstacles = [tuple(map(int, fh.readline().strip().split())) for _ in range(N)]
return H, W, N, obstacles