# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1122743 | gdragon | Intercastellar (JOI22_ho_t1) | C++20 | 262 ms | 6100 KiB |
#include <bits/stdc++.h>
using namespace std;
#define TASK "long"
#define fi first
#define se second
#define ll long long
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
#define GETBIT(mask, i) ((mask) >> (i) & 1)
#define MASK(i) ((1LL) << (i))
#define SZ(x) ((int)(x).size())
#define mp make_pair
#define CNTBIT(mask) __builtin_popcount(mask)
template<class X, class Y> bool maximize(X &x, Y y){ if (x < y) {x = y; return true;} return false;};
template<class X, class Y> bool minimize(X &x, Y y){ if (x > y) {x = y; return true;} return false;};
typedef pair<int, int> ii;
const int N = 2e5 + 5;
const int inf = 1e9 + 7;
const long long INF = (long long)1e18 + 7;
const int mod = 1e9 + 7;
void add(int &x, int y) {x += y; if (x >= mod) x -= mod;}
void sub(int &x, int y) {x -= y; if (x < 0) x += mod;}
int mul(int x, int y) {return 1LL * x * y % mod;}
// -----------------------------------------//
struct Fenwick {
int n;
vector<long long> v;
Fenwick(int _n = 0) {
n = _n;
v.assign(n + 2, 0);
}
void update(int x, int c) {
for(; x <= n; x += x & -x) v[x] += c;
}
long long get(int x) {
int ans = 0;
for(; x > 0; x -= x & -x) ans += v[x];
return ans;
}
} fw;
int n, q;
int a[N];
long long pref[N];
void read() {
cin >> n;
for(int i = 1; i <= n; i++) cin >> a[i];
}
void solve() {
fw = Fenwick(n);
for(int i = 1; i <= n; i++) {
int ans = 1;
while(a[i] % 2 == 0) {
a[i] /= 2;
ans *= 2;
}
// fw.update(i, ans);
pref[i] = ans;
}
for(int i = 1; i <= n; i++) pref[i] += pref[i - 1];
cin >> q;
int i = 1;
while(q--) {
long long x; cin >> x;
while(pref[i] < x) ++i;
cout << a[i] << endl;
}
}
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
if (fopen(TASK".inp", "r")) {
freopen(TASK".inp", "r", stdin);
freopen(TASK".out", "w", stdout);
}
int test = 1;
// cin >> test;
while(test--) {
read();
solve();
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |