oj.uz

답안 #536007

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
536007 2022-03-12T06:06:28 Z zaneyu Intercastellar (JOI22_ho_t1) C++14
100 / 100
 432 ms 7608 KB 
/*input
4
14
9
8
12
6
2
3
5
7
11
13
*/
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
using ll = long long;
using ld = long double;
using pii = pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-6;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
ll sub(ll a,ll b){
    ll x=a-b;
    while(x<0) x+=MOD;
    while(x>MOD) x-=MOD;
    return x;
}
ll mult(ll a,ll b){
    return (a*b)%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=(res*a)%MOD;
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
const ll maxn=5e5+5;
const ll maxlg=__lg(maxn)+2; 
int cnt[maxn],arr[maxn];
int main(){
    int n;
    cin>>n;
    REP(i,n){
        cin>>arr[i];
        cnt[i]=1;
        while(arr[i]%2==0) arr[i]/=2,cnt[i]*=2;
    }
    int q;
    cin>>q;
    int p=0;
    ll sum=0;
    while(q--){
        ll x;
        cin>>x;
        while(sum<x) sum+=cnt[p],++p;
        cout<<arr[p-1]<<'\n';
    }
}

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 94 ms 2488 KB Output is correct
4 Correct 237 ms 1976 KB Output is correct
5 Correct 337 ms 3952 KB Output is correct
6 Correct 179 ms 2796 KB Output is correct
7 Correct 333 ms 3980 KB Output is correct
8 Correct 331 ms 4084 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 312 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 3 ms 340 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 3 ms 340 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 94 ms 2488 KB Output is correct
4 Correct 237 ms 1976 KB Output is correct
5 Correct 337 ms 3952 KB Output is correct
6 Correct 179 ms 2796 KB Output is correct
7 Correct 333 ms 3980 KB Output is correct
8 Correct 331 ms 4084 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 312 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 1 ms 308 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 3 ms 340 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 3 ms 340 KB Output is correct
23 Correct 203 ms 2732 KB Output is correct
24 Correct 187 ms 4048 KB Output is correct
25 Correct 400 ms 7268 KB Output is correct
26 Correct 253 ms 4556 KB Output is correct
27 Correct 203 ms 4404 KB Output is correct
28 Correct 423 ms 7608 KB Output is correct
29 Correct 432 ms 7148 KB Output is correct
30 Correct 279 ms 3508 KB Output is correct
31 Correct 428 ms 7500 KB Output is correct