Submission #920943

#	Time	Username	Problem	Language	Result	Execution time	Memory
920943		Xiaoyang	Intercastellar (JOI22_ho_t1)	C++17	100 / 100	56 ms	9280 KiB

Main

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
 
#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 1ll<<60
#define rep(i,a,b) for (ll i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
#define endl "\n"
void inc(ll &a,ll b) {a=(a+b)%mod;}
void dec(ll &a,ll b) {a=(a-b+mod)%mod;}
int prod(ll a,ll b) {return ll(a)*ll(b)%mod;}
int lowbit(ll x) {return x&(-x);}
ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}


const ll maxn=2e5+5;
ll a[maxn],qq[maxn];

ll p=1,pp=1;
ll n,q;



signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin>>n;
	rep(i,1,n+1)cin>>a[i];
	cin>>q;
	rep(i,1,q+1)cin>>qq[i];
	rep(i,1,n+1){
		if(a[i]&1){
			p++;
		}else{
			ll cnt=1;
			while(a[i]%2!=1){
				a[i]/=2;
				cnt*=2;
			}
			p+=cnt;
		}
		while(p>qq[pp] and pp<=q){
			cout<<a[i]<<endl;
			pp++;
		}
	}
	
	return 0;
}

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