oj.uz

Submission #1078464

# Submission time Handle Problem Language Result Execution time Memory
1078464 2024-08-27T17:46:38 Z MrPavlito Intercastellar (JOI22_ho_t1) C++17
100 / 100
 56 ms 10836 KB 
#include <bits/stdc++.h>
#define int long long
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define sc second
#define endl "\n"
#define pii pair<int,int>

using namespace std;

const int MAXN = 1e5+5;
const int mod7 = 1e9+7;
const long long inf = 1e18;

signed main()
{
    ios_base::sync_with_stdio(false),cin.tie(0), cout.tie(0);
    int tt=1;
    //cin >> tt;
    while(tt--)
    {
        int n;
        cin >> n;
        vector<int>niz(n);
        vector<int>cnt(n+1, 1);
        cnt[0] = 0;
        vector<int>rez(n);
        for(int i=0; i<n; i++)
        {
            cin >> niz[i];
            int x = niz[i];
            while(x%2 == 0)
            {
                cnt[i+1]*=2;
                x/=2;
            }
            cnt[i+1] += cnt[i];
            rez[i] = x;
        }
        int q;cin >> q;
        int pointer = 1;
        while(q--)
        {
            int x;cin >> x;
            while(cnt[pointer] < x)pointer++;
            cout << rez[pointer-1] << endl;
        }
    }
}

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 348 KB Output is correct
3 Correct 13 ms 5468 KB Output is correct
4 Correct 17 ms 2860 KB Output is correct
5 Correct 29 ms 7260 KB Output is correct
6 Correct 21 ms 5392 KB Output is correct
7 Correct 31 ms 7252 KB Output is correct
8 Correct 29 ms 7248 KB Output is correct

Subtask #2
35.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 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 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 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct

Subtask #3
40.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 Correct 13 ms 5468 KB Output is correct
4 Correct 17 ms 2860 KB Output is correct
5 Correct 29 ms 7260 KB Output is correct
6 Correct 21 ms 5392 KB Output is correct
7 Correct 31 ms 7252 KB Output is correct
8 Correct 29 ms 7248 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 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 17 ms 3416 KB Output is correct
24 Correct 24 ms 6368 KB Output is correct
25 Correct 45 ms 10320 KB Output is correct
26 Correct 30 ms 6740 KB Output is correct
27 Correct 31 ms 6744 KB Output is correct
28 Correct 56 ms 10764 KB Output is correct
29 Correct 45 ms 10320 KB Output is correct
30 Correct 22 ms 3932 KB Output is correct
31 Correct 49 ms 10836 KB Output is correct