Problem:


Score: 600 points

Problem Statement

There is a grass field that stretches infinitely.

In this field, there is a negligibly small cow. Let (x, y) denote the point that is x\ \mathrm{cm} south and y\ \mathrm{cm} east of the point where the cow stands now. The cow itself is standing at (0, 0).

There are also N north-south lines and M east-west lines drawn on the field. The i-th north-south line is the segment connecting the points (A_i, C_i) and (B_i, C_i), and the j-th east-west line is the segment connecting the points (D_j, E_j) and (D_j, F_j).

What is the area of the region the cow can reach when it can move around as long as it does not cross the segments (including the endpoints)? If this area is infinite, print INF instead.

Constraints

All values in input are integers between -10^9 and 10^9  (inclusive).

1 \leq N, M \leq 1000

A_i < B_i\ (1 \leq i \leq N)

E_j < F_j\ (1 \leq j \leq M)

The point (0, 0) does not lie on any of the given segments.

Input

Input is given from Standard Input in the following format:

N M
A_1 B_1 C_1
:
A_N B_N C_N
D_1 E_1 F_1
:
D_M E_M F_M

Output

If the area of the region the cow can reach is infinite, print INF; otherwise, print an integer representing the area in \mathrm{cm^2}.

(Under the constraints, it can be proved that the area of the region is always an integer if it is not infinite.)

Sample Input 1

5 6
1 2 0
0 1 1
0 2 2
-3 4 -1
-2 6 3
1 0 1
0 1 2
2 0 2
-1 -4 5
3 -2 4
1 2 4

Sample Output 1

13

The area of the region the cow can reach is 13\ \mathrm{cm^2}.

Sample Input 2

6 1
-3 -1 -2
-3 -1 1
-2 -1 2
1 4 -2
1 4 -1
1 4 1
3 1 4

Sample Output 2

INF

The area of the region the cow can reach is infinite.



Sample input:
5 6
1 2 0
0 1 1
0 2 2
-3 4 -1
-2 6 3
1 0 1
0 1 2
2 0 2
-1 -4 5
3 -2 4
1 2 4


Sample output:
13

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import sys
#from operator import itemgetter
sysread = sys.stdin.buffer.readline
read = sys.stdin.buffer.read
#from heapq import heappop, heappush
#from collections import defaultdict
sys.setrecursionlimit(10**7)
#import math
#from itertools import product#accumulate, combinations, product
import bisect# lower_bound etc
#import numpy as np
#from copy import deepcopy
from collections import deque
def run():
    N,M, *A2F = map(int, read().split())
    A = A2F[0:3*N:3]
    B = A2F[1:3*N+1:3]
    C = A2F[2:3*N+2:3]
    D = A2F[3*N::3]
    E = A2F[3*N+1::3]
    F = A2F[3*N+2::3]

    x_list, y_list = sorted(list(set(A+B+D))), sorted(list(set(C+E+F)))
    max_x = len(x_list)
    max_y = len(y_list)
    #print(x_list)
    tmp1 = [x_list[0]]+x_list
    tmp2 = x_list+[x_list[-1]]
    x_grid = []
    for t1, t2 in zip(tmp1, tmp2):
        x_grid.append(t2-t1)
    #print(x_grid)
    tmp1 = [y_list[0]]+y_list
    tmp2 = y_list+[y_list[-1]]
    y_grid = []
    for t1, t2 in zip(tmp1, tmp2):
        y_grid.append(t2-t1)
    #print(y_list)
    #print(y_grid)
    #grid = np.dot(x_grid.reshape(-1,1), y_grid.reshape(1,-1)).tolist()
    seen = [[False] * (max_y+1) for _ in range(max_x+1)]
    walls = [[0] * (max_y+1) for _ in range(max_x+1)]
    for a,b,c in zip(A,B,C):
        a_i = bisect.bisect_left(x_list, a)
        b_i = bisect.bisect_left(x_list, b)
        c_i = bisect.bisect_left(y_list, c)
        for _x in range(a_i+1, b_i+1):
            walls[_x][c_i] += 1 << 1
            walls[_x][c_i+1] += 1 << 3

    for d,e,f in zip(D,E,F):
        d_i = bisect.bisect_left(x_list, d)
        e_i = bisect.bisect_left(y_list, e)
        f_i = bisect.bisect_left(y_list, f)
        for _y in range(e_i+1, f_i+1):
            walls[d_i][_y] += 1 << 0
            walls[d_i+1][_y] += 1 << 2


    start_x = bisect.bisect_left(x_list, 0)
    start_y = bisect.bisect_left(y_list, 0)

    queue = deque([])
    queue.append((start_x, start_y))
    seen[start_x][start_y] = True


    ret = x_grid[start_x] * y_grid[start_y]
    while queue:
        x, y = queue.popleft()
        for w_i, i, j in ((1,0,1), (3,0,-1), (0,1,0),(2,-1,0)):
            n_x, n_y = x+i, y+j
            if not seen[n_x][n_y] and not walls[x][y] & 1 << w_i and 0 <= n_x <= max_x and 0 <= n_y <= max_y:
                queue.append((n_x, n_y))
                seen[n_x][n_y] = True
                next_sq = x_grid[n_x] * y_grid[n_y]
                ret += next_sq
                if next_sq == 0:
                    print('INF')
                    return None
    print(ret)

