結果

問題 No.1097 Remainder Operation
ユーザー kissshot7kissshot7
提出日時 2020-07-13 11:13:05
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 163 ms / 2,000 ms
コード長 3,443 bytes
コンパイル時間 1,882 ms
コンパイル使用メモリ 172,708 KB
実行使用メモリ 12,048 KB
最終ジャッジ日時 2024-11-07 06:42:38
合計ジャッジ時間 6,940 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 6 ms
8,320 KB
testcase_01 AC 5 ms
8,320 KB
testcase_02 AC 6 ms
8,448 KB
testcase_03 AC 6 ms
8,192 KB
testcase_04 AC 6 ms
8,192 KB
testcase_05 AC 6 ms
8,320 KB
testcase_06 AC 5 ms
8,320 KB
testcase_07 AC 21 ms
8,448 KB
testcase_08 AC 20 ms
8,448 KB
testcase_09 AC 20 ms
8,704 KB
testcase_10 AC 21 ms
8,576 KB
testcase_11 AC 21 ms
8,576 KB
testcase_12 AC 159 ms
9,600 KB
testcase_13 AC 160 ms
9,728 KB
testcase_14 AC 156 ms
9,728 KB
testcase_15 AC 155 ms
9,856 KB
testcase_16 AC 157 ms
9,728 KB
testcase_17 AC 160 ms
9,728 KB
testcase_18 AC 160 ms
12,048 KB
testcase_19 AC 159 ms
11,408 KB
testcase_20 AC 157 ms
11,280 KB
testcase_21 AC 162 ms
11,668 KB
testcase_22 AC 163 ms
11,660 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);
//typedef vector<vector<ll>> mat;
typedef vector<int> vec;

//繰り返し二乗法
ll mod_pow(ll a, ll n, ll m) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%m;
		a = a * a%m; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

//逆元(Eucledean algorithm)
ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
using mP = pair<modint, modint>;

int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };


ll memo[100005];

void solve() {
    int N; cin >> N;
    vector<ll> a(N);
    rep(i, N) cin >> a[i];
    int Q; cin >> Q;
    vector<ll> q(Q);
	rep(i, Q) cin >> q[i];
    memset(memo, -1, sizeof(memo));
    vector<ll> v;
    int cnt = 0, cur = 0;
	int l = 0, r = 0;
	while(1){
		if(memo[cur] != -1){
			l = memo[cur];
			r = cnt;
			break;
		}
		v.push_back(a[cur]);
		memo[cur] = cnt;
		cur = (cur+a[cur])%N;
		cnt++;
	}
	vector<ll> s(r, 0);
	rep(i, r){
		if(i == 0) s[0] = v[0];
		else s[i] = s[i-1] + v[i];
	}
	vector<ll> ss(r-l+1, 0);
	Rep(i, l, r){
		// if(i == l) ss[i-l] = v[l];
		// else ss[i-l] = ss[i-l-1] + v[i];
		ss[i-l+1] = ss[i-l] + v[i];
	}
	rep(i, Q){
		if(q[i] <= r){
			cout << s[q[i]-1] << endl;
		}else{
			ll tmp = q[i]-r;
			cout << s[r-1] + (tmp/(r-l))*ss[r-l] + ss[(tmp%(r-l))] << endl;
		}
	}
}

signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  //cout << fixed << setprecision(10);
  //init_f();
  //init();
  //int t; cin >> t; rep(i, t)solve();
  solve();
//   stop
    return 0;
}
0