Pagini recente » Cod sursa (job #3162641) | Cod sursa (job #3286851) | Rating Dordai Raul (rauld) | Poliție | Cod sursa (job #2238839)
import static java.lang.Character.isDigit;
import static java.util.Objects.requireNonNull;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
import java.util.StringTokenizer;
public final class Main {
public static final String IN_FILE = "dfs.in";
public static final String OUT_FILE = "dfs.out";
public static final class FastScanner implements AutoCloseable {
private static final int BUFFER_SIZE = 1 << 16;
private final DataInputStream stream;
private final byte[] buffer = new byte[BUFFER_SIZE];
private int bufferPointer = 0;
private int bytesRead = 0;
public FastScanner(final String fileName) throws IOException {
stream = new DataInputStream(new FileInputStream(fileName));
}
public int nextInt() throws IOException {
byte c;
do {
c = read();
} while (c != '-' && !isDigit(c));
final boolean isNegative = c == '-';
if (isNegative) {
c = read();
}
int value = 0;
do {
value = value * 10 + (c - '0');
c = read();
} while (isDigit(c));
return isNegative ? -value : value;
}
private byte read() throws IOException {
final byte c = tryRead();
if (c == -1) {
throw new IOException("Reached end of stream!");
}
return c;
}
private byte tryRead() throws IOException {
if (bufferPointer == bytesRead) {
bufferPointer = 0;
bytesRead = stream.read(buffer, 0, BUFFER_SIZE);
if (bytesRead == -1) {
bytesRead = 0;
return -1;
}
}
return buffer[bufferPointer++];
}
@Override
public void close() throws IOException {
stream.close();
}
}
public static void dfs(
final int[][] graph, final int u, final boolean[] visited) {
visited[u] = true;
for (final int v : graph[u]) {
if (!visited[v]) {
dfs(graph, v, visited);
}
}
}
public static int countComponents(final int[][] graph) {
final boolean[] visited = new boolean[graph.length];
int components = 0;
for (int u = 0; u < graph.length; u++) {
if (!visited[u]) {
components++;
dfs(graph, u, visited);
}
}
return components;
}
public static int[][] readGraph(final FastScanner scanner)
throws IOException {
final int size = scanner.nextInt();
final int edgeCount = scanner.nextInt();
final int[] eu = new int[edgeCount];
final int[] ev = new int[edgeCount];
final int[] degrees = new int[size];
for (int e = 0; e < edgeCount; e++) {
eu[e] = scanner.nextInt() - 1;
ev[e] = scanner.nextInt() - 1;
degrees[eu[e]]++;
degrees[ev[e]]++;
}
final int[][] graph = new int[size][];
for (int u = 0; u < size; u++) {
graph[u] = new int[degrees[u]];
}
for (int e = 0; e < edgeCount; e++) {
final int u = eu[e];
final int v = ev[e];
graph[u][degrees[u] - 1] = v;
graph[v][degrees[v] - 1] = u;
degrees[u]--;
degrees[v]--;
}
return graph;
}
public static void main(final String[] args) throws IOException {
try (final FastScanner scanner = new FastScanner(IN_FILE);
final PrintWriter writer = new PrintWriter(OUT_FILE)) {
final int[][] graph = readGraph(scanner);
final int components = countComponents(graph);
writer.println(components);
}
}
}