if __name__ == "__main__":
    run()

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import sys
#from operator import itemgetter
sysread = sys.stdin.readline
read = sys.stdin.read
#from heapq import heappop, heappush
#from collections import defaultdict
sys.setrecursionlimit(10**7)
#import math
#from itertools import product#accumulate, combinations, product
import bisect# lower_bound etc
#import numpy as np
#from copy import deepcopy
from collections import deque
def run():
    N,M, *A2F = map(int, read().split())
    A = A2F[0:3*N:3]
    B = A2F[1:3*N+1:3]
    C = A2F[2:3*N+2:3]
    D = A2F[3*N::3]
    E = A2F[3*N+1::3]
    F = A2F[3*N+2::3]

    x_list, y_list = sorted(list(set(A+B+D))), sorted(list(set(C+E+F)))
    max_x = len(x_list)
    max_y = len(y_list)
    #print(x_list)
    tmp1 = [x_list[0]]+x_list
    tmp2 = x_list+[x_list[-1]]
    x_grid = []
    for t1, t2 in zip(tmp1, tmp2):
        x_grid.append(t2-t1)
    #print(x_grid)
    tmp1 = [y_list[0]]+y_list
    tmp2 = y_list+[y_list[-1]]
    y_grid = []
    for t1, t2 in zip(tmp1, tmp2):
        y_grid.append(t2-t1)
    #print(y_list)
    #print(y_grid)
    #grid = np.dot(x_grid.reshape(-1,1), y_grid.reshape(1,-1)).tolist()
    seen = [[False] * (max_y+1) for _ in range(max_x+1)]
    walls = [[0] * (max_y+1) for _ in range(max_x+1)]
    for a,b,c in zip(A,B,C):
        a_i = bisect.bisect_left(x_list, a)
        b_i = bisect.bisect_left(x_list, b)
        c_i = bisect.bisect_left(y_list, c)
        for _x in range(a_i+1, b_i+1):
            walls[_x][c_i] += 1 << 1
            walls[_x][c_i+1] += 1 << 3

    for d,e,f in zip(D,E,F):
        d_i = bisect.bisect_left(x_list, d)
        e_i = bisect.bisect_left(y_list, e)
        f_i = bisect.bisect_left(y_list, f)
        for _y in range(e_i+1, f_i+1):
            walls[d_i][_y] += 1 << 0
            walls[d_i+1][_y] += 1 << 2


    start_x = bisect.bisect_left(x_list, 0)
    start_y = bisect.bisect_left(y_list, 0)

    queue = deque([])
    queue.append((start_x, start_y))
    seen[start_x][start_y] = True


    ret = x_grid[start_x] * y_grid[start_y]
    while queue:
        x, y = queue.popleft()
        for w_i, i, j in ((1,0,1), (3,0,-1), (0,1,0),(2,-1,0)):
            n_x, n_y = x+i, y+j
            if not seen[n_x][n_y] and not walls[x][y] & 1 << w_i and 0 <= n_x <= max_x and 0 <= n_y <= max_y:
                queue.append((n_x, n_y))
                seen[n_x][n_y] = True
                next_sq = x_grid[n_x] * y_grid[n_y]
                ret += next_sq
                if next_sq == 0:
                    print('INF')
                    return None
    print(ret)

