-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathJoinStrings.java
More file actions
148 lines (120 loc) · 3.7 KB
/
JoinStrings.java
File metadata and controls
148 lines (120 loc) · 3.7 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
147
148
import java.io.BufferedReader;
import java.io.BufferedOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.util.*;
public class JoinStrings {
static void getOutput(int key,HashMap<Integer,ArrayList<Integer>> hashmap,ArrayList<String> list, ArrayList<String> outputList) {
if (hashmap.get(key).size() == 1) {
int index = hashmap.get(key).get(0);
// System.out.println("tihs is idndex: " + list.get(index - 1));
outputList.add(list.get(index-1));
} else {
int idx = hashmap.get(key).get(0);
// System.out.println("this is idx : " + list.get(idx -1));
outputList.add(list.get(idx - 1));
for (int i = 1; i < hashmap.get(key).size() ; i ++) {
int nextKey = hashmap.get(key).get(i);
getOutput(nextKey,hashmap,list,outputList);
}
}
}
public static void main(String[] args) {
FastIO fio = new FastIO();
ArrayList<String> strings = new ArrayList<String>();
HashSet h = new HashSet();
int n = fio.nextInt();
HashMap<Integer,ArrayList<Integer>> map = new HashMap<Integer,ArrayList<Integer>>();
for (int i = 0; i < n ; i++) {
String string = fio.nextLine();
strings.add(string);
h.add(i+1);
}
for ( int x = 1; x <= n ; x ++ ) {
int key = x;
map.put(x, new ArrayList<Integer>());
map.get(key).add(x);
}
for ( int y = 1; y < n ; y++) {
int a = fio.nextInt();
int b = fio.nextInt();
map.get(a).add(b);
h.remove(b);
}
int initialKey = 0;
for (int q = 1 ; q < n ; q ++) {
if (h.contains(q)){
initialKey = q;
break;
}
}
ArrayList<String> output = new ArrayList<String>();
getOutput(initialKey,map,strings,output);
for ( int k = 0; k < output.size() ; k ++) {
fio.print(output.get(k));
}
// for(int x = 0; x < strings.size(); x++) {
// if (!(strings.get(x).equals(""))) {
// fio.println(strings.get(x));
// }
// }
fio.close();
}
}
/**
* Fast I/O
* @source https://www.geeksforgeeks.org/fast-io-in-java-in-competitive-programming/
*/
class FastIO extends PrintWriter
{
BufferedReader br;
StringTokenizer st;
public FastIO()
{
super(new BufferedOutputStream(System.out));
br = new BufferedReader(new
InputStreamReader(System.in));
}
String next()
{
while (st == null || !st.hasMoreElements())
{
try
{
st = new StringTokenizer(br.readLine());
}
catch (IOException e)
{
e.printStackTrace();
}
}
return st.nextToken();
}
int nextInt()
{
return Integer.parseInt(next());
}
long nextLong()
{
return Long.parseLong(next());
}
double nextDouble()
{
return Double.parseDouble(next());
}
String nextLine()
{
String str = "";
try
{
str = br.readLine();
}
catch (IOException e)
{
e.printStackTrace();
}
return str;
}
}