oj.uz

답안 #703345

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
703345 2023-02-27T06:11:06 Z Aestivate Intercastellar (JOI22_ho_t1) C++17
100 / 100
 124 ms 6996 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];
    int pre[n+1]={0};
    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);
        pre[i]=pre[i-1]+(1LL<<hh);
        ans.pb(bb);
    }
    int q;
    cin>>q;
    rep(i,q) {
        int g;
        cin>>g;
        int l=0,r=n;
        while(l<r){
            int mid=l+r>>1;
            int gg=pre[mid];
            if(g>gg) l=mid+1;
            else r=mid;
        }
        cout<<ans[l-1]<<"\n";
    }
}   

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

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:59:22: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   59 |             int mid=l+r>>1;
      |                     ~^~

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 56 ms 5504 KB Output is correct
4 Correct 38 ms 1796 KB Output is correct
5 Correct 79 ms 5600 KB Output is correct
6 Correct 63 ms 5124 KB Output is correct
7 Correct 81 ms 5576 KB Output is correct
8 Correct 77 ms 5544 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 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 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 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 0 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 1 ms 212 KB Output is correct
3 Correct 56 ms 5504 KB Output is correct
4 Correct 38 ms 1796 KB Output is correct
5 Correct 79 ms 5600 KB Output is correct
6 Correct 63 ms 5124 KB Output is correct
7 Correct 81 ms 5576 KB Output is correct
8 Correct 77 ms 5544 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 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 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 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 34 ms 2272 KB Output is correct
24 Correct 66 ms 4624 KB Output is correct
25 Correct 124 ms 6996 KB Output is correct
26 Correct 55 ms 3976 KB Output is correct
27 Correct 54 ms 4680 KB Output is correct
28 Correct 95 ms 6264 KB Output is correct
29 Correct 80 ms 5572 KB Output is correct
30 Correct 44 ms 1632 KB Output is correct
31 Correct 87 ms 5952 KB Output is correct