제출 #1314385

#제출 시각아이디문제언어결과실행 시간메모리
1314385mna_Intercastellar (JOI22_ho_t1)C++20
100 / 100
57 ms10284 KiB
#include <bits/stdc++.h> using namespace std; #define int long long int32_t main(){ cin.tie(0); ios::sync_with_stdio(0); int n, q; cin >> n; vector<int>v1(n); for(int i=0; i<n; i++){ cin >> v1[i]; } cin >> q; vector<int>v2(q); for(int i=0; i<q; i++){ cin >> v2[i]; } vector<int>v3; vector<int>v4; int count=1; int num=v1[0]; for(int i=0; i<n; i++){ while(num%2==0){ num = num/2; count *= 2; } v3.push_back(num); v4.push_back(count); num = v1[i+1]; count = 1; } int x=0; vector<int>v5(v4.size()); for(int i=0; i<v4.size(); i++){ x = v4[i]+x; v5[i] = x; } for(int i=0; i<v2.size(); i++){ auto lb = lower_bound(v5.begin(), v5.end(), v2[i]); cout << v3[lb-v5.begin()] << "\n"; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...