oj.uz

답안 #704781

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
704781 2023-03-03T02:27:35 Z bachhoangxuan Intercastellar (JOI22_ho_t1) C++17
100 / 100
 69 ms 9120 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define fi first
#define se second
const int inf=1e18;
const int mod=998244353;
const int mod2=1e9+7;
const int maxn=200005;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=1000005;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
int p[maxn],c[maxn],n,q,pos;
void solve(){
    cin >> n;
    for(int i=1;i<=n;i++){
        cin >> c[i];p[i]=1;
        while(c[i]%2==0){c[i]/=2;p[i]*=2;}
        p[i]+=p[i-1];
    }
    cin >> q;
    for(int i=1;i<=q;i++){
        int x;cin >> x;
        while(p[pos]<x) pos++;
        cout << c[pos] << '\n';
    }
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 18 ms 3924 KB Output is correct
4 Correct 24 ms 2260 KB Output is correct
5 Correct 41 ms 5492 KB Output is correct
6 Correct 25 ms 4088 KB Output is correct
7 Correct 41 ms 5528 KB Output is correct
8 Correct 45 ms 5628 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 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 340 KB Output is correct
3 Correct 18 ms 3924 KB Output is correct
4 Correct 24 ms 2260 KB Output is correct
5 Correct 41 ms 5492 KB Output is correct
6 Correct 25 ms 4088 KB Output is correct
7 Correct 41 ms 5528 KB Output is correct
8 Correct 45 ms 5628 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 27 ms 3020 KB Output is correct
24 Correct 30 ms 5212 KB Output is correct
25 Correct 54 ms 8740 KB Output is correct
26 Correct 39 ms 5512 KB Output is correct
27 Correct 37 ms 5504 KB Output is correct
28 Correct 68 ms 9120 KB Output is correct
29 Correct 69 ms 8684 KB Output is correct
30 Correct 34 ms 3700 KB Output is correct
31 Correct 68 ms 9036 KB Output is correct