Submission #58767

---

Source Code Expand

import java.util.Scanner;

public class Main {

	static boolean[] visited;
	static int n;
	static boolean[][] edge;
	static boolean bCycle = false;

	public static void main(String[] args) {
		doIt();
	}
	//for N = 100, M = 100
	static void doIt(){
		Scanner sc = new Scanner(System.in);
		n = sc.nextInt();
		int m = sc.nextInt();
		edge = new boolean[n][n];
		for(int i = 0; i < n; i++) edge[i][i] = true;
		for(int i = 0; i < m; i++){
			int a = sc.nextInt() - 1;
			int b = sc.nextInt() - 1;
			edge[a][b] = edge[b][a] = !edge[a][b];
			visited = new boolean[n];
			bCycle = false;
			for(int j = 0; j < n; j++) departure(j);
			System.out.println(bCycle? "no" : "yes");
		}



	}
	static void departure(int s){
		if(visited[s] == false){
			visited[s] = true;
			for(int i = 0; i < n; i++){
				if(edge[s][i] == false) search(s, i);
			}
		}
	}
	static void search(int from, int to){
		if(visited[to]){ bCycle = true; return;}
		visited[to] = true;
		for(int i = 0; i < n; i++){
			if(i != from && edge[to][i] == false) search(to, i);
		}
	}

}

Submission Info

Judge Result