Pagini recente » Cod sursa (job #1899229) | Cod sursa (job #2825857) | Cod sursa (job #86532) | Cod sursa (job #3350247) | Cod sursa (job #3354609)
import java.io.*;
import java.util.*;
class MyScanner1 {
private BufferedReader br;
private StringTokenizer st;
public MyScanner1(Reader reader) {
br = new BufferedReader(reader);
}
public String next() {
while (st == null || !st.hasMoreElements()) {
try {
st = new StringTokenizer(br.readLine());
} catch (IOException e) {
e.printStackTrace();
}
}
return st.nextToken();
}
public int nextInt() {
return Integer.parseInt(next());
}
public long nextLong() {
return Long.parseLong(next());
}
public double nextDouble() {
return Double.parseDouble(next());
}
public String nextLine() {
String str = "";
try {
str = br.readLine();
} catch (IOException e) {
e.printStackTrace();
}
return str;
}
}
public class Main {
public static void main(String[] args) throws IOException {
MyScanner1 scanner = new MyScanner1(new FileReader("bfs.in"));
int n, m, s;
n = scanner.nextInt();
m = scanner.nextInt();
s = scanner.nextInt();
ArrayList<Integer>[] graph = new ArrayList[n + 1];
int[] distance = new int[n + 1];
Arrays.fill(distance, -1);
for (int i = 1; i <= n; i++)
graph[i] = new ArrayList<>();
for (int i = 1; i <= m; i++)
{
int a = scanner.nextInt();
int b = scanner.nextInt();
graph[a].add(b);
}
Queue<Integer> q = new ArrayDeque<>();
q.add(s);
distance[s] = 0;
while (!q.isEmpty())
{
int node = q.poll();
for (Integer adj : graph[node])
{
if (distance[adj] == -1)
{
distance[adj] = distance[node] + 1;
q.add(adj);
}
}
}
try (BufferedWriter writer = new BufferedWriter(new FileWriter("bfs.out"))) {
StringBuilder sb = new StringBuilder();
for (int i = 1; i <= n; i++) {
sb.append(distance[i]);
sb.append(" ");
if (i % 10000 == 0)
{
writer.append(sb.toString());
sb.setLength(0);
}
}
if (sb.length() > 0)
writer.write(sb.toString());
}
}
}