結果

問題 No.1097 Remainder Operation
ユーザー ゆにぽけゆにぽけ
提出日時 2023-10-06 10:00:22
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 37 ms / 2,000 ms
コード長 3,418 bytes
コンパイル時間 1,366 ms
コンパイル使用メモリ 128,140 KB
実行使用メモリ 5,384 KB
最終ジャッジ日時 2023-10-06 10:00:29
合計ジャッジ時間 4,008 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 2 ms
4,376 KB
testcase_03 AC 1 ms
4,380 KB
testcase_04 AC 1 ms
4,376 KB
testcase_05 AC 2 ms
4,380 KB
testcase_06 AC 1 ms
4,384 KB
testcase_07 AC 5 ms
4,380 KB
testcase_08 AC 5 ms
4,380 KB
testcase_09 AC 5 ms
4,376 KB
testcase_10 AC 5 ms
4,380 KB
testcase_11 AC 5 ms
4,380 KB
testcase_12 AC 36 ms
4,384 KB
testcase_13 AC 36 ms
4,412 KB
testcase_14 AC 36 ms
4,376 KB
testcase_15 AC 37 ms
4,380 KB
testcase_16 AC 36 ms
4,376 KB
testcase_17 AC 37 ms
4,380 KB
testcase_18 AC 35 ms
5,240 KB
testcase_19 AC 35 ms
5,384 KB
testcase_20 AC 36 ms
5,276 KB
testcase_21 AC 35 ms
5,356 KB
testcase_22 AC 35 ms
5,224 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cassert>
#include<cmath>
#include<ctime>
#include<iomanip>
#include<numeric>
#include<stack>
#include<queue>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<bitset>
#include<random>
using namespace std;
template<int m> struct modint
{
	private:
	unsigned int value;
	static constexpr int mod() {return m;}

	public:
	constexpr modint(const long long x = 0) noexcept
	{
		long long y = x;
		if(y < 0 || y >= mod())
		{
			y %= mod();
			if(y < 0) y += mod();
		}
		value = (unsigned int)y;
	}
	constexpr unsigned int val() noexcept {return value;}
	constexpr modint &operator+=(const modint &other) noexcept
	{
		value += other.value;
		if(value >= mod()) value -= mod();
		return *this;
	}
	constexpr modint &operator-=(const modint &other) noexcept
	{
		unsigned int x = value;
		if(x < other.value) x += mod();
		x -= other.value;
		value = x;
		return *this;
	}
	constexpr modint &operator*=(const modint &other) noexcept
	{
		unsigned long long x = value;
		x *= other.value;
		value = (unsigned int) (x % mod());
		return *this;
	}
	constexpr modint &operator/=(const modint &other) noexcept
	{
		return *this *= other.inverse();
	}
	constexpr modint inverse() const noexcept
	{
		assert(value);
		long long a = value,b = mod(),x = 1,y = 0;
		while(b)
		{
			long long q = a/b;
			a -= q*b; swap(a,b);
			x -= q*y; swap(x,y);
		}
		return modint(x);
	}
	constexpr modint power(long long N) const noexcept
	{
		assert(N >= 0);
		modint p = *this,ret = 1;
		while(N)
		{
			if(N & 1) ret *= p;
			p *= p;
			N >>= 1;
		}
		return ret;
	}
	constexpr modint operator+() {return *this;}
	constexpr modint operator-() {return modint() - *this;}
	constexpr modint &operator++(int) noexcept {return *this += 1;}
	constexpr modint &operator--(int) noexcept {return *this -= 1;}
	friend modint operator+(const modint& lhs, const modint& rhs) {return modint(lhs) += rhs;}
	friend modint operator-(const modint& lhs, const modint& rhs) {return modint(lhs) -= rhs;}
	friend modint operator*(const modint& lhs, const modint& rhs) {return modint(lhs) *= rhs;}
	friend modint operator/(const modint& lhs, const modint& rhs) {return modint(lhs) /= rhs;}
	friend ostream &operator<<(ostream &os,const modint &x) {return os << x.value;}
};
using mint = modint<998244353>;
//using mint = modint<1000000007>;
int N,seen[1 << 17],A[1 << 17];
long long SP[1 << 17],SC[1 << 17];
void solve()
{
	cin >> N;
	for(int i = 0;i < N;i++) cin >> A[i];
	int cur = 0;
	vector<int> path;
	path.reserve(N);
	int s = -1;
	while(true)
	{
		if(seen[cur])
		{
			s = cur;
			break;
		}
		seen[cur] = 1;
		path.push_back(cur);
		cur = (cur+A[cur])%N;
	}

	vector<int> cycle;
	cycle.reserve(N);
	while(path.back() != s) cycle.push_back(path.back()),path.pop_back();
	path.pop_back();
	cycle.push_back(s);
	reverse(cycle.begin(),cycle.end());

	int P = (int)path.size(),C = (int)cycle.size();
	for(int i = 0;i < P;i++) SP[i+1] = SP[i] + A[path[i]];
	for(int i = 0;i < C;i++) SC[i+1] = SC[i] + A[cycle[i]];

	int Q;
	cin >> Q;
	while(Q--)
	{
		long long K;
		cin >> K;

		if(K <= P) cout << SP[K] << "\n";
		else
		{
			long long res = SP[P];
			K -= P;
			res += K/C*SC[C];
			res += SC[K%C];

			cout << res << "\n";
		}
	}
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int T = 1;
	//cin >> T;
	while(T--) solve();
}
0