if __name__ == "__main__":
    run()

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import sys
sysread = sys.stdin.readline
read = sys.stdin.read
sys.setrecursionlimit(10**7)
import bisect# lower_bound etc
from collections import deque
def run():
    N,M, *A2F = map(int, read().split())
    A = A2F[0:3*N:3]
    B = A2F[1:3*N+1:3]
    C = A2F[2:3*N+2:3]
    D = A2F[3*N::3]
    E = A2F[3*N+1::3]
    F = A2F[3*N+2::3]

    x_list, y_list = sorted(list(set(A+B+D))), sorted(list(set(C+E+F)))
    max_x = len(x_list)
    max_y = len(y_list)
    tmp1 = [x_list[0]]+x_list
    tmp2 = x_list+[x_list[-1]]
    x_grid = []
    for t1, t2 in zip(tmp1, tmp2):
        x_grid.append(t2-t1)
    tmp1 = [y_list[0]]+y_list
    tmp2 = y_list+[y_list[-1]]
    y_grid = []
    for t1, t2 in zip(tmp1, tmp2):
        y_grid.append(t2-t1)
    seen = [[False] * (max_y+1) for _ in range(max_x+1)]
    walls = [[0] * (max_y+1) for _ in range(max_x+1)]
    for a,b,c in zip(A,B,C):
        a_i = bisect.bisect_left(x_list, a)
        b_i = bisect.bisect_left(x_list, b)
        c_i = bisect.bisect_left(y_list, c)
        for _x in range(a_i+1, b_i+1):
            walls[_x][c_i] += 1 << 1
            walls[_x][c_i+1] += 1 << 3

    for d,e,f in zip(D,E,F):
        d_i = bisect.bisect_left(x_list, d)
        e_i = bisect.bisect_left(y_list, e)
        f_i = bisect.bisect_left(y_list, f)
        for _y in range(e_i+1, f_i+1):
            walls[d_i][_y] += 1 << 0
            walls[d_i+1][_y] += 1 << 2


    start_x = bisect.bisect_left(x_list, 0)
    start_y = bisect.bisect_left(y_list, 0)

    queue = deque([])
    queue.append((start_x, start_y))
    seen[start_x][start_y] = True


    ret = x_grid[start_x] * y_grid[start_y]
    while queue:
        x, y = queue.popleft()
        for w_i, i, j in ((1,0,1), (3,0,-1), (0,1,0),(2,-1,0)):
            n_x, n_y = x+i, y+j
            if not seen[n_x][n_y] and not walls[x][y] & 1 << w_i and 0 <= n_x <= max_x and 0 <= n_y <= max_y:
                queue.append((x + i, y + j))
                seen[n_x][n_y] = True
                ret += x_grid[x + i] * y_grid[y + j]
                if n_x * n_y == 0 or n_x == max_x or n_y == max_y:
                    print('INF')
                    return None
    print(ret)

if __name__ == "__main__":
    run()

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import sys
#from operator import itemgetter
sysread = sys.stdin.readline
read = sys.stdin.read
#from heapq import heappop, heappush
#from collections import defaultdict
sys.setrecursionlimit(10**7)
#import math
#from itertools import product#accumulate, combinations, product
import bisect# lower_bound etc
#import numpy as np
#from copy import deepcopy
from collections import deque
def run():
    N,M, *A2F = map(int, read().split())
    A = A2F[0:3*N:3]
    B = A2F[1:3*N+1:3]
    C = A2F[2:3*N+2:3]
    D = A2F[3*N::3]
    E = A2F[3*N+1::3]
    F = A2F[3*N+2::3]

    x_list, y_list = sorted(list(set(A+B+D))), sorted(list(set(C+E+F)))
    max_x = len(x_list)
    max_y = len(y_list)
    #print(x_list)
    tmp1 = [x_list[0]]+x_list
    tmp2 = x_list+[x_list[-1]]
    x_grid = []
    for t1, t2 in zip(tmp1, tmp2):
        x_grid.append(t2-t1)
    #print(x_grid)
    tmp1 = [y_list[0]]+y_list
    tmp2 = y_list+[y_list[-1]]
    y_grid = []
    for t1, t2 in zip(tmp1, tmp2):
        y_grid.append(t2-t1)
    #print(y_list)
    #print(y_grid)
    #grid = np.dot(x_grid.reshape(-1,1), y_grid.reshape(1,-1)).tolist()
    seen = [[False] * (max_y+1) for _ in range(max_x+1)]
    walls = [[0] * (max_y+1) for _ in range(max_x+1)]
    for a,b,c in zip(A,B,C):
        a_i = bisect.bisect_left(x_list, a)
        b_i = bisect.bisect_left(x_list, b)
        c_i = bisect.bisect_left(y_list, c)
        for _x in range(a_i+1, b_i+1):
            walls[_x][c_i] += 1 << 1
            walls[_x][c_i+1] += 1 << 3

    for d,e,f in zip(D,E,F):
        d_i = bisect.bisect_left(x_list, d)
        e_i = bisect.bisect_left(y_list, e)
        f_i = bisect.bisect_left(y_list, f)
        for _y in range(e_i+1, f_i+1):
            walls[d_i][_y] += 1 << 0
            walls[d_i+1][_y] += 1 << 2


    start_x = bisect.bisect_left(x_list, 0)
    start_y = bisect.bisect_left(y_list, 0)

    queue = deque([])
    queue.append((start_x, start_y))
    seen[start_x][start_y] = True

    ret = x_grid[start_x] * y_grid[start_y]
    while queue:
        x, y = queue.popleft()
        if x * y == 0 or x == max_x or y == max_y:
            print('INF')
            return None
        for w_i, i, j in ((1,0,1), (3,0,-1), (0,1,0),(2,-1,0)):
            if not seen[x+i][y+j] and not walls[x][y] & 1 << w_i and 0 <= x+i <= max_x and 0 <= y+j <= max_y:
                queue.append((x + i, y + j))
                seen[x + i][y + j] = True
                ret += x_grid[x + i] * y_grid[y + j]

    print(ret)
