Submission #747878

#TimeUsernameProblemLanguageResultExecution timeMemory
747878JellyTheOctopusIntercastellar (JOI22_ho_t1)C++17
100 / 100
108 ms10768 KiB
#include <bits/stdc++.h> using namespace std; int N, Q; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cin >> N; vector<long long> A(N+1); for (int i = 1; i <= N; i++) { cin >> A[i]; } vector<long long> amt(N+1), val(N+1); for (int i = 1; i <= N; i++) { long long div = 1; while (A[i] % (2*div) == 0) { div *= 2; } amt[i] = div; val[i] = A[i]/div; //cout << amt[i] << " " << A[i]/div << "\n"; } cin >> Q; int i = 1; long long seen = 0; while (Q--) { long long X; cin >> X; while (X > seen+amt[i]) { seen += amt[i]; i++; } cout << val[i] << "\n"; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...