Submission #2865705
Source Code Expand
N = int(input()) red_points = sorted([list(map(int, input().split())) for i in range(N)]) blue_points = sorted([list(map(int, input().split())) for i in range(N)],key = lambda x: (x[1], x[0])) for blue_point in blue_points: blue_point.append(False) ans = 0 for red_point in red_points: for blue_point in blue_points: if red_point[0] < blue_point[0] and red_point[1] < blue_point[1] and not blue_point[2]: ans += 1 blue_point[2] = True break print(ans)
Submission Info
Submission Time | |
---|---|
Task | C - 2D Plane 2N Points |
User | genkinanodesu |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 520 Byte |
Status | WA |
Exec Time | 19 ms |
Memory | 3064 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 400 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | example_0, example_1, example_2, example_3, example_4 |
All | example_0, example_1, example_2, example_3, example_4, line_0, line_1, line_2, line_3, maxrand_0, maxrand_1, maxrand_2, maxrand_3, maxrand_4, rand_0, rand_1, rand_2 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
example_0 | AC | 17 ms | 3064 KB |
example_1 | AC | 17 ms | 3064 KB |
example_2 | AC | 17 ms | 3064 KB |
example_3 | AC | 17 ms | 3060 KB |
example_4 | AC | 17 ms | 3064 KB |
line_0 | AC | 18 ms | 3064 KB |
line_1 | AC | 19 ms | 3064 KB |
line_2 | AC | 18 ms | 3064 KB |
line_3 | AC | 18 ms | 3064 KB |
maxrand_0 | WA | 19 ms | 3064 KB |
maxrand_1 | WA | 19 ms | 3060 KB |
maxrand_2 | WA | 19 ms | 3064 KB |
maxrand_3 | WA | 19 ms | 3064 KB |
maxrand_4 | WA | 19 ms | 3064 KB |
rand_0 | WA | 19 ms | 3064 KB |
rand_1 | WA | 18 ms | 3060 KB |
rand_2 | WA | 18 ms | 3064 KB |