if __name__ == "__main__":
    run()

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import sys
#from operator import itemgetter
sysread = sys.stdin.readline
read = sys.stdin.read
#from heapq import heappop, heappush
#from collections import defaultdict
sys.setrecursionlimit(10**7)
#import math
#from itertools import product#accumulate, combinations, product
import bisect# lower_bound etc
#import numpy as np
#from copy import deepcopy
from collections import deque
def run():
    N,M, *A2F = map(int, read().split())
    A = A2F[0:3*N:3]
    B = A2F[1:3*N+1:3]
    C = A2F[2:3*N+2:3]
    D = A2F[3*N::3]
    E = A2F[3*N+1::3]
    F = A2F[3*N+2::3]

    x_list, y_list = sorted(list(set(A+B+D))), sorted(list(set(C+E+F)))
    max_sq = (x_list[-1]-x_list[0]) * (y_list[-1] - y_list[0])
    max_x = len(x_list)
    max_y = len(y_list)
    #print(x_list)
    tmp1 = [x_list[0]]+x_list
    tmp2 = x_list+[x_list[-1]]
    x_grid = []
    for t1, t2 in zip(tmp1, tmp2):
        x_grid.append(t2-t1)
    #print(x_grid)
    tmp1 = [y_list[0]]+y_list
    tmp2 = y_list+[y_list[-1]]
    y_grid = []
    for t1, t2 in zip(tmp1, tmp2):
        y_grid.append(t2-t1)
    #print(y_list)
    #print(y_grid)
    #grid = np.dot(x_grid.reshape(-1,1), y_grid.reshape(1,-1)).tolist()
    seen = [[False] * (max_y+1) for _ in range(max_x+1)]
    walls = [[0] * (max_y+1) for _ in range(max_x+1)]
    for a,b,c in zip(A,B,C):
        a_i = bisect.bisect_left(x_list, a)
        b_i = bisect.bisect_left(x_list, b)
        c_i = bisect.bisect_left(y_list, c)
        for _x in range(a_i+1, b_i+1):
            walls[_x][c_i] += 1 << 1
            walls[_x][c_i+1] += 1 << 3

    for d,e,f in zip(D,E,F):
        d_i = bisect.bisect_left(x_list, d)
        e_i = bisect.bisect_left(y_list, e)
        f_i = bisect.bisect_left(y_list, f)
        for _y in range(e_i+1, f_i+1):
            walls[d_i][_y] += 1 << 0
            walls[d_i+1][_y] += 1 << 2


    start_x = bisect.bisect_left(x_list, 0)
    start_y = bisect.bisect_left(y_list, 0)

    queue = deque([])
    queue.append((start_x, start_y))
    seen[start_x][start_y] = True


    ret = x_grid[start_x] * y_grid[start_y]
    while queue:
        x, y = queue.popleft()
        if x * y == 0 or x == max_x or y == max_y:
            print('INF')
            return None
        for w_i, i,j in ((1,0,1), (3,0,-1), (0,1,0),(2,-1,0)):
            if not seen[x+i][y+j] and not walls[x][y] & 1 << w_i and 0 <= x+i <= max_x and 0 <= y+j <= max_y:
                queue.append((x + i, y + j))
                seen[x + i][y + j] = True
                ret += x_grid[x + i] * y_grid[y + j]

    print(ret)
