제출 #1176161

#제출 시각아이디문제언어결과실행 시간메모리
1176161jayssIntercastellar (JOI22_ho_t1)C++20
100 / 100
42 ms5304 KiB
#include <bits/stdc++.h> using namespace std; #define int long long const int N = 2e5 + 5; int idx[N], val[N]; signed main() { ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0); int n; cin >> n; for (int i = 1;i <= n;i++) { int x; cin >> x; int cnt = 1; while ( !(x & 1) ) { cnt <<= 1; x >>= 1; } idx[i] = idx[i - 1] + cnt; val[i] = x; } int q; cin >> q; while (q--) { int x; cin >> x; auto it = lower_bound(idx + 1, idx + n + 1, x); cout << val[it - idx] << '\n'; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...