結果
問題 | No.1097 Remainder Operation |
ユーザー |
👑 ![]() |
提出日時 | 2020-06-26 21:40:07 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 298 ms / 2,000 ms |
コード長 | 3,591 bytes |
コンパイル時間 | 2,588 ms |
コンパイル使用メモリ | 202,748 KB |
最終ジャッジ日時 | 2025-01-11 11:05:11 |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 21 |
ソースコード
//#define _GLIBCXX_DEBUG#include<bits/stdc++.h>using namespace std;#define endl '\n'#define lfs cout<<fixed<<setprecision(10)#define ALL(a) (a).begin(),(a).end()#define ALLR(a) (a).rbegin(),(a).rend()#define spa << " " <<#define fi first#define se second#define MP make_pair#define MT make_tuple#define PB push_back#define EB emplace_back#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)using ll = long long;using ld = long double;const ll MOD1 = 1e9+7;const ll MOD9 = 998244353;const ll INF = 1e18;using P = pair<ll, ll>;template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}template<typename T>void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};template<typename T>void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;}//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());template<typename T>struct Doubling{const ll LOG = 40;vector< vector< T > > table;ll sz;Doubling(ll sz):sz(sz){table.assign(LOG, vector< T >(sz, -1));}void set_next(ll k, T x){table[0][k] = x;}void build(){for(ll k = 0; k + 1 < LOG; k++) {for(ll i = 0; i < table[k].size(); i++) {if(table[k][i] == -1) table[k + 1][i] = -1;else table[k + 1][i] = table[k][i]+table[k][(i+table[k][i])%sz];}}}ll query1(ll k, ll t)//tにたどり着く最小手数を求める{ll ret = 1;for(ll i = LOG - 1; i >= 0; i--){if(table[i][k] != -1 && table[i][k] < t){ret += 1 << i;k = table[i][k];}}if(table[0][k] >= t)return ret;else return -1;}ll query2(ll k, ll t)//t個先の要素を求める{ll now=k;for(ll i = LOG - 1; i >= 0; i--) {//cout<<i spa now<<endl;if((t >> i) & 1){now += table[i][now%sz];}}return now;}};int main(){cin.tie(nullptr);ios_base::sync_with_stdio(false);ll res=0,buf=0;bool judge = true;ll n;cin>>n;vector<ll>a(n);rep(i,0,n)cin>>a[i];Doubling<ll> db(n);rep(i,0,n)db.set_next(i,a[i]);db.build();//debug(db.table,db.LOG,n);ll q;cin>>q;while(q--){ll k;cin>>k;cout<<db.query2(0,k)<<endl;;}return 0;}