oj.uz

Submission #1005710

# Submission time Handle Problem Language Result Execution time Memory
1005710 2024-06-22T21:35:01 Z VMaksimoski008 Intercastellar (JOI22_ho_t1) C++17
25 / 100
 70 ms 5972 KB 
#include <bits/stdc++.h>

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;

signed main() {
    int n;
    cin >> n;

    vector<int> v(n);
    for(int &x : v) cin >> x;

    int q;
    cin >> q;

    vector<pii> qus(q);
    for(int i=0; i<q; i++) {
        cin >> qus[i].first;
        qus[i].second = i;
    }

    sort(qus.begin(), qus.end());
    ll total = 0;
    int j = 0;

    vector<ll> ans(q);
    for(int i=0; i<n; i++) {
        int cnt = 0;
        ll x = v[i];
        while(x % 2 == 0) cnt++, x /= 2;
        
        total += (1ll << cnt);
        for(; j<q; j++) {
            if(qus[j].first > total) break;
            ans[qus[j].second] = x;
        }
    }
    
    for(ll &x : ans) cout << x << '\n';
    return 0;
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 26 ms 2324 KB Output is correct
4 Correct 39 ms 3920 KB Output is correct
5 Correct 61 ms 5716 KB Output is correct
6 Correct 51 ms 3412 KB Output is correct
7 Correct 62 ms 5712 KB Output is correct
8 Correct 70 ms 5972 KB Output is correct

Subtask #2
0 / 35.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 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 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Incorrect 0 ms 348 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 26 ms 2324 KB Output is correct
4 Correct 39 ms 3920 KB Output is correct
5 Correct 61 ms 5716 KB Output is correct
6 Correct 51 ms 3412 KB Output is correct
7 Correct 62 ms 5712 KB Output is correct
8 Correct 70 ms 5972 KB Output is correct
9 Correct 1 ms 344 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 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Incorrect 0 ms 348 KB Output isn't correct
18 Halted 0 ms 0 KB -