oj.uz

Submission #534067

# Submission time Handle Problem Language Result Execution time Memory
534067 2022-03-08T00:07:10 Z browntoad Intercastellar (JOI22_ho_t1) C++14
100 / 100
 86 ms 9164 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast", "unroll-loops")
using namespace std;
#define ll long long
#define int ll
#define FOR(i,a,b) for (int i = (a); i<(b); i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n+1)
#define RREP(i,n) for (int i=(n)-1; i>=0; i--)
#define f first
#define s second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)(x.size())
#define SQ(x) (x)*(x)
#define pii pair<int, int>
#define pdd pair<double ,double>
#define pcc pair<char, char> 
#define endl '\n'
//#define TOAD
#ifdef TOAD
#define bug(x) cerr<<__LINE__<<": "<<#x<<" is "<<x<<endl
#define IOS()
#else
#define bug(...)
#define IOS() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#endif

const ll inf = 1ll<<60;
const int iinf=2147483647;
const ll mod = 1e9+7;
const ll maxn=4e5+5;
const double PI=acos(-1);

ll pw(ll x, ll p, ll m=mod){
    ll ret=1;
    while (p>0){
        if (p&1){
            ret*=x;
            ret%=m;
        }
        x*=x;
        x%=m;
        p>>=1;
    }
    return ret;
}

ll inv(ll a, ll m=mod){
    return pw(a,m-2);
}

//=======================================================================================


signed main (){
    IOS();
    int n; cin>>n;
    vector<int> vc(n), pf(n);
    REP(i,n) {
        cin>>vc[i];
        if (i!=0){
            pf[i]=pf[i-1];
        }
        int cnt=0;
        while(vc[i]%2==0){
            cnt++;
            vc[i]/=2;
        }
        pf[i]+=(1<<cnt);
    }
    int q; cin>>q;
    REP(i,q){
        int a; cin>>a;
        int b=lower_bound(ALL(pf), a)-pf.begin();
        cout<<vc[b]<<endl;
    }
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 20 ms 3916 KB Output is correct
4 Correct 35 ms 2356 KB Output is correct
5 Correct 61 ms 5448 KB Output is correct
6 Correct 31 ms 4036 KB Output is correct
7 Correct 50 ms 5572 KB Output is correct
8 Correct 57 ms 5648 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 292 KB Output is correct
2 Correct 1 ms 312 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 320 KB Output is correct
14 Correct 1 ms 320 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 20 ms 3916 KB Output is correct
4 Correct 35 ms 2356 KB Output is correct
5 Correct 61 ms 5448 KB Output is correct
6 Correct 31 ms 4036 KB Output is correct
7 Correct 50 ms 5572 KB Output is correct
8 Correct 57 ms 5648 KB Output is correct
9 Correct 0 ms 292 KB Output is correct
10 Correct 1 ms 312 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 312 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 308 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 320 KB Output is correct
22 Correct 1 ms 320 KB Output is correct
23 Correct 27 ms 2968 KB Output is correct
24 Correct 37 ms 5188 KB Output is correct
25 Correct 70 ms 8740 KB Output is correct
26 Correct 45 ms 5488 KB Output is correct
27 Correct 54 ms 5464 KB Output is correct
28 Correct 77 ms 9164 KB Output is correct
29 Correct 73 ms 8684 KB Output is correct
30 Correct 43 ms 3716 KB Output is correct
31 Correct 86 ms 9132 KB Output is correct