oj.uz

Submission #994179

# Submission time Handle Problem Language Result Execution time Memory
994179 2024-06-07T08:22:09 Z faqinyeager Intercastellar (JOI22_ho_t1) C++17
0 / 100
 27 ms 3932 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main(){
    int n;
    cin >> n;
    vector<ll> a(n), pow(n, 1);
    for(int i = 0; i < n; i++){
        cin >> a[i];
        while(a[i] % 2 == 0){
            a[i] /= 2;
            pow[i] *= 2;
        }
    }

    int Q, id = 0;
    cin >> Q;
    while(Q--){
        int c, tmp = 0;
        cin >> c;
        while(c > tmp + pow[id]){
            tmp += pow[id];
            id += 1;
        }
        if(id < n) cout << a[id] << '\n';
    }
}

Subtask #1
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 27 ms 3932 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 Incorrect 1 ms 396 KB Output isn't correct
7 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 348 KB Output is correct
3 Incorrect 27 ms 3932 KB Output isn't correct
4 Halted 0 ms 0 KB -