oj.uz

Submission #1019034

# Submission time Handle Problem Language Result Execution time Memory
1019034 2024-07-10T12:16:22 Z ByeWorld Intercastellar (JOI22_ho_t1) C++14
100 / 100
 52 ms 17232 KB 
#include <bits/stdc++.h>
// #pragma GCC optimize("O3", "unroll-loops")
#define ll long long
#define int long long
#define pb push_back
#define fi first
#define se second
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
#define ld long double
using namespace std;
typedef pair<int,int> pii;
typedef pair<pii, int> ipii;
const int MAXN = 5e5+10;
const int MAXA = 9e3+20;
const ll INF = 1e9+10;
const int LOG = 20;
const int SQRT = 450;
const vector<int> NOL = {};
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const vector<int> dx = {1, -1, 0, 0};
const vector<int> dy = {0, 0, 1, -1};
vector <int> key = {29, 31};
vector <int> mod = {998244353, 1000000007};
void chmx(int &a, int b){ a = max(a, b); }
 
int n, a[MAXN], pr[MAXN];
pii val[MAXN];

signed main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin >> n;
	for(int i=1; i<=n; i++){
		cin >> a[i];
		int tot = 0;
		while((a[i]&1) == 0){ tot++; a[i] >>= 1; }
		val[i] = {(1ll<<tot), a[i]};
		pr[i] = pr[i-1]+(1ll<<tot);
	}
	int q; cin >> q;
	for(int i=1; i<=q; i++){
		int x; cin >> x;
		int l=1, r=n, mid=0, cnt=0;
		while(l<=r){
			mid = md;
			if(pr[mid] >= x){
				r = mid-1; cnt = mid;
			} else l = mid+1;
		}
		cout << val[cnt].se << '\n';
	}
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 13 ms 9564 KB Output is correct
4 Correct 18 ms 6236 KB Output is correct
5 Correct 32 ms 13400 KB Output is correct
6 Correct 19 ms 12380 KB Output is correct
7 Correct 37 ms 13368 KB Output is correct
8 Correct 44 ms 13652 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 1 ms 2392 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 1 ms 2584 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 13 ms 9564 KB Output is correct
4 Correct 18 ms 6236 KB Output is correct
5 Correct 32 ms 13400 KB Output is correct
6 Correct 19 ms 12380 KB Output is correct
7 Correct 37 ms 13368 KB Output is correct
8 Correct 44 ms 13652 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 1 ms 2392 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct
22 Correct 1 ms 2584 KB Output is correct
23 Correct 19 ms 7004 KB Output is correct
24 Correct 23 ms 7516 KB Output is correct
25 Correct 43 ms 16724 KB Output is correct
26 Correct 28 ms 12624 KB Output is correct
27 Correct 39 ms 14416 KB Output is correct
28 Correct 48 ms 17232 KB Output is correct
29 Correct 52 ms 16720 KB Output is correct
30 Correct 25 ms 7760 KB Output is correct
31 Correct 48 ms 16976 KB Output is correct