oj.uz

Submission #913915

# Submission time Handle Problem Language Result Execution time Memory
913915 2024-01-20T13:36:45 Z ReLice Intercastellar (JOI22_ho_t1) C++14
100 / 100
 66 ms 10004 KB 
#include <bits/stdc++.h>
#define ll long long
#define str string
#define ins insert
#define ld long double
#define pb push_back
#define pf push_front
#define pof pop_front()
#define pob pop_back()
#define lb lower_bound
#define ub upper_bound
#define endl "\n"
#define fr first
#define sc second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define sz size()
#define vll vector<ll>
#define bc back()
#define arr array
#define pll vector<pair<ll,ll>>
using namespace std;
template <class _T>
bool chmin(_T &x, const _T &y){
    bool f=0;
    if (x>y){x=y;f=1;}
    return f;
}
template <class _T>
bool chmax(_T &x, const _T &y){
    bool f=0;
    if (x<y){x=y;f=1;}
    return f;
}
//void fre(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
void start(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
}
const ll inf=1e18+7;
const ll mod=1e9+7;
const ll N=1e5+7;
const ld eps=1e-9;
void solve(){
    ll i,j;
    ll n;
    cin>>n;
    pll v;
    ll b;
    ll sum=0;
    for(i=0;i<n;i++){
        cin>>b;
        ll c=1;
        while(b%2==0){
            b/=2;
            c*=2;
        }
        sum+=c;
        v.pb({sum,b});
    }
    cin>>n;
    for(i=0;i<n;i++){
        cin>>b;
        ll low=lb(all(v),make_pair(b,0ll))-v.begin();
        cout<<v[low].sc<<endl;
    }
}

signed main(){
	start();
    ll t=1;
    //cin>>t;
    while(t--) solve();
    return 0;
}
/*



*/

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:46:10: warning: unused variable 'j' [-Wunused-variable]
   46 |     ll i,j;
      |          ^

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 17 ms 4820 KB Output is correct
4 Correct 29 ms 2004 KB Output is correct
5 Correct 41 ms 5332 KB Output is correct
6 Correct 24 ms 4564 KB Output is correct
7 Correct 41 ms 6100 KB Output is correct
8 Correct 41 ms 5332 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 464 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 720 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 17 ms 4820 KB Output is correct
4 Correct 29 ms 2004 KB Output is correct
5 Correct 41 ms 5332 KB Output is correct
6 Correct 24 ms 4564 KB Output is correct
7 Correct 41 ms 6100 KB Output is correct
8 Correct 41 ms 5332 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 460 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 464 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 720 KB Output is correct
23 Correct 23 ms 3240 KB Output is correct
24 Correct 29 ms 7120 KB Output is correct
25 Correct 55 ms 8904 KB Output is correct
26 Correct 36 ms 5832 KB Output is correct
27 Correct 34 ms 6608 KB Output is correct
28 Correct 66 ms 10004 KB Output is correct
29 Correct 60 ms 8760 KB Output is correct
30 Correct 31 ms 4224 KB Output is correct
31 Correct 62 ms 9916 KB Output is correct