ParentingPartneringReturns.java

/*
Problem Link - https://codingcompetitions.withgoogle.com/codejam/round/000000000019fd27/000000000020bdf9
*/

importjava.util.*;

classtimeimplementsComparable<time>{
intstart;
intend;
time(ints, inte){
start = s;
end = e;
 }

publicintcompareTo(timet){
if(this.start == t.start) return0;
elseif(this.start > t.start) return1;
elsereturn -1;
 }
}

classSolution{
publicstaticvoidmain(Stringargs[]){
Scanners = newScanner(System.in);
intt = s.nextInt();
for(inti=0;i<t;i++){
intn = s.nextInt();
ArrayList<time> l = newArrayList<time>();
HashMap<String, ArrayList<Integer>> indexMap = newHashMap<String,ArrayList<Integer>>();

for(intj=0;j<n;j++){
intss = s.nextInt();
inte = s.nextInt();
timetm = newtime(ss,e);
l.add(tm);
Stringkey = ss+"|"+e;
ArrayList<Integer> val = indexMap.getOrDefault(key,newArrayList<Integer>());
val.add(j);
indexMap.put(key,val);
 }
Collections.sort(l);

intltej = Integer.MIN_VALUE;
intltec = Integer.MIN_VALUE;

charres[] = newchar[n];
intcnt = 0;

for(intj=0;j<n;j++){
timetm = l.get(j);
Stringkey = tm.start+"|"+tm.end;
ArrayList<Integer> index = indexMap.get(key);
intind = index.get(0);
index.remove(0);
indexMap.put(key,index);

if(ltej <= tm.start){
res[ind] = 'J';

ltej = tm.end;
cnt++;
 }
elseif(ltec <= tm.start){
res[ind] = 'C';

ltec = tm.end;
cnt++;
 }
else{
break;
 }
 }

if(cnt != n) System.out.println("Case #"+(i+1)+": IMPOSSIBLE");
elseSystem.out.println("Case #"+(i+1)+": " + String.valueOf(res));

 }
 }

}