[백준] 27589 Streets Ahead - Data Structure / Java

• 문제 링크

https://www.acmicpc.net/problem/27589

 

• 풀이 코드

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.HashMap;
import java.util.Map;
import java.util.StringTokenizer;

public class Main {

    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        StringBuilder sb = new StringBuilder();

        StringTokenizer st = new StringTokenizer(br.readLine());
        int n = Integer.parseInt(st.nextToken()), q = Integer.parseInt(st.nextToken());

        Map<String, Integer> map = new HashMap<>();
        while (n-- > 0) map.put(br.readLine(), n);

        while (q-- > 0) {
            st = new StringTokenizer(br.readLine());
            sb.append(Math.abs(map.get(st.nextToken()) - map.get(st.nextToken())) - 1).append("\n");
        }

        bw.write(sb.toString());
        bw.flush();
    }

}