Submission #1003995

#TimeUsernameProblemLanguageResultExecution timeMemory
1003995CSQ31Intercastellar (JOI22_ho_t1)C++17
100 / 100
49 ms9408 KiB
#pragma GCC optimize("Ofast") #include<bits/stdc++.h> using namespace std; #define pb push_back #define fi first #define se second #define sz(a) (int)(a.size()) #define all(a) a.begin(),a.end() #define lb lower_bound #define ub upper_bound #define owo ios_base::sync_with_stdio(0);cin.tie(0); #define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr) #define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\ debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC)) typedef long long int ll; typedef long double ld; typedef pair<ll,ll> PII; typedef pair<int,int> pii; typedef vector<vector<int>> vii; typedef vector<vector<ll>> VII; ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);} int main() { owo int n; cin>>n; vector<PII>a; for(int i=0;i<n;i++){ ll x; cin>>x; int z = 1; while(x%2 == 0){ x/=2; z*=2; } a.pb({z,x}); } int q; cin>>q; ll ptr = -1,sum = 0; while(q--){ ll x; cin>>x; while(sum < x){ ptr++; sum+=a[ptr].fi; } cout<<a[ptr].se<<'\n'; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...