結果
問題 | No.1097 Remainder Operation |
ユーザー |
![]() |
提出日時 | 2020-06-26 21:43:06 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 244 ms / 2,000 ms |
コード長 | 2,980 bytes |
コンパイル時間 | 1,584 ms |
コンパイル使用メモリ | 175,192 KB |
実行使用メモリ | 71,296 KB |
最終ジャッジ日時 | 2024-07-04 20:24:14 |
合計ジャッジ時間 | 5,129 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 21 |
ソースコード
#include <bits/stdc++.h>using namespace std;#pragma region Macrostypedef long long ll;#define FOR(i,a,b) for (int i=(a);i<(b);++i)#define REP(i,n) FOR(i,0,n)#define ALL(x) (x).begin(),(x).end()const long long MOD=1e9+7;// const long long MOD=998244353;const int INF=1e9;const long long IINF=1e18;const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};const char dir[4]={'D','R','U','L'};#define LOCALtemplate<typename T>istream &operator>>(istream &is,vector<T> &v){for (T &x:v) is >> x;return is;}template<typename T>ostream &operator<<(ostream &os,const vector<T> &v){for (int i=0;i<v.size();++i){os << v[i] << (i+1==v.size()?"": " ");}return os;}template<typename T,typename U>ostream &operator<<(ostream &os,const pair<T,U> &p){cout << '(' << p.first << ',' << p.second << ')';return os;}template<typename T,typename U>ostream &operator<<(ostream &os,const map<T,U> &m){os << '{';for (auto itr=m.begin();itr!=m.end();++itr){os << '(' << itr->first << ',' << itr->second << ')';if (++itr!=m.end()) os << ',';--itr;}os << '}';return os;}template<typename T>ostream &operator<<(ostream &os,const set<T> &s){os << '{';for (auto itr=s.begin();itr!=s.end();++itr){os << *itr;if (++itr!=s.end()) os << ',';--itr;}os << '}';return os;}void debug_out(){cerr << '\n';}template<class Head,class... Tail>void debug_out(Head&& head,Tail&&... tail){cerr << head;if (sizeof...(Tail)>0) cerr << ", ";debug_out(move(tail)...);}#ifdef LOCAL#define debug(...) cerr << " ";\cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n';\cerr << " ";\debug_out(__VA_ARGS__)#else#define debug(...) 42#endiftemplate<typename T> T gcd(T x,T y){return y!=0?gcd(y,x%y):x;}template<typename T> T lcm(T x,T y){return x/gcd(x,y)*y;}template<class T1,class T2> inline bool chmin(T1 &a,T2 b){if (a>b){a=b; return true;} return false;}template<class T1,class T2> inline bool chmax(T1 &a,T2 b){if (a<b){a=b; return true;} return false;}#pragma endregionconst int MAX_LOG=42;int main(){cin.tie(0);ios::sync_with_stdio(false);int N; cin >> N;vector<ll> A(N); cin >> A;vector<vector<pair<int,ll>>> doubling(MAX_LOG,vector<pair<int,ll>>(N));for (int i=0;i<N;++i){int nxt=i+A[i];doubling[0][i]={nxt%N,nxt/N};}for (int i=0;i<MAX_LOG-1;++i){for (int j=0;j<N;++j){auto p=doubling[i][doubling[i][j].first];doubling[i+1][j]={p.first,p.second+doubling[i][j].second};}}int Q; cin >> Q;for (;Q--;){ll K; cin >> K;int now=0; ll ans=0;for (int i=MAX_LOG-1;i>=0;--i){if (K&1LL<<i){auto p=doubling[i][now];ans+=p.second; now=p.first;}}cout << ans*N+now << '\n';}}