結果

問題 No.3164 [Chery 7th Tune B] La vie en rose
コンテスト
ユーザー tenten
提出日時 2025-06-05 15:03:15
言語 Java
(openjdk 23)
結果
WA  
実行時間 -
コード長 4,463 bytes
コンパイル時間 2,525 ms
コンパイル使用メモリ 86,880 KB
実行使用メモリ 80,764 KB
最終ジャッジ日時 2025-06-05 15:03:40
合計ジャッジ時間 24,666 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 3 WA * 31
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;
import java.util.function.*;
import java.util.stream.*;
import java.math.*;

public class Main {
    public static void main(String[] args) throws Exception {
        FastScanner sc = new FastScanner();
        int n = sc.nextInt();
        int[] values = new int[n + 2];
        UnionFindTree uft = new UnionFindTree(n + 2);
        for (int i = 1; i <= n; i++) {
            values[i] = sc.nextInt();
            uft.add(i, values[i]);
        }
        int q = sc.nextInt();
        String result = IntStream.range(0, q).mapToObj(a -> {
            int idx = sc.nextInt();
            int count = sc.nextInt();
            int ans;
            if (uft.getCount(idx) == 0) {
                ans = uft.getCount(idx - 1) + uft.getCount(idx + 1) + count;
            } else {
                ans = uft.getCount(idx) + count - values[idx];
            }
            return String.valueOf(ans);
        }).collect(Collectors.joining("\n"));
        System.out.println(result);
    }
    
    static class UnionFindTree {
        int[] counts;
        int[] parents;
        
        public UnionFindTree(int size) {
            parents = IntStream.range(0, size).toArray();
            counts = new int[size];
        }
        
        public int find(int x) {
            return x == parents[x] ? x : (parents[x] = find(parents[x]));
        }
        
        public void add(int idx, int v) {
            counts[idx] = v;
            if (v > 0 && getCount(idx - 1) > 0) {
                unite(idx - 1, idx);
            }
        }
        
        public void unite(int x, int y) {
            int xx = find(x);
            int yy = find(y);
            if (xx != yy) {
                parents[yy] = xx;
                counts[xx] += counts[yy];
            }
        }
        
        public int getCount(int x) {
            return counts[find(x)];
        }
    }
}

class FastScanner {
    private DataInputStream din;
    private byte[] buffer;
    private int bufferPointer, bytesRead;
    private static final int BUFFER_SIZE = 1 << 16; // 65,536 バイト

    public FastScanner() {
        din = new DataInputStream(System.in);
        buffer = new byte[BUFFER_SIZE];
        bufferPointer = bytesRead = 0;
    }

    private byte read() {
        try {
            if (bufferPointer == bytesRead) {
                bytesRead = din.read(buffer, 0, BUFFER_SIZE);
                if (bytesRead == -1) return -1;
                bufferPointer = 0;
            }
            return buffer[bufferPointer++];
        } catch (IOException e) {
            throw new RuntimeException(e);
        }
    }

    public String next() {
        byte b = read();
        // 空白文字を読み飛ばす
        while (isSpaceChar(b)) {
            b = read();
        }
        StringBuilder sb = new StringBuilder();
        while (!isSpaceChar(b)) {
            sb.append((char) b);
            b = read();
        }
        return sb.toString();
    }

    public int nextInt() {
        int ret = 0;
        byte c = read();
        while (isSpaceChar(c)) c = read();
        boolean neg = (c == '-');
        if (neg) c = read();
        do {
            ret = ret * 10 + c - '0';
            c = read();
        } while (!isSpaceChar(c));
        return neg ? -ret : ret;
    }

    public long nextLong() {
        long ret = 0;
        byte c = read();
        while (isSpaceChar(c)) c = read();
        boolean neg = (c == '-');
        if (neg) c = read();
        do {
            ret = ret * 10L + c - '0';
            c = read();
        } while (!isSpaceChar(c));
        return neg ? -ret : ret;
    }

    public double nextDouble() {
        double ret = 0, div = 1;
        byte c = read();
        while (isSpaceChar(c)) c = read();
        boolean neg = (c == '-');
        if (neg) c = read();
        do {
            ret = ret * 10 + c - '0';
            c = read();
        } while (!isSpaceChar(c) && c != '.');
        if (c == '.') {
            while (!isSpaceChar(c = read())) {
                ret += (c - '0') / (div *= 10);
            }
        }
        return neg ? -ret : ret;
    }

    private boolean isSpaceChar(byte c) {
        return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
    }

    public void close() {
        try {
            if (din != null) din.close();
        } catch (IOException e) {
            throw new RuntimeException(e);
        }
    }
}
0