oj.uz

Submission #738007

# Submission time Handle Problem Language Result Execution time Memory
738007 2023-05-08T05:05:48 Z maomao90 Intercastellar (JOI22_ho_t1) C++17
100 / 100
 77 ms 10800 KB 
// 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.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 21 ms 2520 KB Output is correct
4 Correct 29 ms 4780 KB Output is correct
5 Correct 44 ms 7104 KB Output is correct
6 Correct 25 ms 3916 KB Output is correct
7 Correct 47 ms 7104 KB Output is correct
8 Correct 59 ms 7144 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 21 ms 2520 KB Output is correct
4 Correct 29 ms 4780 KB Output is correct
5 Correct 44 ms 7104 KB Output is correct
6 Correct 25 ms 3916 KB Output is correct
7 Correct 47 ms 7104 KB Output is correct
8 Correct 59 ms 7144 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 27 ms 4940 KB Output is correct
24 Correct 39 ms 5196 KB Output is correct
25 Correct 68 ms 10328 KB Output is correct
26 Correct 43 ms 6248 KB Output is correct
27 Correct 36 ms 5580 KB Output is correct
28 Correct 71 ms 10700 KB Output is correct
29 Correct 70 ms 10188 KB Output is correct
30 Correct 40 ms 6444 KB Output is correct
31 Correct 77 ms 10800 KB Output is correct