# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1020266 | cpptowin | Intercastellar (JOI22_ho_t1) | C++17 | 48 ms | 7764 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define fo(i,l,r) for(int i = l ;i <= r ; i++)
#define fod(i,r,l) for(int i = r ; i >= l ; i--)
#define int long long
#define pb emplace_back
#define maxn 1000010
#define fi first
#define se second
#define N 1010
#define inf (int)1e18
#define en cout << "\n";
#define all(x) x.begin(),x.end()
#define ss(x) (int)x.size()
#define lb(x) x & -x
#define bit(x,i) ((x >> i) & 1)
#define onbit(x,i) (x | (1ll << i))
#define offbit(x,i) (x ^ (1ll << i))
#define bitcount(x) __builtint_popcountll(x)
#define pii pair<int,int>
#define vi vector<int>
#define vii vector<pii>
using namespace std;
int n,a[maxn];
main()
{
#define name "TASK"
if(fopen(name".inp","r"))
{
freopen(name".inp","r",stdin);
freopen(name".out","w",stdout);
}
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
fo(i,1,n) cin >> a[i];
int q;cin >> q;
int pos = 0,i = 1;
while(q--)
{
int x;
cin >> x;
while(pos < x)
{
int cnt = 1;
while(a[i] % 2 == 0)
{
a[i] /= 2;
cnt *= 2;
}
pos += cnt;
i++;
}
cout << a[i - 1] << "\n";
}
}
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... |