結果

問題 No.1097 Remainder Operation
ユーザー ywmt
提出日時 2020-06-26 22:10:34
言語 Java
(openjdk 23)
結果
AC  
実行時間 1,321 ms / 2,000 ms
コード長 4,056 bytes
コンパイル時間 2,184 ms
コンパイル使用メモリ 84,284 KB
実行使用メモリ 77,932 KB
最終ジャッジ日時 2024-07-04 21:30:24
合計ジャッジ時間 19,423 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 21
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
public class Main {
    static PrintWriter out;
    static InputReader ir;
    static void solve() {
        int n = ir.nextInt();
        long[] a = ir.nextLongArray(n);
        int q = ir.nextInt();
        long[] b = new long[n];
        for (int i = 0; i < n; i++) {
            b[i] = (a[i] + i) % n;
        }
        int[] f = new int[n];
        Arrays.fill(f, -1);
        int cur = 0;
        f[cur] = 0;
        int l = -1;
        long t = -1;
        long[] sum = new long[n];
        sum[cur] = a[0];
        while (true) {
            if (f[(int) b[cur]] >= 0) {
                t = f[cur] - f[(int) b[cur]] + 1;
                l = (int) b[cur];
                break;
            }
            f[(int) b[cur]] = f[cur] + 1;
            sum[(int) f[(int) b[cur]]] = sum[(int) f[cur]] + a[(int) b[cur]];
            cur = (int) b[cur];
        }
        tr(t, l);
        while (q-- > 0) {
            long k = ir.nextLong() - 1;
            if (k <= f[l]) {
                out.println(sum[(int) k]);
            } else {
                long res = sum[(int) f[l]];
                tr(res);
                k -= f[l];
                res += (sum[(int) (f[l] + t - 1)] - (f[l] == 0 ? 0 : sum[(int) f[l] - 1])) * (k / t);
                tr(sum[(int) (f[l] + t - 1)] - (f[l] == 0 ? 0 : sum[(int) f[l] - 1]));
                k %= t;
                res += sum[f[l] + (int) k] - sum[f[l]];
                out.println(res);
            }
        }
    }
    public static void main(String[] args) {
        ir = new InputReader(System.in);
        out = new PrintWriter(System.out);
        solve();
        out.flush();
    }
    static class InputReader {
        private InputStream in;
        private byte[] buffer = new byte[1024];
        private int curbuf;
        private int lenbuf;
        public InputReader(InputStream in) {
            this.in = in;
            this.curbuf = this.lenbuf = 0;
        }
        public boolean hasNextByte() {
            if (curbuf >= lenbuf) {
                curbuf = 0;
                try {
                    lenbuf = in.read(buffer);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (lenbuf <= 0)
                    return false;
            }
            return true;
        }
        private int readByte() {
            if (hasNextByte())
                return buffer[curbuf++];
            else
                return -1;
        }
        private boolean isSpaceChar(int c) {
            return !(c >= 33 && c <= 126);
        }
        private void skip() {
            while (hasNextByte() && isSpaceChar(buffer[curbuf]))
                curbuf++;
        }
        public boolean hasNext() {
            skip();
            return hasNextByte();
        }
        public String next() {
            if (!hasNext())
                throw new NoSuchElementException();
            StringBuilder sb = new StringBuilder();
            int b = readByte();
            while (!isSpaceChar(b)) {
                sb.appendCodePoint(b);
                b = readByte();
            }
            return sb.toString();
        }
        public int nextInt() {
            if (!hasNext())
                throw new NoSuchElementException();
            int c = readByte();
            while (isSpaceChar(c))
                c = readByte();
            boolean minus = false;
            if (c == '-') {
                minus = true;
                c = readByte();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res = res * 10 + c - '0';
                c = readByte();
            } while (!isSpaceChar(c));
            return (minus) ? -res : res;
        }
        public long nextLong() {
            if (!hasNext())
                throw new NoSuchElementException();
            int c = readByte();
            while (isSpaceChar(c))
                c = readByte();
            boolean minus = false;
            if (c == '-') {
                minus = true;
                c = readByte();
            }
            long res = 0;
            do {
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                res = res * 10 + c - '0';
                c = readByte();
            } while (!isSpaceChar(c));
            return (minus) ? -res : res;
        }
        public double nextDouble() {
            return Double.parseDouble(next());
        }
        public int[] nextIntArray(int n) {
            int[] a = new int[n];
            for (int i = 0; i < n; i++)
                a[i] = nextInt();
            return a;
        }
        public long[] nextLongArray(int n) {
            long[] a = new long[n];
            for (int i = 0; i < n; i++)
                a[i] = nextLong();
            return a;
        }
        public char[][] nextCharMap(int n, int m) {
            char[][] map = new char[n][m];
            for (int i = 0; i < n; i++)
                map[i] = next().toCharArray();
            return map;
        }
    }
    static void tr(Object... o) {
        System.err.println(Arrays.deepToString(o));
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0