Submission #699061

#TimeUsernameProblemLanguageResultExecution timeMemory
699061dkblossomIntercastellar (JOI22_ho_t1)C++14
100 / 100
84 ms9396 KiB
#include<bits/stdc++.h> using namespace std; #pragma gcc optimize('ofast','unroll-loops') #define endl '\n' #define ff first #define ss second #define pb emplace_back #define mp make_pair #define all(x) x.begin(),x.end() #define sz(x) (int)x.size() #define rep(a,b,c) for(int a=b;a<c;a++) typedef long long ll; typedef pair<int,int> pii; typedef vector<int> vi; const ll maxn = 100005; const ll maxm = 200005; const ll mod = 1000000007; void solve(){ ll n, q; ll a; vector<pair<ll,ll>> vc; cin >> n; rep(i,0,n){ cin >> a; rep(i,0,100){ if(a%2){ vc.pb(mp(vc.size()?vc.back().ff+(1ll<<i):(1ll<<i),a)); break; }else a /= 2; } } cin >> q; while(q--){ cin >> a; cout << lower_bound(all(vc),mp(a,0ll))->ss << endl; } } int main(){ //freopen("input.txt","r",stdin); //freopen("sol.txt","w",stdout); ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); int t = 1; //cin >> t; while(t--) solve(); }

Compilation message (stderr)

Main.cpp:4: warning: ignoring '#pragma gcc optimize' [-Wunknown-pragmas]
    4 | #pragma gcc optimize('ofast','unroll-loops')
      |
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...