GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — Java/multimoo.java at master · javaarchive/Java

This repository was archived by the owner on Feb 29, 2024. It is now read-only.

Expand file tree

/

multimoo.java

Copy path
More file actions
More file actions

Latest commit

 

History

History
History
155 lines (152 loc) · 4.53 KB
/

multimoo.java

Copy path

File metadata and controls

155 lines (152 loc) · 4.53 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
import java.io.*;
import java.util.*;
public class multimoo {
static Queue<Integer> qx = new LinkedList<>();
static Queue<Integer> qy = new LinkedList<>();
static Set<Position> visited = new HashSet<>();
public static int[][] grid;
public static int N;
public static int floodFill(int tx,int ty, Segement s) {
visited.clear();
int covered = 0;
//reset();
int color = grid[tx][ty];
qx.add(tx);
qy.add(ty);
while(!qx.isEmpty()) {
covered++;
int x = qx.poll();
int y = qy.poll();
s.pieces.add(new Position(x,y));
//System.out.println(x+" "+y+" "+visited);
visited.add(new Position(x,y));
if(x-1 >= 0 && x-1 < N && y < N && y >= 0 && grid[x-1][y] == color&& !visited.contains(new Position(x-1,y))) {
qx.add(x-1);
qy.add(y);
}
if(x+1 >= 0 && x+1 < N && y < N && y >= 0 && grid[x+1][y] == color&& !visited.contains(new Position(x+1,y))) {
qx.add(x+1);
qy.add(y);
}
if(x >= 0 && x < N && y +1 < N && y+1 >= 0 && grid[x][y+1] == color&& !visited.contains(new Position(x,y+1))) {
qx.add(x);
qy.add(y+1);
}
if(x >= 0 && x < N && y-1 < N && y-1 >= 0 && grid[x][y-1] == color && !visited.contains(new Position(x,y-1))) {
qx.add(x);
qy.add(y-1);
}
}
return covered;
}
public static void main(String[] args) throws IOException{
BufferedReader f = new BufferedReader(new FileReader("multimoo.in"));
N = Integer.parseInt(f.readLine());
grid = new int[N][N];
for(int i = 0; i < N; i ++) {
StringTokenizer st = new StringTokenizer(f.readLine());
for(int j = 0 ; j < N; j ++) {
grid[i][j] = Integer.parseInt(st.nextToken());
}
}
f.close();
int maxID = 0;
int maxCount = 0;
List<Segement> pieceList = new ArrayList<>();
for(int i = 0; i < N; i ++) {
for(int j = 0; j < N; j ++) {
Segement s = new Segement(grid[i][j]);
if(!visited.contains(new Position(i,j))) {
int id = grid[i][j];
int count = floodFill(i, j,s);
if(count > maxCount) {
maxCount = count;
maxID = id;
}
}
if(s.pieces.size() > 0) {
pieceList.add(s);
}
}
}
int LSize = 0;
for(Segement s:pieceList) {
System.out.println(s.pieces);
}
for(int i = 0; i < N; i ++) {
Segement p = pieceList.get(i);
for(Position pos:p.pieces) {
int x = pos.x;
int y = pos.y;
int color= grid[x][y];
Set<Position> check = new HashSet<Position>();
if(x-1 >= 0 && x-1 < N && y < N && y >= 0 && grid[x-1][y] != color&& !visited.contains(new Position(x-1,y))) {
check.add(new Position(x-1,y));
}
if(x+1 >= 0 && x+1 < N && y < N && y >= 0 && grid[x+1][y] != color&& !visited.contains(new Position(x+1,y))) {
check.add(new Position(x+1,y));
}
if(x >= 0 && x < N && y +1 < N && y+1 >= 0 && grid[x][y+1] != color&& !visited.contains(new Position(x,y+1))) {
check.add(new Position(x,y+1));
}
if(x >= 0 && x < N && y-1 < N && y-1 >= 0 && grid[x][y-1] != color && !visited.contains(new Position(x,y-1))) {
check.add(new Position(x,y-1));
}
for(int j = 0; j < pieceList.size(); j ++) {
if(i==j) {
continue;
}
Set<Position> checked = new HashSet<>(check);
checked.retainAll(pieceList.get(j).pieces);
if(checked.size() > 0) {
int size = pieceList.get(j).pieces.size() + pieceList.get(i).pieces.size();
System.out.println("1: "+i+" "+j+" "+size);
System.out.println("2: "+pieceList.get(i).id+" "+pieceList.get(j).id+" "+size);
if(size>LSize) {
LSize = size;
}
}
checked.clear();
checked = null;
}
}
}
PrintWriter pw = new PrintWriter(new BufferedWriter(new FileWriter("multimoo.out")));
System.out.println("Max Count "+maxCount+" (obtained with id "+maxID+")");
System.out.println("Max Count team up "+LSize);
pw.println(maxCount);
pw.println(LSize);
pw.close();
}
}
class Position{
int x,y;
//boolean perimeter = false;
public Position(int x,int y){
this.x = x;
this.y = y;
}
@Override
public boolean equals(Object s) {
if(s instanceof Position) {
Position p = (Position) s;
return ((p.y == this.y) && (p.x == this.x));
}
return false;
}
@Override
public int hashCode() {
return ((Integer.hashCode(this.x) -7)*(Integer.hashCode(this.y)-5));
}
public String toString() {
return "("+this.x+","+this.y+")";
}
}
class Segement{
public Set<Position> pieces;
public int id;
public Segement(int id) {
this.id = id;
this.pieces = new HashSet<>();
}
}
You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.