Submission #702629

#TimeUsernameProblemLanguageResultExecution timeMemory
702629Chal1shkanIntercastellar (JOI22_ho_t1)C++14
35 / 100
18 ms1360 KiB
# include <bits/stdc++.h> # define pb push_back # define ff first # define ss second # define nl "\n" # define sz(x) ((int)(x).size()) # define deb(x) cerr << #x << " = " << x << endl; typedef long long ll; typedef unsigned long long ull; typedef long double ld; const ll maxn = 1e5 + 25; const ll inf = 2e9 + 0; const ll mod = 998244353; const ll dx[] = {-1, 1, 0, 0}; const ll dy[] = {0, 0, -1, 1}; using namespace std; ll n, q, a[maxn]; void ma1n (/* SABR */) { cin >> n; for (ll i = 1; i <= n; ++i) { cin >> a[i]; } cin >> q; while (q--) { ll w; cin >> w; ll cnt = 0; for (ll i = 1; i <= n; ++i) { ll x = a[i]; ll c = 1; while (x % 2 == 0) { c *= 2; x /= 2; } cnt += c; if (cnt >= w) { cout << x << nl; break; } } } } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); // freopen("angry.in", "r", stdin); // freopen("angry.out", "w", stdout); int ttt = 1; // cin >> ttt; for (int test = 1; test <= ttt; ++test) { // cout << "Case " << test << ":" << ' '; ma1n(); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...