Submission #1166508

#	Time	Username	Problem	Language	Result	Execution time	Memory
1166508		Zero_OP	Intercastellar (JOI22_ho_t1)	C++20	100 / 100	46 ms	4680 KiB

Main

#include <bits/stdc++.h>

using namespace std;

#define FOR(i, l, r) for(int i = (l); i < (r); ++i)
#define ROF(i, r, l) for(int i = (r) - 1; i >= (l); --i)

#define mp make_pair
#define mt make_tuple
#define ff first
#define ss second

#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define pb push_back
#define eb emplace_back
#define sz(v) (int)v.size()
#define sum_of(v) accumulate(all(v), 0ll)
#define compact(v) v.erase(unique(all(v)), end(v))

#define dbg(x) "[" #x " = " << (x) << "]"

template<typename T>
      bool minimize(T& a, const T& b){
            if(a > b) return a = b, true;
            return false;
      }

template<typename T>
      bool maximize(T& a, const T& b){
            if(a < b) return a = b, true;
            return false;
      }

using ll = long long;
using db = double;
using ld = long double;
using ull = unsigned long long;

using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;

using vi = vector<int>;
using vb = vector<bool>;
using vc = vector<char>;
using vl = vector<ll>;
using vd = vector<db>;

using vpi = vector<pi>;
using vpl = vector<pl>;

void setIO(){
      ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef LOCAL
      freopen("task.inp", "r", stdin);
      freopen("task.out", "w", stdout);
#endif // LOCAL
}

const int MAX = 2e5 + 5;

int N, A[MAX];
ll pref[MAX];

int main(){
      setIO();

      cin >> N;
      FOR(i, 1, N+1){
            cin >> A[i];
            pref[i] = 1;
            while(A[i] % 2 == 0){
                  pref[i] *= 2;
                  A[i] /= 2;
            }

            pref[i] += pref[i-1];
      }

      int Q;
      cin >> Q;
      while(Q--){
            ll X;
            cin >> X;

            int pos = lower_bound(pref + 1, pref + 1 + N, X) - pref;
            cout << A[pos] << '\n';
      }

      return 0;
}

• Subtask 1: 25 / 25
• Subtask 2: 35 / 35
• Subtask 3: 40 / 40