제출 #734530

#제출 시각아이디문제언어결과실행 시간메모리
734530rahidilbayramliIntercastellar (JOI22_ho_t1)C++17
25 / 100
2086 ms263172 KiB
#include<bits/stdc++.h>
#define ll long long
#define vl vector<ll>
#define sl set<ll>
#define all(v) v.begin(), v.end()
#define pb push_back
#define s second
#define f first
#define pll pair<ll, ll>
#define pii pair<int, int>
using namespace std;
ll f1(ll n)
{
    ll y, k = 0;
    y = n;
    while(n % 2 == 0)
    {
        k++;
        n /= 2;
    }
    return y / n;
}
ll f2(ll n)
{
    while(n % 2 == 0)
        n /= 2;
    return n;
}
int main()
{
    ll n, i, j, q, x;
    cin >> n;
    vl v(n);
    for(ll&h : v)   cin >> h;
    vl v1;
    for(i = 0; i < n; i++)
    {
        if(v[i] % 2 == 1)    v1.pb(v[i]);
        else
        {
            for(j = 0; j < f1(v[i]); j++)    v1.pb(f2(v[i]));
        }
    }
    /*for(ll&h : v1)
        cout << h << ' ';
    cout << "\n";*/
    cin >> q;
    while(q--)
    {
        cin >> x;
        cout << v1[x-1] << "\n";
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...