oj.uz

Submission #1071081

# Submission time Handle Problem Language Result Execution time Memory
1071081 2024-08-23T04:16:15 Z steveonalex Intercastellar (JOI22_ho_t1) C++17
100 / 100
 46 ms 9296 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }



int main(void){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
    clock_t start = clock();

    int n; cin >> n;
    vector<ll> sum(n), x(n);
    for(int i= 0; i<n; ++i){
        int cur; cin >> cur;
        sum[i] = LASTBIT(cur);
        x[i] = cur / sum[i];
    }

    for(int i = 1; i<n; ++i) sum[i] += sum[i-1];

    int q; cin >> q;
    while(q--){
        ll u; cin >> u;
        int idx = lower_bound(ALL(sum), u) - sum.begin();
        cout << x[idx] << "\n";
    }
 
    cerr << "Time elapsed: " << clock() - start << " ms\n";
    return 0;
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 13 ms 4120 KB Output is correct
4 Correct 18 ms 2464 KB Output is correct
5 Correct 31 ms 5712 KB Output is correct
6 Correct 18 ms 4224 KB Output is correct
7 Correct 33 ms 5716 KB Output is correct
8 Correct 37 ms 5688 KB Output is correct

Subtask #2
35.0 / 35.0

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

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 13 ms 4120 KB Output is correct
4 Correct 18 ms 2464 KB Output is correct
5 Correct 31 ms 5712 KB Output is correct
6 Correct 18 ms 4224 KB Output is correct
7 Correct 33 ms 5716 KB Output is correct
8 Correct 37 ms 5688 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 472 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 17 ms 3164 KB Output is correct
24 Correct 22 ms 5200 KB Output is correct
25 Correct 41 ms 8904 KB Output is correct
26 Correct 27 ms 5712 KB Output is correct
27 Correct 24 ms 5716 KB Output is correct
28 Correct 45 ms 9296 KB Output is correct
29 Correct 44 ms 8784 KB Output is correct
30 Correct 23 ms 3860 KB Output is correct
31 Correct 46 ms 9292 KB Output is correct