oj.uz

Submission #1026216

# Submission time Handle Problem Language Result Execution time Memory
1026216 2024-07-17T17:44:59 Z overwatch9 Intercastellar (JOI22_ho_t1) C++17
35 / 100
 2000 ms 2468 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;
    vector <ll> a(n+1);
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    int q;
    cin >> q;
    while (q--) {
        ll x;
        cin >> x;
        ll cnt = 0;
        ll ans = 1;
        for (int i = 1; i <= n; i++) {
            ll tp = 1;
            ll tp2 = a[i];
            while (tp2 % 2 == 0) {
                tp *= 2;
                tp2 /= 2;
            }
            cnt += tp;
            if (cnt >= x) {
                ans = tp2;
                break;
            }
        }
        cout << ans << '\n';
    }
}

Subtask #1
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Execution timed out 2094 ms 2468 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 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 1 ms 468 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 6 ms 348 KB Output is correct
12 Correct 11 ms 484 KB Output is correct
13 Correct 2 ms 344 KB Output is correct
14 Correct 8 ms 488 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Execution timed out 2094 ms 2468 KB Time limit exceeded
4 Halted 0 ms 0 KB -