oj.uz

Submission #922989

# Submission time Handle Problem Language Result Execution time Memory
922989 2024-02-06T12:00:26 Z heeheeheehaaw Intercastellar (JOI22_ho_t1) C++17
100 / 100
 64 ms 10836 KB 
#include <iostream>
#define int long long

using namespace std;

int v[200005];
int nr[200005];
int minn[200005];

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    int n;
    cin>>n;
    for(int i = 1; i <= n; i++)
    {
        cin>>v[i];
        int cnt = 1;
        int a = v[i];
        while(a % 2 == 0)
            a /= 2, cnt *= 2;
        nr[i] = cnt;
        nr[i] += nr[i - 1];
        minn[i] = a;
    }

    int q;
    cin>>q;
    for(int i = 1; i <= q; i++)
    {
        int t;
        cin>>t;
        int st = 1, dr = n, poz = 1;
        while(st <= dr)
        {
            int mij = (st + dr) / 2;
            if(nr[mij] >= t)
                poz = mij, dr = mij - 1;
            else st = mij + 1;
        }

        cout<<minn[poz]<<'\n';
    }
    return 0;
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 17 ms 5596 KB Output is correct
4 Correct 28 ms 2700 KB Output is correct
5 Correct 41 ms 7252 KB Output is correct
6 Correct 28 ms 5780 KB Output is correct
7 Correct 40 ms 7252 KB Output is correct
8 Correct 40 ms 7272 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 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 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 0 ms 436 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 17 ms 5596 KB Output is correct
4 Correct 28 ms 2700 KB Output is correct
5 Correct 41 ms 7252 KB Output is correct
6 Correct 28 ms 5780 KB Output is correct
7 Correct 40 ms 7252 KB Output is correct
8 Correct 40 ms 7272 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 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 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 0 ms 436 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 21 ms 5028 KB Output is correct
24 Correct 28 ms 6876 KB Output is correct
25 Correct 52 ms 10252 KB Output is correct
26 Correct 35 ms 7248 KB Output is correct
27 Correct 34 ms 7248 KB Output is correct
28 Correct 64 ms 10836 KB Output is correct
29 Correct 58 ms 10336 KB Output is correct
30 Correct 34 ms 5712 KB Output is correct
31 Correct 64 ms 10836 KB Output is correct