if __name__ == "__main__":
    run()

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import sys
#from operator import itemgetter
sysread = sys.stdin.readline
read = sys.stdin.read
from heapq import heappop, heappush
#from collections import defaultdict
sys.setrecursionlimit(10**7)
#import math
#from itertools import product#accumulate, combinations, product
import bisect# lower_bound etc
import numpy as np
#from copy import deepcopy
from collections import deque
def run():
    N,M, *A2F = map(int, read().split())
    A = A2F[0:3*N:3]
    B = A2F[1:3*N+1:3]
    C = A2F[2:3*N+2:3]
    D = A2F[3*N::3]
    E = A2F[3*N+1::3]
    F = A2F[3*N+2::3]

    x_list, y_list = sorted(list(set(A+B+D))), sorted(list(set(C+E+F)))
    max_sq = (x_list[-1]-x_list[0]) * (y_list[-1] - y_list[0])
    #print(x_list)
    tmp1 = np.array([x_list[0]]+x_list)
    tmp2 = np.array(x_list+[x_list[-1]])
    x_grid = tmp2 - tmp1
    #print(x_grid)
    tmp1 = np.array([y_list[0]] + y_list)
    tmp2 = np.array(y_list + [y_list[-1]])
    y_grid = tmp2 - tmp1
    #print(y_list)
    #print(y_grid)
    grid = np.dot(x_grid.reshape(-1,1), y_grid.reshape(1,-1))
    seen = np.zeros_like(grid, dtype=np.bool)
    walls = np.zeros_like(grid, dtype=np.int32)
    for a,b,c in zip(A,B,C):
        a_i = bisect.bisect_left(x_list, a)
        b_i = bisect.bisect_left(x_list, b)
        c_i = bisect.bisect_left(y_list, c)
        walls[a_i+1:b_i+1, c_i] += 1 << 1
        walls[a_i+1:b_i+1, c_i+1] += 1 << 3
    for d,e,f in zip(D,E,F):
        d_i = bisect.bisect_left(x_list, d)
        e_i = bisect.bisect_left(y_list, e)
        f_i = bisect.bisect_left(y_list, f)
        walls[d_i,e_i+1:f_i+1] += 1 << 0
        walls[d_i+1,e_i+1:f_i+1] += 1 << 2

    start_x = bisect.bisect_left(x_list, 0)
    start_y = bisect.bisect_left(y_list, 0)

    queue = deque([])
    queue.append((start_x, start_y))
    seen[start_x, start_y] = True
    max_x = len(x_list)
    max_y = len(y_list)
    ret = grid[start_x, start_y]
    while queue:
        x, y = queue.popleft()
        for w_i, i,j in ((1,0,1), (3,0,-1), (0,1,0),(2,-1,0)):
            if x+i > max_x or y+j > max_y:
                continue
            if walls[x, y] & 1 << w_i:
                continue
            if not seen[x+i, y+j]:
                queue.append((x+i, y+j))
                seen[x+i,y+j] = True
                ret += grid[x+i, y+j]

    if ret == max_sq:
        print('INF')
    else:
        print(ret)
if __name__ == "__main__":
    run()

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import sys
#from operator import itemgetter
sysread = sys.stdin.readline
read = sys.stdin.read
from heapq import heappop, heappush
#from collections import defaultdict
sys.setrecursionlimit(10**7)
#import math
#from itertools import product#accumulate, combinations, product
import bisect# lower_bound etc
import numpy as np
#from copy import deepcopy
from collections import deque
def run():
    N,M, *A2F = map(int, read().split())
    A = A2F[0:3*N:3]
    B = A2F[1:3*N+1:3]
    C = A2F[2:3*N+2:3]
    D = A2F[3*N::3]
    E = A2F[3*N+1::3]
    F = A2F[3*N+2::3]

    x_list, y_list = sorted(list(set(A+B+D))), sorted(list(set(C+E+F)))
    max_sq = (x_list[-1]-x_list[0]) * (y_list[-1] - y_list[0])
    #print(x_list)
    tmp1 = np.array([x_list[0]]+x_list)
    tmp2 = np.array(x_list+[x_list[-1]])
    x_grid = tmp2 - tmp1
    #print(x_grid)
    tmp1 = np.array([y_list[0]] + y_list)
    tmp2 = np.array(y_list + [y_list[-1]])
    y_grid = tmp2 - tmp1
    #print(y_list)
    #print(y_grid)
    grid = np.dot(x_grid.reshape(-1,1), y_grid.reshape(1,-1))
    seen = np.zeros_like(grid, dtype=np.bool)
    walls = np.zeros_like(grid, dtype=np.int32)
    for a,b,c in zip(A,B,C):
        a_i = bisect.bisect_left(x_list, a)
        b_i = bisect.bisect_left(x_list, b)
        c_i = bisect.bisect_left(y_list, c)
        walls[a_i+1:b_i+1, c_i] += 1 << 1
        walls[a_i+1:b_i+1, c_i] += 1 << 3
    for d,e,f in zip(D,E,F):
        d_i = bisect.bisect_left(x_list, d)
        e_i = bisect.bisect_left(y_list, e)
        f_i = bisect.bisect_left(y_list, f)
        walls[d_i,e_i+1:f_i+1] += 1 << 0
        walls[d_i+1,e_i+1:f_i+1] += 1 << 2

    start_x = bisect.bisect_left(x_list, 0)
    start_y = bisect.bisect_left(y_list, 0)

    queue = deque([])
    queue.append((grid[start_x, start_y], start_x, start_y))
    seen[start_x, start_y] = True
    max_x = len(x_list)
    max_y = len(y_list)
    ret = 0
    while queue:
        sq, x, y = queue.popleft()
        for w_i, i,j in ((1,0,1), (3,0,-1), (0,1,0),(2,-1,0)):
            if x+i > max_x or y+j > max_y:
                continue
            if walls[x, y] & 1 << w_i != 0:
                continue
            if not seen[x+i, y+j]:
                queue.append((grid[x+i, y+j], x+i, y+j))
                seen[x+i,y+j] = True
                ret += grid[x+i, y+j]

    if ret == max_sq:
        print('INF')
    else:
        print(ret)
