結果
問題 | No.610 区間賞(Section Award) |
ユーザー | yuya178 |
提出日時 | 2017-12-10 00:18:46 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 335 ms / 2,000 ms |
コード長 | 4,068 bytes |
コンパイル時間 | 2,270 ms |
コンパイル使用メモリ | 84,036 KB |
実行使用メモリ | 61,440 KB |
最終ジャッジ日時 | 2023-08-20 05:35:38 |
合計ジャッジ時間 | 8,242 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 40 ms
49,548 KB |
testcase_01 | AC | 41 ms
49,536 KB |
testcase_02 | AC | 42 ms
49,616 KB |
testcase_03 | AC | 43 ms
49,948 KB |
testcase_04 | AC | 42 ms
49,532 KB |
testcase_05 | AC | 47 ms
49,548 KB |
testcase_06 | AC | 43 ms
49,644 KB |
testcase_07 | AC | 42 ms
49,536 KB |
testcase_08 | AC | 42 ms
49,712 KB |
testcase_09 | AC | 41 ms
49,572 KB |
testcase_10 | AC | 43 ms
49,808 KB |
testcase_11 | AC | 43 ms
49,572 KB |
testcase_12 | AC | 46 ms
49,572 KB |
testcase_13 | AC | 44 ms
49,488 KB |
testcase_14 | AC | 45 ms
49,876 KB |
testcase_15 | AC | 44 ms
49,572 KB |
testcase_16 | AC | 45 ms
49,676 KB |
testcase_17 | AC | 43 ms
49,496 KB |
testcase_18 | AC | 42 ms
49,936 KB |
testcase_19 | AC | 62 ms
52,312 KB |
testcase_20 | AC | 90 ms
52,316 KB |
testcase_21 | AC | 59 ms
51,304 KB |
testcase_22 | AC | 85 ms
52,676 KB |
testcase_23 | AC | 53 ms
50,796 KB |
testcase_24 | AC | 72 ms
51,948 KB |
testcase_25 | AC | 51 ms
49,508 KB |
testcase_26 | AC | 84 ms
52,084 KB |
testcase_27 | AC | 89 ms
52,364 KB |
testcase_28 | AC | 90 ms
50,508 KB |
testcase_29 | AC | 86 ms
52,388 KB |
testcase_30 | AC | 87 ms
52,392 KB |
testcase_31 | AC | 80 ms
52,448 KB |
testcase_32 | AC | 89 ms
52,600 KB |
testcase_33 | AC | 61 ms
51,380 KB |
testcase_34 | AC | 82 ms
52,108 KB |
testcase_35 | AC | 82 ms
52,300 KB |
testcase_36 | AC | 89 ms
52,204 KB |
testcase_37 | AC | 93 ms
52,088 KB |
testcase_38 | AC | 63 ms
52,352 KB |
testcase_39 | AC | 87 ms
52,260 KB |
testcase_40 | AC | 81 ms
52,308 KB |
testcase_41 | AC | 81 ms
52,584 KB |
testcase_42 | AC | 85 ms
52,368 KB |
testcase_43 | AC | 92 ms
52,708 KB |
testcase_44 | AC | 269 ms
58,792 KB |
testcase_45 | AC | 335 ms
61,440 KB |
testcase_46 | AC | 326 ms
61,028 KB |
testcase_47 | AC | 78 ms
52,304 KB |
testcase_48 | AC | 79 ms
52,368 KB |
testcase_49 | AC | 79 ms
52,504 KB |
ソースコード
import java.io.*; import java.util.*; import java.math.*; // import java.awt.Point; public class Main { InputStream is; PrintWriter out; String INPUT = ""; long MOD = 1_000_000_007; int inf = Integer.MAX_VALUE; void solve(){ int n = ni(); int[] a = new int[n]; int[] b = new int[n]; for(int i = 0; i < n; i++){ a[i] = ni()-1; } for(int i = 0; i < n; i++){ b[i] = ni()-1; } int s = n-1; boolean[] seen = new boolean[n]; PriorityQueue<Integer> pq = new PriorityQueue<Integer>(); for(int i = n-1; i >= 0; i--){ if(seen[a[i]]) continue; pq.add(a[i]+1); // out.println(a[i]+1); seen[a[i]] = true; while(s>=0){ seen[b[s]] = true; if(b[s]==a[i]) break; s--; } } while(!pq.isEmpty()){ out.println(pq.poll()); } } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); } public static void main(String[] args) throws Exception { new Main().run(); } private byte[] inbuf = new byte[1024]; private int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b) && b != ' ')){ sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private int ni() { int num = 0, b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }