제출 #729225

#제출 시각아이디문제언어결과실행 시간메모리
729225PositiveDeltaIntercastellar (JOI22_ho_t1)C++17
100 / 100
80 ms8428 KiB
#include <bits/stdc++.h>
using namespace std;

void solve() {
  int n;
  cin >> n;
  vector<long long> pref(n + 1);
  vector<int> l(n);
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    l[i] = x / (x & -x);
    pref[i + 1] = pref[i] + (x & -x);
  }
  int q;
  cin >> q;
  while (q--) {
    long long x;
    cin >> x;
    cout << l[lower_bound(pref.begin(), pref.end(), x) - pref.begin() - 1] << "\n";
  }
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  solve();
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...