Problem I
Forest Fire
Languages
en
ja
sv
A fire has broken out in the integer forest! The integer
forest consists of an infite two-dimensional plane where there
is a tree at each point with integer coordinates. Currently,
Input
The first line contains three integers:
-
the number of burning trees
( ), -
the number of chopped-down trees
( ), -
and the number of minutes to the great rain storm
( ).
The following
The following
No two trees, either burning or chopped down, will have the same coordinates.
Output
Output a single integer, the number of trees that are on
fire after
Scoring
Your solution will be tested on a set of test case groups. To get the points for a group, you need to pass all the test cases in the group.
Group |
Points |
Constraints |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
No further constraints |
Explanations of samples
In sample
In sample
In sample
Sample Input 1 | Sample Output 1 |
---|---|
1 1 1 1 2 1 1 |
4 |
Sample Input 2 | Sample Output 2 |
---|---|
1 4 12345678 2 2 1 2 2 1 2 3 3 2 |
1 |
Sample Input 3 | Sample Output 3 |
---|---|
4 1 0 1 1 1 2 2 3 3 4 7 7 |
4 |
Sample Input 4 | Sample Output 4 |
---|---|
1 2 100000 0 0 2 1 1 2 |
20000199999 |