src/CowCrossTheRoad3.java at master · AthenaJW/src · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
import java.io.*;
import java.util.Arrays;

public class CowCrossTheRoad3 {
	static Connection[][] connections;
	static int[][] sets;
	public static void main(String[] args) throws IOException
	{
		//BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		BufferedReader br = new BufferedReader(new FileReader("countcross.in"));
		String[] temp = br.readLine().split(" ");
		int N = Integer.parseInt(temp[0]);
		int K = Integer.parseInt(temp[1]);
		int R = Integer.parseInt(temp[2]);
		connections = new Connection[N][N];
		sets = new int[N][N];
		for (int[] row: sets)
			Arrays.fill(row, -1);
		Connection c;
		for (int i = 0; i < N; i++)
		{
			for (int j = 0; j < N; j++)
			{
				c = new CowCrossTheRoad3().new Connection();
				if (i == 0)
					c.up = 1;
				if (i == N-1)
					c.down = 1;
				if (j == 0)
					c.left = 1;
				if (j == N-1)
					c.right = 1;
				connections[i][j] = c;
			}
		}
		int r1, r2, c1, c2;
		for (int i = 0; i < R; i++)
		{
			temp = br.readLine().split(" ");
			r1 = Integer.parseInt(temp[0])-1; c1 = Integer.parseInt(temp[1])-1;
			r2 = Integer.parseInt(temp[2])-1; c2 = Integer.parseInt(temp[3])-1;
			if (r1 < r2)
			{
				connections[r1][c1].down = 1;
				connections[r2][c2].up = 1;
			}
			else if (r2 < r1)
			{
				connections[r1][c1].up = 1;
				connections[r2][c2].down = 1;
			}
			else if (c1 < c2)
			{
				connections[r1][c1].right = 1;
				connections[r2][c2].left = 1;
			}
			else if (c2 < c1)
			{
				connections[r1][c1].left = 1;
				connections[r2][c2].right = 1;
			}
		}
		int setnum = 0;
		for (int i = 0; i < N; i++)
			for (int j = 0; j < N; j++)
			{
				if (sets[i][j] != -1)
					continue;
				bfs(i, j, setnum++);
			}
		int[] countsets = new int[setnum];

		for (int i = 0; i < K; i++)
		{
			temp = br.readLine().split(" ");
			r1 = Integer.parseInt(temp[0])-1;
			c1 = Integer.parseInt(temp[1])-1;
			countsets[sets[r1][c1]]++;
		}
		for (int el:countsets)
			System.out.println(el);
		int count = 0;
		for (int i = 0; i < setnum; i++)
			for (int j = i+1; j < setnum; j++)
				count += countsets[i] * countsets[j];
		//System.out.println(count);
		PrintWriter pw = new PrintWriter(new BufferedWriter(new FileWriter("countcross.out")));
		pw.println(count);
		pw.close();
		br.close();
	}
	public class Connection
	{
		int left, right, up, down;
		public Connection()
		{
			left = 0; right = 0; up = 0; down = 0;
		}
	}
	public static void bfs(int x, int y, int setnum)
	{
		if (sets[x][y] == setnum)
			return;
		sets[x][y] = setnum;
		Connection c = connections[x][y];
		if (c.left == 0)
			bfs(x, y-1, setnum);
		if (c.right == 0)
			bfs(x, y+1, setnum);
		if (c.up == 0)
			bfs(x-1, y, setnum);
		if (c.down == 0)
			bfs(x+1, y, setnum);
	}
}