fork(2) download
copy 
  1.  
  2.  
  3. import java.io.BufferedReader;
  4. import java.io.IOException;
  5. import java.io.InputStreamReader;
  6. import java.util.ArrayList;
  7. import java.util.Arrays;
  8. import java.util.Stack;
  9.  
  10. public class Main {
  11.  
  12.  
  13. 	static ArrayList<Integer> [] arr;  
  14. 	static int visited [];
  15. 	static Stack<Integer> a = new Stack<Integer>();
  16. 	static boolean flag=false;
  17.  
  18. 	public static void graphcheck(int node){  //method to check if there is a cycle in the graph
  19. 		visited[node] = 2;
  20. 		for(int i=0;i<arr[node].size();i++){
  21. 			int u =arr[node].get(i);
  22. 			if(visited[u]==0){
  23. 				graphcheck(u);
  24. 			}else if(visited[u]==2){
  25. 					flag=true;
  26. 					return;	
  27. 				}
  28. 		}
  29. 		visited[node] = 1;
  30. 	}
  31.  
  32. 	public static void dfs2(int node){            //method to get one possible topological sort which I want to extend to get all posibilites
  33. 		visited[node] = 1;
  34. 		for(int i=0;i<arr[node].size();i++){
  35. 			int u =arr[node].get(i);
  36. 			if(visited[u]==0){
  37. 				dfs2(u);
  38. 			}	
  39. 		}
  40. 		a.push(node);
  41. 	}
  42.  
  43. 	public static void main(String[] args) throws NumberFormatException, IOException {
  44. 		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
  45. 		int tc = Integer.parseInt(br.readLine());
  46. 		for(int k=0;k<tc;k++){
  47. 			br.readLine();
  48.  
  49. 			String h[]= br.readLine().split(" ");
  50. 			int n= h.length;
  51. 			arr=new ArrayList[n];
  52. 			visited = new int[n];
  53. 			for( int i = 0; i < n; i++) {
  54. 			    arr[ i] = new ArrayList<Integer>();
  55. 			}
  56. 			String q[]=br.readLine().split(" ");
  57. 			int y=q.length;
  58. 			for(int i=0;i<y;i++){
  59. 				int x=0;
  60. 				int z=0;
  61. 				for(int j=0;j<n;j++){
  62. 					if(q[i].charAt(0)==h[j].charAt(0)){
  63. 						x=j;
  64. 					}else if(q[i].charAt(2)==h[j].charAt(0)){
  65. 						z=j;
  66. 					}
  67. 				}
  68. 				if(q[i].charAt(1)=='<'){
  69. //					System.out.println(q[i].charAt(0)-'A'+"  "+(q[i].charAt(2)-'A'));
  70. 					arr[x].add(z);
  71. 				}
  72. 			}
  73. 			for(int i=0;i<n;i++){
  74. 				if(visited[i]==0)
  75. 					graphcheck(i);
  76. 			}
  77. 			if(flag){
  78. 				System.out.println("NO");
  79. 			}else{
  80. 			a.clear();
  81. 			Arrays.fill(visited, 0);
  82. 			for(int i=0;i<n;i++){
  83. 				if(visited[i]==0){
  84. 					dfs2(i);
  85. 				}	
  86. 			}
  87. 			int z= a.size();
  88. 			for(int i=0;i<z;i++){
  89. 				int x =a.pop();
  90. 				System.out.print(h[x]+" ");
  91. 			}
  92. 			System.out.println();
  93. 		}
  94.  
  95.  
  96. 	}
  97. 	}
  98. }
  99.  
Success #stdin #stdout 0.07s 380160KB
comments (?)
stdin
copy 
2

A B F G
A<B B<F

A B C
A<B B<A
stdout
copy 
G A B F 
NO
https://ideone.com/IiQxiu
language:
Java (HotSpot 12)
created:
10 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!