-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcolour.java
More file actions
146 lines (138 loc) · 3.22 KB
/
colour.java
File metadata and controls
146 lines (138 loc) · 3.22 KB
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
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.BufferedOutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.OutputStream;
import java.util.*;
public class colour{
public static int N;
public static int adj[][];
public static int x[];
public static int m;
public static void main(String []args){
Scanner scan=new Scanner(System.in);
ArrayList<Integer> arr=new ArrayList<Integer>();
N=Integer.parseInt(scan.nextLine());
adj=new int[N][N];
x=new int[N];
for(int i=0;i<N;i++){
adj[i][i]=1;
String s[]=scan.nextLine().split(" ");
for(int j=0;j<s.length;j++){
int k=Integer.parseInt(s[j]);
adj[i][k]=1;
}
}
// for(int i=0;i<N;i++){
// for(int j=0;j<N;j++){
// System.out.print(adj[i][j]+" ");
// }
// System.out.println();
// }
for(m=2;m<=N;m++){
x[0]=1;
colour_it(0);
if(!iszero(x)){
for(int j=0;j<N;j++){
if(!arr.contains(x[j])){
arr.add(x[j]);
}
}
System.out.println(arr.size());
return;
}
}
}
public static boolean iszero(int k[]){
for(int i=0;i<k.length;i++){
if(k[i]==0){
return true;
}
}
return false;
}
public static boolean colour_it(int k){
if(k==x.length){
return true;
}
if(x[k]!=0){
return colour_it(k+1);
}
for(int c=1;c<=m;c++){
if(worth_it(k,c)){
x[k]=c;
if(colour_it(k+1)){
return true;
}
x[k]=0;
}
}
return false;
}
public static boolean worth_it(int k,int c){
for(int i=0;i<N;i++){
if(adj[k][i]==1){
if(c==x[i]){
return false;
}
}
}
return true;
}
public static void toString(String a[]){
for(int i=0;i<a.length;i++){
System.out.print(a[i]+" ");
}
System.out.println();
}
}
class Kattio extends PrintWriter {
public Kattio(InputStream i) {
super(new BufferedOutputStream(System.out));
r = new BufferedReader(new InputStreamReader(i));
}
public Kattio(InputStream i, OutputStream o) {
super(new BufferedOutputStream(o));
r = new BufferedReader(new InputStreamReader(i));
}
public boolean hasMoreTokens() {
return peekToken() != null;
}
public int getInt() {
return Integer.parseInt(nextToken());
}
public double getDouble() {
return Double.parseDouble(nextToken());
}
public long getLong() {
return Long.parseLong(nextToken());
}
public String getWord() {
return nextToken();
}
private BufferedReader r;
private String line;
private StringTokenizer st;
private String token;
private String peekToken() {
if (token == null)
try {
while (st == null || !st.hasMoreTokens()) {
line = r.readLine();
if (line == null) return null;
st = new StringTokenizer(line);
}
token = st.nextToken();
} catch (IOException e) { }
return token;
}
private String nextToken() {
String ans = peekToken();
token = null;
return ans;
}
}
//I learned how to solve this porblem from one of the youtube video from CSBREAKDOWN