oj.uz

Submission #619115

# Submission time Handle Problem Language Result Execution time Memory
619115 2022-08-02T09:57:45 Z StrawHatWess Intercastellar (JOI22_ho_t1) C++17
100 / 100
 84 ms 7784 KB 
//Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 2e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}
#ifndef LOCAL  
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl; 
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin); 
    freopen("output.txt", "w", stdout);
#endif
}
/////////////////////////ONLY CLEAN CODES ALLOWED/////////////////////////


int main() {
    boost; IO();

	int N; cin>>N;

    vpi vec;
    FOR(i,0,N){
    	int x; cin>>x; 

    	int n=1; 
    	while(x%2==0){
    		n*=2; 
    		x/=2; 
    	}

    	vec.eb(x,n); 
    }	

    //for(auto it: vec) cout << it.fi << ' ' << it.se << endl;


    int Q; cin>>Q; 
    ll cur=vec[0].se; int i=0; 
    FOR(idx,0,Q){
    	ll x; cin>>x; 
    	
    	while(cur<x){
    		i++; 
    		cur+=vec[i].se; 
    	}

    	//cout << i << endl;
    	cout << vec[i].fi << endl;
    	//cout << endl;
    }

    

    return 0;
}
//Change your approach

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 18 ms 2944 KB Output is correct
4 Correct 27 ms 2044 KB Output is correct
5 Correct 44 ms 4092 KB Output is correct
6 Correct 35 ms 3024 KB Output is correct
7 Correct 47 ms 4132 KB Output is correct
8 Correct 49 ms 4216 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 18 ms 2944 KB Output is correct
4 Correct 27 ms 2044 KB Output is correct
5 Correct 44 ms 4092 KB Output is correct
6 Correct 35 ms 3024 KB Output is correct
7 Correct 47 ms 4132 KB Output is correct
8 Correct 49 ms 4216 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 324 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 25 ms 2940 KB Output is correct
24 Correct 38 ms 4212 KB Output is correct
25 Correct 84 ms 7364 KB Output is correct
26 Correct 43 ms 4680 KB Output is correct
27 Correct 42 ms 4552 KB Output is correct
28 Correct 74 ms 7784 KB Output is correct
29 Correct 75 ms 7280 KB Output is correct
30 Correct 37 ms 3640 KB Output is correct
31 Correct 75 ms 7696 KB Output is correct