if __name__ == "__main__":
    run()

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline

N,M=map(int,input().split())
TATE=[tuple(map(int,input().split())) for i in range(N)]
YOKO=[tuple(map(int,input().split())) for i in range(M)]


T=[-1<<60,0,1<<60]
Y=[-1<<60,0,1<<60]

for a,b,c in TATE:
    T.append(a)
    T.append(b)
    Y.append(c)

for d,e,f in YOKO:
    T.append(d)
    Y.append(e)
    Y.append(f)

T=sorted(set(T))
Y=sorted(set(Y))

BT=[T[0]]
BY=[Y[0]]

for i in range(1,len(T)):
    BT.append(T[i]-T[i-1])
    BT.append(T[i])

for i in range(1,len(Y)):
    BY.append(Y[i]-Y[i-1])
    BY.append(Y[i])

TDICT=dict()
YDICT=dict()

for i in range(len(BT)):
    if i%2==0:
        TDICT[BT[i]]=i

for i in range(len(BY)):
    if i%2==0:
        YDICT[BY[i]]=i

MAP=[[0]*len(BY) for i in range(len(BT))]

for a,b,c in TATE:
    t0=TDICT[a]
    t1=TDICT[b]
    y=YDICT[c]

    for k in range(t0,t1+1):
        MAP[k][y]=1

for d,e,f in YOKO:
    t=TDICT[d]
    y0=YDICT[e]
    y1=YDICT[f]

    for k in range(y0,y1+1):
        MAP[t][k]=1

#for m in MAP:
#    print(*m)

Q=[(TDICT[0],YDICT[0])]
ANS=0

while Q:
    x,y=Q.pop()
    for z,w in [(x+1,y),(x-1,y),(x,y-1),(x,y+1)]:
        if 0<=z<len(BT) and 0<=w<len(BY) and MAP[z][w]==0:
            MAP[z][w]=1
            Q.append((z,w))
            if z%2==1 and w%2==1:
                ANS+=BT[z]*BY[w]

if ANS>1<<60:
    print("INF")
else:
    print(ANS)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3

import sys
from queue import Queue
from pprint import pprint
sys.setrecursionlimit(300000)


