제출 #539677

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
539677		cig32	Intercastellar (JOI22_ho_t1)	C++17	100 / 100	124 ms	12364 KiB

Main

#include "bits/stdc++.h"
using namespace std;
const int MAXN = 2e5 + 10;
const int MOD = 1e9 + 7;
#define int long long
#define ll __int128
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
  int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
ll read() { // read int128
  int x; cin >> x; return (ll)x;
}
long long bm(long long b, long long p) {
  if(p==0) return 1 % MOD;
  long long r = bm(b, p >> 1);
  if(p&1) return (((r*r) % MOD) * b) % MOD;
  return (r*r) % MOD;
}
long long inv(long long b) { 
  return bm(b, MOD-2);
}
long long f[MAXN];
long long nCr(int n, int r) { 
  long long ans = f[n]; ans *= inv(f[r]); ans %= MOD;
  ans *= inv(f[n-r]); ans %= MOD; return ans;
}
void precomp() { 
  for(int i=0; i<MAXN; i++) f[i] = (i == 0 ? 1 % MOD : (f[i-1] * i) % MOD);
}
void solve(int tc) {
  int n;
  cin >> n;
  int a[n+1];
  for(int i=1; i<=n; i++)cin >> a[i];
  int ps[n+1];
  ps[0] = 0;
  int c[n+1];
  for(int i=1; i<=n; i++) {
    ps[i] = ps[i-1];
    int add = 0;
    int b = a[i];
    while(!(b & 1)) {
      b >>= 1;
      add++;
    }
    c[i] = b;
    ps[i] += (1ll << add);
  }
  int q;
  cin >> q;
  while(q--) {
    int x;
    cin >> x;
    int lb = 1, rb = n;
    while(lb < rb) {
      int mid = (lb + rb) >> 1;
      if(ps[mid] < x) lb = mid + 1;
      else rb = mid;
    }
    cout << c[lb] << "\n";
  }
}
int32_t main(){
  precomp();
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
} 

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