結果
問題 | No.1097 Remainder Operation |
ユーザー |
![]() |
提出日時 | 2020-06-26 22:24:05 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 297 ms / 2,000 ms |
コード長 | 1,744 bytes |
コンパイル時間 | 2,950 ms |
コンパイル使用メモリ | 197,032 KB |
最終ジャッジ日時 | 2025-01-11 11:46:25 |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 21 |
ソースコード
#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;}