oj.uz

답안 #703344

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
703344 2023-02-27T06:06:45 Z Aestivate Intercastellar (JOI22_ho_t1) C++17
25 / 100
 423 ms 524288 KB 
#include<bits/stdc++.h>
#include<random>
using namespace std;

template<typename T> void _do(T x){cerr<<x<<"\n";}
template<typename T,typename ...U> void _do(T x,U ...y){cerr<<x<<", ";_do(y...);}
#define dbg(...) cerr<<#__VA_ARGS__<<" = ";_do(__VA_ARGS__);

#define float double
#define ss(n) fixed<<setprecision(n) 
#define ll long long
#define int ll
#define IO ios::sync_with_stdio(false);cin.tie(0);
#define ld long double
#define pb push_back
#define pii pair<int,int>
#define rep(i,a) for(int i=1;i<=a;i++)
#define rep0(i,a) for(int i=0;i<a;i++)
#define F first
#define S second
#define uni(a) a.resize(distance(a.begin(),unique(a.begin(),a.end())));
#define unisort(a) sort(a.begin(),a.end()); uni(a);

ll gcd(ll a,ll b){if(b==0) return a; return gcd(b,a%b);}

const ld pi=3.14159265358979323846264338327950288419716939931;
const int lar=3e18;
const int mol1=1e9+7;
const int mol2=998244353;
const int MX=2e5+5;

void solve()
{
    int n;
    cin>>n;
    int a[n+1];
    rep(i,n) cin>>a[i];
    vector<int>ans;
    rep(i,n){
        int hh=0;
        for(int j=33;j>=0;j--){
            if((a[i]%(1LL<<j))==0){
                hh=j;
                break;
            }
        }
        int bb=a[i]/(1LL<<hh);
        rep(j,(1LL<<hh)){
            ans.pb(bb);
        }
    }
    int q;
    cin>>q;
    rep(i,q) {
        int g;
        cin>>g;
        cout<<ans[g-1]<<"\n";
    }
}   

signed main()
{
    IO
    solve();
    return 0;
}

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 48 ms 6040 KB Output is correct
4 Correct 30 ms 2044 KB Output is correct
5 Correct 69 ms 6248 KB Output is correct
6 Correct 58 ms 9932 KB Output is correct
7 Correct 77 ms 10232 KB Output is correct
8 Correct 73 ms 18408 KB Output is correct

Subtask #2
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Runtime error 423 ms 524288 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 48 ms 6040 KB Output is correct
4 Correct 30 ms 2044 KB Output is correct
5 Correct 69 ms 6248 KB Output is correct
6 Correct 58 ms 9932 KB Output is correct
7 Correct 77 ms 10232 KB Output is correct
8 Correct 73 ms 18408 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Runtime error 423 ms 524288 KB Execution killed with signal 9
12 Halted 0 ms 0 KB -