結果

問題 No.610 区間賞(Section Award)
ユーザー yuya178yuya178
提出日時 2017-12-10 00:18:46
言語 Java21
(openjdk 21)
結果
AC  
実行時間 360 ms / 2,000 ms
コード長 4,068 bytes
コンパイル時間 3,367 ms
コンパイル使用メモリ 86,548 KB
実行使用メモリ 61,392 KB
最終ジャッジ日時 2024-11-30 05:51:45
合計ジャッジ時間 9,130 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
50,452 KB
testcase_01 AC 54 ms
50,060 KB
testcase_02 AC 54 ms
49,860 KB
testcase_03 AC 54 ms
50,060 KB
testcase_04 AC 54 ms
50,004 KB
testcase_05 AC 54 ms
50,360 KB
testcase_06 AC 55 ms
50,176 KB
testcase_07 AC 59 ms
50,336 KB
testcase_08 AC 58 ms
49,936 KB
testcase_09 AC 57 ms
50,240 KB
testcase_10 AC 57 ms
50,048 KB
testcase_11 AC 57 ms
50,136 KB
testcase_12 AC 56 ms
50,404 KB
testcase_13 AC 58 ms
50,388 KB
testcase_14 AC 57 ms
50,276 KB
testcase_15 AC 57 ms
50,360 KB
testcase_16 AC 57 ms
50,492 KB
testcase_17 AC 57 ms
50,436 KB
testcase_18 AC 58 ms
49,992 KB
testcase_19 AC 87 ms
51,424 KB
testcase_20 AC 108 ms
51,708 KB
testcase_21 AC 80 ms
50,504 KB
testcase_22 AC 102 ms
51,528 KB
testcase_23 AC 67 ms
50,304 KB
testcase_24 AC 86 ms
51,116 KB
testcase_25 AC 62 ms
50,360 KB
testcase_26 AC 95 ms
51,448 KB
testcase_27 AC 106 ms
51,668 KB
testcase_28 AC 104 ms
51,636 KB
testcase_29 AC 102 ms
51,256 KB
testcase_30 AC 106 ms
51,704 KB
testcase_31 AC 92 ms
51,520 KB
testcase_32 AC 106 ms
51,772 KB
testcase_33 AC 80 ms
50,364 KB
testcase_34 AC 106 ms
51,644 KB
testcase_35 AC 95 ms
51,640 KB
testcase_36 AC 107 ms
51,680 KB
testcase_37 AC 105 ms
51,644 KB
testcase_38 AC 85 ms
51,344 KB
testcase_39 AC 108 ms
51,528 KB
testcase_40 AC 109 ms
51,736 KB
testcase_41 AC 108 ms
51,512 KB
testcase_42 AC 108 ms
51,960 KB
testcase_43 AC 106 ms
51,560 KB
testcase_44 AC 339 ms
59,468 KB
testcase_45 AC 360 ms
61,392 KB
testcase_46 AC 347 ms
61,324 KB
testcase_47 AC 106 ms
51,624 KB
testcase_48 AC 104 ms
51,504 KB
testcase_49 AC 105 ms
52,024 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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)); }
 
}
0