Register
|
Login
Home
News
Competitions
Practice
How to
Rankings
Calendar
Arena
CodeFu 2010
CodeFu'10 Highlights
Jazoon'10 Highlights
Schedule
Rules
Prizes
Results
Competitions
»
Main CodeFu Competitons
»
CodeFu 2010
»
Results
CodeFu 2010 Results
Final Round Results
digitalis's solution for 200: TrainRoute, written in Java, submitted on 09.05.2010 11:49:06
import java.util.HashMap; import java.util.Map; import java.util.Scanner; public class TrainRoute { /** * @param args */ public static String findActualSchedule(String plannedSchedule, String updates) { Scanner sc =new Scanner(plannedSchedule); Map<String,String> mapa =new HashMap(); String red[]=new String[25]; sc.useDelimiter(""); int i=0; while(sc.hasNext()) { String stan=sc.next(); red[i]=stan; i++; StringBuffer sb =new StringBuffer(); sc.next(); sb.append(sc.next()); sb.append(sc.next()); sb.append(sc.next()); sb.append(sc.next()); sb.append(sc.next()); if(sc.hasNext()) sc.next(); mapa.put(stan, sb.toString()); System.out.println(mapa.toString()); } sc=new Scanner(updates); sc.useDelimiter(""); while (sc.hasNext()) { String stan=sc.next(); StringBuffer sb =new StringBuffer(); sc.next(); sb.append(sc.next()); sb.append(sc.next()); sb.append(sc.next()); sb.append(sc.next()); sb.append(sc.next()); if(sc.hasNext()) sc.next(); mapa.put(stan, sb.toString()); } StringBuffer bf=new StringBuffer(); for (int j=0;j<i;j++) { bf.append(red[j]); bf.append(" "); bf.append(mapa.get(red[j])); bf.append(" "); } bf.deleteCharAt(bf.length()-1); return bf.toString(); } }