Submission #738007

#	Time	Username	Problem	Language	Result	Execution time	Memory
738007		maomao90	Intercastellar (JOI22_ho_t1)	C++17	100 / 100	77 ms	10800 KiB

Main

// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 200005;

int n;
int a[MAXN];
int q;
pll x[MAXN];
int ans[MAXN];

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> n;
    REP (i, 0, n) {
        cin >> a[i];
    }
    cin >> q;
    REP (i, 0, q) {
        cin >> x[i].FI;
        x[i].SE = i;
    }
    sort(x, x + q);
    ll sm = 0;
    int ptr = 0;
    REP (i, 0, n) {
        int nsm = a[i] & -a[i];
        int lg = 31 - __builtin_clz(nsm);
        sm += nsm;
        while (ptr < q && x[ptr].FI <= sm) {
            ans[x[ptr++].SE] = a[i] >> lg;
        }
    }
    REP (i, 0, q) {
        cout << ans[i] << '\n';
    }
    return 0;
}

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