def solve(N: int, M: int, A: "List[int]", B: "List[int]", C: "List[int]", D: "List[int]", E: "List[int]", F: "List[int]"):
    xs, ys = {}, {}
    xs[0] = 0
    ys[0] = 0
    for i in range(N):
        xs[A[i]] = 0
        xs[B[i]] = 0
        ys[C[i]] = 0
    for i in range(M):
        xs[D[i]] = 0
        ys[E[i]] = 0
        ys[F[i]] = 0

    ox = sorted(xs.keys())
    oy = sorted(ys.keys())
    sx, sy = [0] * len(ox), [0] * len(oy)
    for i, x in enumerate(ox):
        xs[x] = i
        sx[i] = x
    for i, y in enumerate(oy):
        ys[y] = i
        sy[i] = y

    return 0
    h, w = len(sy) * 2, len(sx) * 2
    g = [[0] * w for _ in range(h)]
    for i in range(N):
        y = ys[C[i]] * 2
        for x in range(xs[A[i]] * 2, xs[B[i]] * 2 + 1):
            g[y][x] = 1
    for i in range(M):
        x = xs[D[i]] * 2
        for y in range(ys[E[i]] * 2, ys[F[i]] * 2 + 1):
            g[y][x] = 1

    x, y = xs[0] * 2, ys[0] * 2
    g[y][x] = 2
    q = Queue()
    q.put((x, y))
    dx = [0, -1, 0, 1]
    dy = [1, 0, -1, 0]
    ret = 0
    #pprint(g)
    while not q.empty():
        x, y = q.get()
        if x % 2 and y % 2:
            xx = sx[x // 2 + 1] - sx[x // 2]
            yy = sy[y // 2 + 1] - sy[y // 2]
            ret += xx * yy
        for k in range(len(dx)):
            tx, ty = x + dx[k], y + dy[k]
            if 0 <= tx < w and 0 <= ty < h and g[ty][tx] == 0:
                if tx == 0 or tx == w - 1 or ty == 0 or ty == h - 1:
                    print('INF')
                    return
                g[ty][tx] = 2
                q.put((tx, ty))
    #pprint(g)

    #ret = 0
    #for y in range(h):
    #    for x in range(w):
    #        if g[y][x] != 2:
    #            continue
    #        if x == 0 or x == w - 1 or y == 0 or y == h - 1:
    #            print('INF')
    #            return
    #        if x % 2 == 0 or y % 2 == 0:
    #            continue
    #        xx = sx[x // 2 + 1] - sx[x // 2]
    #        yy = sy[y // 2 + 1] - sy[y // 2]
    #        ret += xx * yy
    print(ret)
    return

def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    M = int(next(tokens))  # type: int
    A = [int()] * (N)  # type: "List[int]"
    B = [int()] * (N)  # type: "List[int]"
    C = [int()] * (N)  # type: "List[int]"
    for i in range(N):
        A[i] = int(next(tokens))
        B[i] = int(next(tokens))
        C[i] = int(next(tokens))
    D = [int()] * (M)  # type: "List[int]"
    E = [int()] * (M)  # type: "List[int]"
    F = [int()] * (M)  # type: "List[int]"
    for i in range(M):
        D[i] = int(next(tokens))
        E[i] = int(next(tokens))
        F[i] = int(next(tokens))
    solve(N, M, A, B, C, D, E, F)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3

import sys
from queue import Queue
from pprint import pprint
sys.setrecursionlimit(300000)


def solve(N: int, M: int, A: "List[int]", B: "List[int]", C: "List[int]", D: "List[int]", E: "List[int]", F: "List[int]"):
    xs, ys = {}, {}
    xs[0] = 0
    ys[0] = 0
    for i in range(N):
        xs[A[i]] = 0
        xs[B[i]] = 0
        ys[C[i]] = 0
    for i in range(M):
        xs[D[i]] = 0
        ys[E[i]] = 0
        ys[F[i]] = 0

    ox = sorted(xs.keys())
    oy = sorted(ys.keys())
    sx, sy = [0] * len(ox), [0] * len(oy)
    for i, x in enumerate(ox):
        xs[x] = i
        sx[i] = x
    for i, y in enumerate(oy):
        ys[y] = i
        sy[i] = y

    h, w = len(sy) * 2, len(sx) * 2
    g = [[0] * w for _ in range(h)]
    for i in range(N):
        y = ys[C[i]] * 2
        for x in range(xs[A[i]] * 2, xs[B[i]] * 2 + 1):
            g[y][x] = 1
    for i in range(M):
        x = xs[D[i]] * 2
        for y in range(ys[E[i]] * 2, ys[F[i]] * 2 + 1):
            g[y][x] = 1

    return 0
    x, y = xs[0] * 2, ys[0] * 2
    g[y][x] = 2
    q = Queue()
    q.put((x, y))
    dx = [0, -1, 0, 1]
    dy = [1, 0, -1, 0]
    ret = 0
    #pprint(g)
    while not q.empty():
        x, y = q.get()
        if x % 2 and y % 2:
            xx = sx[x // 2 + 1] - sx[x // 2]
            yy = sy[y // 2 + 1] - sy[y // 2]
            ret += xx * yy
        for k in range(len(dx)):
            tx, ty = x + dx[k], y + dy[k]
            if 0 <= tx < w and 0 <= ty < h and g[ty][tx] == 0:
                if tx == 0 or tx == w - 1 or ty == 0 or ty == h - 1:
                    print('INF')
                    return
                g[ty][tx] = 2
                q.put((tx, ty))
    #pprint(g)

    #ret = 0
    #for y in range(h):
    #    for x in range(w):
    #        if g[y][x] != 2:
    #            continue
    #        if x == 0 or x == w - 1 or y == 0 or y == h - 1:
    #            print('INF')
    #            return
    #        if x % 2 == 0 or y % 2 == 0:
    #            continue
    #        xx = sx[x // 2 + 1] - sx[x // 2]
    #        yy = sy[y // 2 + 1] - sy[y // 2]
    #        ret += xx * yy
    print(ret)
    return

def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    M = int(next(tokens))  # type: int
    A = [int()] * (N)  # type: "List[int]"
    B = [int()] * (N)  # type: "List[int]"
    C = [int()] * (N)  # type: "List[int]"
    for i in range(N):
        A[i] = int(next(tokens))
        B[i] = int(next(tokens))
        C[i] = int(next(tokens))
    D = [int()] * (M)  # type: "List[int]"
    E = [int()] * (M)  # type: "List[int]"
    F = [int()] * (M)  # type: "List[int]"
    for i in range(M):
        D[i] = int(next(tokens))
        E[i] = int(next(tokens))
        F[i] = int(next(tokens))
    solve(N, M, A, B, C, D, E, F)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3

import sys
from queue import Queue
from pprint import pprint
sys.setrecursionlimit(300000)


def solve(N: int, M: int, A: "List[int]", B: "List[int]", C: "List[int]", D: "List[int]", E: "List[int]", F: "List[int]"):
    xs, ys = {}, {}
    xs[0] = 0
    ys[0] = 0
    for i in range(N):
        xs[A[i]] = 0
        xs[B[i]] = 0
        ys[C[i]] = 0
    for i in range(M):
        xs[D[i]] = 0
        ys[E[i]] = 0
        ys[F[i]] = 0

    return 0
    sx, sy = [], []
    ox = sorted(xs.keys())
    for i, x in enumerate(ox):
        xs[x] = i
        sx.append(x)
    oy = sorted(ys.keys())
    for i, y in enumerate(oy):
        ys[y] = i
        sy.append(y)

    h, w = len(sy) * 2, len(sx) * 2
    g = [[0] * w for _ in range(h)]
    for i in range(N):
        y = ys[C[i]] * 2
        for x in range(xs[A[i]] * 2, xs[B[i]] * 2 + 1):
            g[y][x] = 1
    for i in range(M):
        x = xs[D[i]] * 2
        for y in range(ys[E[i]] * 2, ys[F[i]] * 2 + 1):
            g[y][x] = 1

    return 0
    x, y = xs[0] * 2, ys[0] * 2
    g[y][x] = 2
    q = Queue()
    q.put((x, y))
    dx = [0, -1, 0, 1]
    dy = [1, 0, -1, 0]
    ret = 0
    #pprint(g)
    while not q.empty():
        x, y = q.get()
        #if x % 2 and y % 2:
        #    xx = sx[x // 2 + 1] - sx[x // 2]
        #    yy = sy[y // 2 + 1] - sy[y // 2]
        #    ret += xx * yy
        for k in range(len(dx)):
            tx, ty = x + dx[k], y + dy[k]
            if 0 <= tx < w and 0 <= ty < h and g[ty][tx] == 0:
                if tx == 0 or tx == w - 1 or ty == 0 or ty == h - 1:
                    print('INF')
                    return
                g[ty][tx] = 2
                q.put((tx, ty))
    #pprint(g)

    #ret = 0
    #for y in range(h):
    #    for x in range(w):
    #        if g[y][x] != 2:
    #            continue
    #        if x == 0 or x == w - 1 or y == 0 or y == h - 1:
    #            print('INF')
    #            return
    #        if x % 2 == 0 or y % 2 == 0:
    #            continue
    #        xx = sx[x // 2 + 1] - sx[x // 2]
    #        yy = sy[y // 2 + 1] - sy[y // 2]
    #        ret += xx * yy
    print(ret)
    return

def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    M = int(next(tokens))  # type: int
    A = [int()] * (N)  # type: "List[int]"
    B = [int()] * (N)  # type: "List[int]"
    C = [int()] * (N)  # type: "List[int]"
    for i in range(N):
        A[i] = int(next(tokens))
        B[i] = int(next(tokens))
        C[i] = int(next(tokens))
    D = [int()] * (M)  # type: "List[int]"
    E = [int()] * (M)  # type: "List[int]"
    F = [int()] * (M)  # type: "List[int]"
    for i in range(M):
        D[i] = int(next(tokens))
        E[i] = int(next(tokens))
        F[i] = int(next(tokens))
    solve(N, M, A, B, C, D, E, F)

if __name__ == '__main__':
    main()