#503387 (D) No.1097 Remainder Operation

• 問題: No.1097 Remainder Operation
• ユーザー: daut-dlang
• 提出日時: 2020-06-26 22:21:43
• 言語: D (dmd 2.106.1)
• 結果: AC
• 実行時間: 1,548 ms / 2,000 ms
• コード長: 2,509 bytes
• コンパイル時間: 701 ms
• コンパイル使用メモリ: 121,380 KB
• 実行使用メモリ: 241,888 KB
• 最終ジャッジ日時: 2024-06-22 07:32:08
• 合計ジャッジ時間: 17,322 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,812 KB
testcase_01	AC	1 ms; 6,940 KB
testcase_02	AC	2 ms; 6,940 KB
testcase_03	AC	2 ms; 6,940 KB
testcase_04	AC	2 ms; 6,940 KB
testcase_05	AC	2 ms; 6,940 KB
testcase_06	AC	1 ms; 6,944 KB
testcase_07	AC	91 ms; 27,464 KB
testcase_08	AC	88 ms; 28,040 KB
testcase_09	AC	87 ms; 27,876 KB
testcase_10	AC	85 ms; 27,572 KB
testcase_11	AC	88 ms; 28,840 KB
testcase_12	AC	1,406 ms; 241,192 KB
testcase_13	AC	1,299 ms; 241,580 KB
testcase_14	AC	1,291 ms; 241,700 KB
testcase_15	AC	1,367 ms; 241,352 KB
testcase_16	AC	1,277 ms; 241,356 KB
testcase_17	AC	1,067 ms; 241,888 KB
testcase_18	AC	1,238 ms; 241,256 KB
testcase_19	AC	1,134 ms; 241,188 KB
testcase_20	AC	1,161 ms; 241,752 KB
testcase_21	AC	1,548 ms; 241,184 KB
testcase_22	AC	1,492 ms; 240,968 KB

ソースコード

import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; }
T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; }
T[] RDA(T = long)(T fix = 0) { if (_f.isOpen)  return _RDA!T(_f, fix); else return _RDA!T(fix); }

size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); }
bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); }

long mod = 10^^9 + 7;
//long mod = 998_244_353;
//long mod = 1_000_003;
void moda(T)(ref T x, T y) { x = (x + y) % mod; }
void mods(T)(ref T x, T y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(T)(ref T x, T y) { x = (x * y) % mod; }
void modpow(T)(ref T x, T y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); }
void modd(T)(ref T x, T y) { y.modpow(mod - 2); x.modm(y); }

void main()
{
	auto N = RD;
	auto A = RDA;

	auto arr = new long[][][](N, 40, 2);
	foreach (i; 0..N)
	{
		arr[i][0] = [A[i], (i+A[i])%N];
	}
	foreach (j; 1..40)
	{
		foreach (i; 0..N)
		{
			auto p = arr[i][j-1][1];
			arr[i][j][0] = arr[i][j-1][0] + arr[p][j-1][0];
			arr[i][j][1] = arr[p][j-1][1];
		}
	}

	auto Q = RD;
	auto K = new long[](Q);
	auto ans = new long[](Q);
	foreach (i; 0..Q)
	{
		K[i] = RD;
	}
	foreach (i; 0..Q)
	{
		long p;
		foreach (j; 0..40)
		{
			auto bit = 1L << j;
			if (K[i] & bit)
			{
				ans[i] += arr[p][j][0];
				debug writeln("ans:", ans[i]);
				p = arr[p][j][1];
			}
		}
	}

	foreach (e; ans)
		writeln(e);
	stdout.flush;
	debug readln;
}