# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
984354 | Malix | Intercastellar (JOI22_ho_t1) | C++14 | 65 ms | 106576 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>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef vector<ll> lli;
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define MP make_pair
ll INF=1e18+10;
ll M=1e9+7;
ll MI(ll a){
for(ll i=1;i<M+1;i++)if((a*i)%M==1)return i;
}
int main() {
//ios::sync_with_stdio(0);
//cin.tie(0);
freopen("test_input.txt", "r", stdin);
freopen("test_output.txt", "w", stdout);
int n;cin>>n;
lli a(n);
REP(i,0,n)cin>>a[i];
int m;cin>>m;
lli b(m);
REP(i,0,m)cin>>b[i];
lli c(n);
REP(i,0,n)c[i]=(ll)((a[i])&(-a[i]));
lli d(n);
d[0]=c[0];
REP(i,1,n)d[i]=d[i-1]+c[i];
REP(i,0,m){
int k=lower_bound(d.begin(),d.end(),b[i])-d.begin();
cout<<a[k]/c[k]<<"\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... |