oj.uz

Submission #805639

# Submission time Handle Problem Language Result Execution time Memory
805639 2023-08-03T19:15:43 Z kirakaminski968 Intercastellar (JOI22_ho_t1) C++17
0 / 100
 0 ms 300 KB 
#include <bits/stdc++.h>
#define ll long long
using namespace std;

int main()
{
    int N; cin >> N;
    vector<pair<int,int>> ans;
    for(int i = 0;i<N;++i){
        int x; cin >> x;
        int y = 1;
        while(x % 2 == 0){
            x /= 2; y *= 2;
        }
        ans.push_back({y,x});
        //cout << y << " " << x << "\n";
    }
    cout << ans[0].first << "\n";
    int Q; cin >> Q;
    int i = 0; ll cur = 0;
    while(Q--){
        int x; cin >> x;
        while(i < N && cur+ans[i].first < x){
            cur += ans[i].first;
            i++;
        }
        //cout << i-1 << " " << cur << "\n";
        cout << ans[i].second << "\n";
    }
    return 0;
}

Subtask #1
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 300 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 300 KB Output isn't correct
2 Halted 0 ms 0 KB -