14864 - 줄서기 (수학, 애드혹)

Author: zeesouth

README.md

@@ -118,6 +118,7 @@
 - <a href="https://www.acmicpc.net/problem/18225">18225. 당구공을 넣자</a>
 - <a href="https://www.acmicpc.net/problem/2142">2142. 정돈된 배열</a>
 - <a href="https://www.acmicpc.net/problem/22964">22964. conv1d</a>
+- <a href="https://www.acmicpc.net/problem/14864">14864. 줄서기</a>
 </pre>
 </div>
 </details>

src/math/n14864/Main.java

@@ -0,0 +1,43 @@
+package math.n14864;
+
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+    static StringTokenizer st;
+    static int N, M;
+
+    public static void main(String[] args) throws Exception {
+        st = new StringTokenizer(br.readLine());
+        N = Integer.parseInt(st.nextToken());
+        M = Integer.parseInt(st.nextToken());
+
+
+        int[] arr = new int[N + 1];
+        for (int i = 1; i <= N; i++) arr[i] = i;
+
+        int x, y;
+        for (int i = 0; i < M; i++) {
+            st = new StringTokenizer(br.readLine());
+            x = Integer.parseInt(st.nextToken());
+            y = Integer.parseInt(st.nextToken());
+            arr[x]++;
+            arr[y]--;
+        }
+
+        boolean[] visited = new boolean[N + 1];
+        for (int i = 1; i <= N; i++) {
+            if (visited[arr[i]]) {
+                System.out.println(-1);
+                return;
+            }
+            visited[arr[i]] = true;
+        }
+
+        StringBuilder sb = new StringBuilder();
+        for (int i = 1; i <= N; i++) sb.append(arr[i]).append(" ");
+
+        System.out.println(sb);
+    }
+}