Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.Arrays;
- import java.util.HashMap;
- import java.util.Map;
- import java.util.Scanner;
- import java.util.TreeMap;
- public class P_20160228_Events {
- public static void main(String[] args) {
- Scanner scanner = new Scanner(System.in);
- TreeMap<String, HashMap<String, String>> eventsData = new TreeMap<String, HashMap<String, String>>();
- int events = scanner.nextInt();
- scanner.nextLine();
- for (int i = 0; i < events; i++) {
- String[] location = scanner.nextLine().split("\\s+");
- if (location.length != 3 || location[0].charAt(0) != '#'
- || location[0].charAt(location[0].length() - 1) != ':') {
- continue;
- }
- String[] name = location[0].split("[^a-zA-Z]+");
- String[] city = location[1].split("[^a-zA-Z]+");
- String time = location[2];
- if (!eventsData.containsKey(name[1])) {
- eventsData.put(name[1], new HashMap<String, String>());
- eventsData.get(name[1]).put(city[1], time + " ");
- } else if (!eventsData.get(name[1]).containsKey(city[1])) {
- eventsData.get(name[1]).put(city[1], time + " ");
- } else {
- String temp = eventsData.get(name[1]).get(city[1]);
- eventsData.get(name[1]).put(city[1], time + " " + temp);
- }
- }
- String[] requestedTowns = scanner.nextLine().split(",");
- Arrays.sort(requestedTowns);
- for (int i = 0; i < requestedTowns.length; i++) {
- for (String key : eventsData.get().keySet()){
- }
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement