Submission #1195487

#	Time	Username	Problem	Language	Result	Execution time	Memory
1195487		JuanJL	Intercastellar (JOI22_ho_t1)	C++20	100 / 100	266 ms	5464 KiB

Main

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> 

#define fst first 
#define snd second
#define pb push_back
#define forn(i,a,b) for(int i = a; i < b; i++)
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define mset(a,v) memset((a),(v),sizeof(a))
#define FIN ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define dbg(v) cout<<"Line("<<__LINE__<<"): "<<#v<<" = "<<v<<'\n';
#define pi pair<int,int>
#define pll pair<ll,ll>
typedef long long ll;
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
typedef tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_multiset;

ll fimp(ll val){
	if(val%2==0) return fimp(val/2);
	else return val;
}

ll cant(ll val){
	if(val%2==1) return 1;
	return cant(val/2)*2;
}


int main(){
	ll n; cin>>n;
	vector<ll> a(n); forn(i,0,n) cin>>a[i];
	
	
	vector<ll> na(n);
	
	forn(i,0,n){
		na[i]=cant(a[i]);
	}
	
	forn(i,1,n) na[i]+=na[i-1];
	
	//forn(i,0,n) cout<<na[i]<<" "; cout<<'\n';
	
	//for(auto i:na) cout<<i<<" "; cout<<'\n';
	
	ll q; cin>>q;
	
	forn(i,0,q){		
		ll p; cin>>p;
		
		ll ind = lower_bound(ALL(na),p)-na.begin();
		cout<<fimp(a[ind])<<'\n';
	}
	return 0;
}

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