제출 #734772

#제출 시각아이디문제언어결과실행 시간메모리
734772rahidilbayramliIntercastellar (JOI22_ho_t1)C++17
100 / 100
497 ms10388 KiB
#include<bits/stdc++.h> #define ll long long #define vl vector<ll> #define sl set<ll> #define all(v) v.begin(), v.end() #define pb push_back #define s second #define f first #define pll pair<ll, ll> #define pii pair<int, int> using namespace std; int main() { ll n, i, k, p, x, q; cin >> n; vl v(n); for(ll&h : v) cin >> h; vector<pair<ll, ll>>v1; for(i = 0; i < n; i++) { p = v[i]; k = 1; while(p % 2 == 0) { p /= 2; k *= 2; } if(v1.empty()) v1.pb({k, p}); else v1.pb({k+v1.back().f, p}); } cin >> q; while(q--) { cin >> x; cout << (*lower_bound(all(v1), pair<ll, ll>{x, 0})).s << "\n"; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...