oj.uz

Submission #769632

# Submission time Handle Problem Language Result Execution time Memory
769632 2023-06-29T23:30:35 Z raysh07 Intercastellar (JOI22_ho_t1) C++17
100 / 100
 64 ms 9212 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define INF (int)1e18
#define f first
#define s second

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

void Solve() 
{
    int n; cin >> n;
    vector <pair<int, int>> a(n);
    for (auto &x : a) {
        cin >> x.f;
        x.s = 1;
        
        while (x.f % 2 == 0){
            x.f /= 2;
            x.s *= 2;
        }
    }
    
    for (int i = 1; i < n; i++) a[i].s += a[i - 1].s;
    
    int q; cin >> q;
    
    while (q--){
        int x; cin >> x;
        
        int l = 0, r = n - 1;
        while (l != r){
            int m = (l + r)/2;
            
            if (a[m].s >= x) r = m;
            else l = m + 1;
        }
        
        cout << a[l].f << "\n";
    }
}

int32_t main() 
{
    auto begin = std::chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
  //  cin >> t;
    for(int i = 1; i <= t; i++) 
    {
        //cout << "Case #" << i << ": ";
        Solve();
    }
    auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
    return 0;
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 17 ms 3972 KB Output is correct
4 Correct 26 ms 2324 KB Output is correct
5 Correct 42 ms 5452 KB Output is correct
6 Correct 24 ms 4048 KB Output is correct
7 Correct 43 ms 5572 KB Output is correct
8 Correct 43 ms 5644 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 320 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 340 KB Output is correct
9 Correct 1 ms 212 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 360 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 336 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 17 ms 3972 KB Output is correct
4 Correct 26 ms 2324 KB Output is correct
5 Correct 42 ms 5452 KB Output is correct
6 Correct 24 ms 4048 KB Output is correct
7 Correct 43 ms 5572 KB Output is correct
8 Correct 43 ms 5644 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 320 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 340 KB Output is correct
17 Correct 1 ms 212 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 360 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 23 ms 3020 KB Output is correct
24 Correct 31 ms 5208 KB Output is correct
25 Correct 54 ms 8820 KB Output is correct
26 Correct 36 ms 5580 KB Output is correct
27 Correct 34 ms 5532 KB Output is correct
28 Correct 63 ms 9212 KB Output is correct
29 Correct 63 ms 8652 KB Output is correct
30 Correct 32 ms 3656 KB Output is correct
31 Correct 64 ms 9104 KB Output is correct