Submission #1240596

#TimeUsernameProblemLanguageResultExecution timeMemory
1240596M_SH_OIntercastellar (JOI22_ho_t1)C++20
100 / 100
50 ms11588 KiB
/*#pragma GCC optimize("O3") #pragma GCC optimization("Ofast,unroll-loops") #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")*/ #include <bits/stdc++.h> /*#include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp>*/ #define ll long long #define ll1 long long #define ull unsigned long long #define dou long double #define str string #define vll vector<ll> #define vi vector<int> #define pll pair<ll, ll> #define vpll vector<pll> #define vbool vector<bool> #define vstr vector<str> #define vvll vector<vll> #define pb push_back #define pf push_front #define endl "\n" #define fr first #define se second // #define sortcmp(a) sort(a.begin(), a.end(), cmp) #define sort(a) sort(a.begin(), a.end()) #define reverse(a) reverse(a.begin(), a.end()) #define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0) #define INF 1000000000000000007 #define ordered_set tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> using namespace std; //using namespace __gnu_pbds; mt19937 rng(time(0)); ll randll(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rng); } int main(){ speed; srand(time(0)); ll n; cin >> n; vll a(n); vpll b(n); for (int i = 0; i < n; i ++) { cin >> a[i]; ll x = 1; while (a[i] % 2 == 0) { x *= 2; a[i] /= 2; } b[i] = {x, a[i]}; } ll q; cin >> q; vpll qu(q); for (int i =0 ; i < q; i ++) { cin >> qu[i].fr; qu[i].se = i; } sort(qu); ll k = 0, l = 0; vll res(q); for (auto i : qu) { while (k < i.fr) k += b[l++].fr; res[i.se] = b[l-1].se; } for (int i = 0; i < q; i ++) { cout << res[i] << endl; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...