제출 #532652

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
532652		victor_gao	Intercastellar (JOI22_ho_t1)	C++17	100 / 100	80 ms	9180 KiB

Main

//#pragma GCC optimize("Ofast,unroll-loops,O3")
//#pragma GCC target("avx,avx2,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,fma,tune=native")
#include<bits/stdc++.h>
//#include<bits/extc++.h>
//#pragma pack(1)
#define fast ios::sync_with_stdio(0); cin.tie(0);
#define int long long
#define pii pair<int,int>
#define x first
#define y second
#define N 200015
using namespace std;
//using namespace __gnu_pbds;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//typedef tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update> order_multiset;
//typedef tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> order_set;
int n,arr[N],s[N];

signed main(){
	fast
	cin>>n;
	for (int i=1;i<=n;i++){
		cin>>arr[i];
		s[i]=1;
		while (arr[i]%2==0){
			s[i]*=2;
			arr[i]/=2;
		}
	}
	int np=1,total=s[1],q; cin>>q;
	while (q--){
		int x; cin>>x;
		while (np<=n&&total<x){
			np++;
			total+=s[np];
		}
		cout<<arr[np]<<'\n';
	}
}

• Subtask 1: 25 / 25
• Subtask 2: 35 / 35
• Subtask 3: 40 / 40