#503397 (C++17) No.1097 Remainder Operation

• 問題: No.1097 Remainder Operation
• ユーザー: chocopuu
• 提出日時: 2020-06-26 22:24:05
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 223 ms / 2,000 ms
• コード長: 1,744 bytes
• コンパイル時間: 2,351 ms
• コンパイル使用メモリ: 204,140 KB
• 実行使用メモリ: 7,772 KB
• 最終ジャッジ日時: 2023-09-18 05:44:05
• 合計ジャッジ時間: 7,009 ms
• ジャッジサーバーID （参考情報）: judge15 / judge13

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 4,376 KB
testcase_01	AC	2 ms; 4,384 KB
testcase_02	AC	1 ms; 4,376 KB
testcase_03	AC	1 ms; 4,376 KB
testcase_04	AC	1 ms; 4,380 KB
testcase_05	AC	2 ms; 4,376 KB
testcase_06	AC	2 ms; 4,376 KB
testcase_07	AC	22 ms; 4,376 KB
testcase_08	AC	23 ms; 4,380 KB
testcase_09	AC	23 ms; 4,380 KB
testcase_10	AC	22 ms; 4,380 KB
testcase_11	AC	23 ms; 4,380 KB
testcase_12	AC	217 ms; 6,400 KB
testcase_13	AC	217 ms; 6,404 KB
testcase_14	AC	216 ms; 6,556 KB
testcase_15	AC	212 ms; 6,360 KB
testcase_16	AC	218 ms; 6,528 KB
testcase_17	AC	223 ms; 6,472 KB
testcase_18	AC	211 ms; 7,724 KB
testcase_19	AC	206 ms; 7,716 KB
testcase_20	AC	205 ms; 7,772 KB
testcase_21	AC	208 ms; 7,196 KB
testcase_22	AC	207 ms; 7,224 KB

ソースコード

#include "bits/stdc++.h"
using namespace std;
#define int long long
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define RREP(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define RFOR(i, s, n) for (int i = (int)n - 1; i >= s; --i)
#define ALL(a) a.begin(), a.end()
#define IN(a, x, b) (a <= x && x < b)
template<class T>inline void out(T t){cout << t << "\n";}
template<class T,class... Ts>inline void out(T t,Ts... ts){cout << t << " ";out(ts...);}
template<class T>inline bool CHMIN(T&a,T b){if(a > b){a = b;return true;}return false;}
template<class T>inline bool CHMAX(T&a,T b){if(a < b){a = b;return true;}return false;}
constexpr int INF = 1e18;




signed main(){
	int N;
	cin >> N;
	vector<int>a(N);
	REP(i,N){
		cin >> a[i];
	}
	vector<int>to(N);
	REP(i,N){
		to[i] = (i + a[i]) % N;
	}
	int s = -1;
	vector<int>visit(N);
	vector<int>sum = {0};
	auto dfs = [&](auto&&f,int now) -> void {
		++visit[now];
		if(visit[now] == 3){
			s = now;
			return;
		}
		f(f,(now + a[now]) % N);
	};
	dfs(dfs,0);
	int loopstart = s;
	vector<int>loopsum = {0};
	do{
		loopsum.emplace_back(loopsum.back() + a[s]);
		s = (s + a[s]) % N;
	}while(visit[s] != 3);
	s = 0;
	while(visit[s] == 1){
		sum.emplace_back(sum.back() + a[s]);
		s = to[s];
	}
	//REP(i,sum.size())cout << sum[i] << " \n"[i+1 == sum.size()];
	int Q;
	cin >> Q;
	vector<int>ans;
	int loopsize = loopsum.size() - 1;
	while(Q--){
		int K;
		cin >> K;
		if(K < sum.size()){
			ans.emplace_back(sum[K]);
		}else{
			int tmp = sum.back();
			K -= sum.size() - 1;
			tmp += K / (loopsum.size() - 1) * loopsum.back();
			tmp += loopsum[K % (loopsum.size() - 1)];
			ans.emplace_back(tmp);
		}
	}
	for(auto &e:ans)cout << e << endl;
}