結果
問題 | No.1194 Replace |
ユーザー | tenten |
提出日時 | 2023-06-21 16:43:53 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,856 bytes |
コンパイル時間 | 2,807 ms |
コンパイル使用メモリ | 92,692 KB |
実行使用メモリ | 118,232 KB |
最終ジャッジ日時 | 2024-06-29 02:27:46 |
合計ジャッジ時間 | 36,697 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | AC | 1,917 ms
118,016 KB |
testcase_08 | AC | 1,871 ms
118,232 KB |
testcase_09 | AC | 1,997 ms
117,596 KB |
testcase_10 | AC | 1,921 ms
117,880 KB |
testcase_11 | AC | 1,971 ms
117,720 KB |
testcase_12 | AC | 1,873 ms
117,672 KB |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | AC | 54 ms
37,236 KB |
testcase_21 | AC | 54 ms
37,232 KB |
testcase_22 | AC | 55 ms
36,896 KB |
testcase_23 | WA | - |
testcase_24 | AC | 298 ms
50,672 KB |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | AC | 149 ms
41,924 KB |
ソースコード
import java.io.*; import java.util.*; import java.util.stream.*; public class Main { static ArrayList<ArrayList<Integer>> graph = new ArrayList<>(); static int[] values; static int[] orgs; public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); int m = sc.nextInt(); int[] lefts = new int[m]; int[] rights = new int[m]; TreeMap<Integer, Integer> compress = new TreeMap<>(); long ans = n * (n + 1L) / 2; for (int i = 0; i < m; i++) { lefts[i] = sc.nextInt(); rights[i] = sc.nextInt(); compress.put(lefts[i], null); compress.put(rights[i], null); } int size = compress.size(); orgs = new int[size]; int idx = 0; for (int x : compress.keySet()) { ans -= x; compress.put(x, idx); orgs[idx] = x; idx++; } values = new int[size]; Arrays.fill(values, -1); for (int i = 0; i < size; i++) { graph.add(new ArrayList<>()); } for (int i = 0; i < m; i++) { graph.get(compress.get(lefts[i])).add(compress.get(rights[i])); } for (int i = 0; i < size; i++) { ans += check(i); } System.out.println(ans); } static int check(int x) { if (values[x] < 0) { values[x] = orgs[x]; for (int y : graph.get(x)) { values[x] = Math.max(values[x], check(y)); } } return values[x]; } } class Utilities { static String arrayToLineString(Object[] arr) { return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n")); } static String arrayToLineString(int[] arr) { return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new)); } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public int[] nextIntArray() throws Exception { return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray(); } public String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }