結果

問題 No.318 学学学学学
ユーザー yuya178yuya178
提出日時 2017-12-21 10:52:58
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,237 ms / 2,000 ms
コード長 6,010 bytes
コンパイル時間 2,901 ms
コンパイル使用メモリ 78,980 KB
実行使用メモリ 168,904 KB
最終ジャッジ日時 2023-09-04 20:58:10
合計ジャッジ時間 26,502 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 603 ms
136,444 KB
testcase_01 AC 646 ms
161,304 KB
testcase_02 AC 741 ms
165,636 KB
testcase_03 AC 655 ms
135,232 KB
testcase_04 AC 684 ms
163,104 KB
testcase_05 AC 1,237 ms
168,808 KB
testcase_06 AC 1,084 ms
145,836 KB
testcase_07 AC 966 ms
140,744 KB
testcase_08 AC 885 ms
165,748 KB
testcase_09 AC 791 ms
156,104 KB
testcase_10 AC 663 ms
133,448 KB
testcase_11 AC 1,216 ms
168,904 KB
testcase_12 AC 1,069 ms
160,804 KB
testcase_13 AC 859 ms
141,716 KB
testcase_14 AC 822 ms
165,880 KB
testcase_15 AC 753 ms
158,084 KB
testcase_16 AC 657 ms
133,580 KB
testcase_17 AC 918 ms
159,316 KB
testcase_18 AC 858 ms
158,716 KB
testcase_19 AC 906 ms
158,620 KB
testcase_20 AC 629 ms
131,500 KB
testcase_21 AC 399 ms
135,084 KB
testcase_22 AC 400 ms
135,036 KB
testcase_23 AC 398 ms
135,184 KB
testcase_24 AC 400 ms
135,108 KB
testcase_25 AC 404 ms
135,156 KB
testcase_26 AC 401 ms
135,192 KB
testcase_27 AC 398 ms
135,104 KB
testcase_28 AC 399 ms
135,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];
        for(int i = 0; i < n; i++){
            a[i] = ni();
        }
        HashMap<Integer, Integer> first = new HashMap<>();
        HashMap<Integer, Integer> last = new HashMap<>();
        Set<Integer> set = new TreeSet<>();
        for(int i = 0; i < n; i++){
            last.put(a[i],i);
            set.add(a[i]);
        }
        for(int i = n-1; i >= 0; i--){
            first.put(a[i],i);
        }
        LazySegmentTree seg = new LazySegmentTree();
        for(int t : set){
            int left = first.get(t);
            int right = last.get(t);
            seg.add(left,right+1,t);
        }
        for(int i = 0; i < n; i++){
            out.print(seg.query(i,i+1)+" ");
        }
        

    }

   class LazySegmentTree {
        int SIZE = 1 << 20;
        long[][] seg;
        LazySegmentTree() {
            this.seg = new long[2 * SIZE][2];
            for(int i=0;i<2*SIZE;++i){
                seg[i][0] = 0;
                seg[i][1] = 0;
            }
        }
        // void update(int x, long value) {
        //     x += SIZE - 1;
        //     this.seg[x][0] += value;
        //     while (x > 0) {
        //         x = (x - 1) / 2;
        //         this.seg[x][0] = this.seg[2 * x + 1][0] + this.seg[2 * x + 2][0];
        //     }
        // }
        long comb(long a, long b){
            return Math.min(a,b);
        }
        long query(int a,int b,int l,int r,int k){
            eval(l,r,k);
            if(a<=l&&r<=b) return seg[k][0];
            if(b<=l||r<=a) return inf;
            long ans1=query(a,b,l,(l+r)/2,2*k+1);
            long ans2=query(a,b,(l+r)/2,r,2*k+2);
            return comb(ans1,ans2);
        }
        long query(int l, int r) {
            return query(l,r,0,SIZE,0);
        }
        void eval(int l, int r, int k){
            if(this.seg[k][1]!=0){
                this.seg[k][0] = this.seg[k][1];
                if(r-l>1){
                    this.seg[2*k+1][1] = this.seg[k][1];
                    this.seg[2*k+2][1] = this.seg[k][1];
                }
                this.seg[k][1] = 0;
            }
        }
        void add(int a, int b, long x, int l, int r, int k){
            eval(l,r,k);
            if(b<=l||r<=a) return;
            if(a<=l&&r<=b){
                this.seg[k][1] = x;
                eval(l,r,k);
            }
            else{
                add(a,b,x,l,(l+r)/2,2*k+1);
                add(a,b,x,(l+r)/2,r,2*k+2);
                this.seg[k][0] = comb(this.seg[2*k+1][0],this.seg[2*k+2][0]);
            }
        }
        void add(int a, int b, long x){
            add(a, b, x, 0, SIZE, 0);
        }
    }
    
    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