Submission #593137

#	Time	Username	Problem	Language	Result	Execution time	Memory
593137		ioi	Intercastellar (JOI22_ho_t1)	C++14	100 / 100	73 ms	9360 KiB

Main

#include<bits/stdc++.h>

using namespace std;

#define debug(x) cout << '[' << #x << " is: " << x << "] " << endl;
#define inF freopen("cardgame.in" , "r" , stdin);
#define outF freopen("cardgame.out" , "w" , stdout);
#define imod(a , n) (a % n + n ) % n
#define sor(v) sort(v.begin() , v.end());
#define print(v) for(auto f : v ) cout << f << " " ;
#define rsor(v) sort(v.rbegin() , v.rend());
#define rev(v) reverse(v.begin() , v.end());
#define scan(v)for(auto &it : v)cin >> it ;
#define ll long long

#define logar(x , y) log(x) / log(y)
#define __sum(n) n * (n + 1) / 2
#define __lcm(a , b) a / __gcd(a , b) * b
#define pii pair<int , int >
#define fastio ios_base::sync_with_stdio(false);cin.tie(0);

//#define int ll

const int N =  3e5 + 3,  M = N * 4  , MX = 2e4 + 40;
const ll MOD = 998244353  , oo = 1e9 + 9 , OO = 1e18 , mod = MOD ;
const double pi = acos(-1) , eps = 1e-17 ;

int di[] = {1 , -1 , 0 , 0};
int dj[] = {0 , 0 , 1 , -1};





 int32_t main()
{
    // inF;
   // inF;outF;
    fastio;

    //Welcome back without <TAWJIHI>



    int n;
    cin >> n;

    vector<pair<ll , int > > v;


    while(n--){

        ll a ;
        cin >> a ;

        ll p = 1 ;

        while(a % 2 == 0){
            a /= 2 ;
            p *= 2 ;

        }
        v.push_back({a , p});

    }


    int k;
    cin >> k ;
    ll sum = 0 , j = 0;
    while(k--){

        ll a ;
        cin >> a ;


        a -- ;
        while(sum <= a)
            sum += v[j++].second ;

        cout << v[j - 1].first << '\n';



    }
}

• Subtask 1: 25 / 25
• Subtask 2: 35 / 35
• Subtask 3: 40 / 40