結果
問題 | No.1097 Remainder Operation |
ユーザー |
![]() |
提出日時 | 2020-06-26 21:32:35 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 216 ms / 2,000 ms |
コード長 | 2,707 bytes |
コンパイル時間 | 2,069 ms |
コンパイル使用メモリ | 202,980 KB |
最終ジャッジ日時 | 2025-01-11 10:53:24 |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 21 |
ソースコード
#include <bits/stdc++.h>using namespace std;using int64 = long long;const int mod = (int) (1e9 + 7);// const int mod = 998244353;const int64 infll = (1LL << 60) - 1;const int inf = (1 << 30) - 1;struct IoSetup {IoSetup() {cin.tie(nullptr);ios::sync_with_stdio(false);cout << fixed << setprecision(10);cerr << fixed << setprecision(10);}} iosetup;template< typename T1, typename T2 >ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {os << p.first << " " << p.second;return os;}template< typename T1, typename T2 >istream &operator>>(istream &is, pair< T1, T2 > &p) {is >> p.first >> p.second;return is;}template< typename T >ostream &operator<<(ostream &os, const vector< T > &v) {for(int i = 0; i < (int) v.size(); i++) {os << v[i] << (i + 1 != v.size() ? " " : "");}return os;}template< typename T >istream &operator>>(istream &is, vector< T > &v) {for(T &in : v) is >> in;return is;}template< typename T1, typename T2 >inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }template< typename T1, typename T2 >inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }template< typename T = int64 >vector< T > make_v(size_t a) {return vector< T >(a);}template< typename T, typename... Ts >auto make_v(size_t a, Ts... ts) {return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));}template< typename T, typename V >typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {t = v;}template< typename T, typename V >typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {for(auto &e : t) fill_v(e, v);}template< typename F >struct FixPoint : F {FixPoint(F &&f) : F(forward< F >(f)) {}template< typename... Args >decltype(auto) operator()(Args &&... args) const {return F::operator()(*this, forward< Args >(args)...);}};template< typename F >inline decltype(auto) MFP(F &&f) {return FixPoint< F >{forward< F >(f)};}int main() {int N;cin >> N;vector< int > A(N);cin >> A;auto nxt = make_v< int >(45, N);auto sum = make_v< int64 >(45, N);for(int j = 0; j < N; j++) {nxt[0][j] = (j + A[j]) % N;sum[0][j] = A[j];}for(int i = 0; i + 1 < 45; i++) {for(int j = 0; j < N; j++) {nxt[i + 1][j] = nxt[i][nxt[i][j]];sum[i + 1][j] = sum[i][j] + sum[i][nxt[i][j]];}}int Q;cin >> Q;while(Q--) {int64 K;cin >> K;int64 ret = 0, now = 0;for(int64 i = 44; i >= 0; i--) {if((K >> i) & 1) {ret += sum[i][now];now = nxt[i][now];}}cout << ret << "\n";}}