結果

問題 No.230 Splarraay ｽﾌﾟﾗﾚｪｰｲ
ユーザー yuya178yuya178
提出日時 2017-12-21 12:10:05
言語 Java21
(openjdk 21)
結果
AC  
実行時間 687 ms / 5,000 ms
コード長 6,137 bytes
コンパイル時間 2,740 ms
コンパイル使用メモリ 79,492 KB
実行使用メモリ 139,096 KB
最終ジャッジ日時 2023-08-22 20:41:24
合計ジャッジ時間 13,409 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge14
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 258 ms
103,556 KB
testcase_01 AC 266 ms
102,036 KB
testcase_02 AC 260 ms
101,696 KB
testcase_03 AC 258 ms
101,852 KB
testcase_04 AC 260 ms
101,696 KB
testcase_05 AC 318 ms
104,060 KB
testcase_06 AC 374 ms
120,912 KB
testcase_07 AC 310 ms
103,536 KB
testcase_08 AC 321 ms
103,656 KB
testcase_09 AC 510 ms
134,412 KB
testcase_10 AC 459 ms
132,508 KB
testcase_11 AC 460 ms
134,716 KB
testcase_12 AC 518 ms
132,520 KB
testcase_13 AC 378 ms
120,612 KB
testcase_14 AC 453 ms
131,764 KB
testcase_15 AC 523 ms
133,028 KB
testcase_16 AC 602 ms
134,472 KB
testcase_17 AC 687 ms
134,656 KB
testcase_18 AC 556 ms
139,096 KB
testcase_19 AC 595 ms
135,216 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 q = ni();
        LazySegmentTree seg = new LazySegmentTree();
        long x = 0;
        long y = 0;
        for(int i = 0; i < q; i++){
            int t = ni();
            int l = ni();
            int r = ni();
            if(t==1){
                seg.update(l,r+1,1);
            }
            if(t==2){
                seg.update(l,r+1,-1);
            }
            if(t==0){
                long[] res = seg.query(l,r+1);
                if(res[0] > res[1]) x+=res[0];
                if(res[0] < res[1]) y+=res[1];
                // out.println(x+" "+y);
            }
        }
        for(int i = 0; i < n; i++){
            long[] res = seg.query(i,i+1);
            x+=res[0];
            y+=res[1];
            // out.println(res[0]+" "+res[1]);
        }
        out.println(x+" "+y);
    }

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