oj.uz

Submission #693146

# Submission time Handle Problem Language Result Execution time Memory
693146 2023-02-02T12:20:48 Z ethening Intercastellar (JOI22_ho_t1) C++17
25 / 100
 55 ms 5608 KB 
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;

int main() {
	cin.tie(0)->sync_with_stdio(0);
	int n;
	cin >> n;
	vector<int> a(n + 5);
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	int q;
	cin >> q;
	vector<pii> que(q + 5);
	vector<int> ans(q + 5);
	for (int i = 1; i <= q; i++) {
		cin >> que[i].first;
		que[i].second = i;
	}
	sort(que.begin() + 1, que.begin() + q + 1);
	// for (int i = 1; i <= q; i++) {
	// 	cout << que[i].first << " " << que[i].second << "$$" << endl;
	// }
	int pnt1 = 1;
	int cnt = 0;
	for (int i = 1; i <= n; i++) {
		int cnt2 = 1;
		while (a[i] % 2 == 0) {
			a[i] /= 2;
			cnt2 *= 2;
			// cout << "@" << a[i] << endl;
		}
		// cout << cnt << " " << cnt2 << " " << que[pnt1].first << endl;
		while (pnt1 <= q && que[pnt1].first >= cnt + 1 && que[pnt1].first <= cnt + cnt2) {
			ans[que[pnt1].second] = a[i];
			++pnt1;
			// cout << "##" << pnt1 << endl;
		}
		cnt += cnt2;
	}
	for (int i = 1; i <= q; i++) {
		cout << ans[i] << "\n";
	}
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 19 ms 2096 KB Output is correct
4 Correct 27 ms 3532 KB Output is correct
5 Correct 44 ms 5500 KB Output is correct
6 Correct 25 ms 3144 KB Output is correct
7 Correct 55 ms 5564 KB Output is correct
8 Correct 50 ms 5608 KB Output is correct

Subtask #2
0 / 35.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 1 ms 320 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 316 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Incorrect 1 ms 212 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 19 ms 2096 KB Output is correct
4 Correct 27 ms 3532 KB Output is correct
5 Correct 44 ms 5500 KB Output is correct
6 Correct 25 ms 3144 KB Output is correct
7 Correct 55 ms 5564 KB Output is correct
8 Correct 50 ms 5608 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 316 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Incorrect 1 ms 212 KB Output isn't correct
18 Halted 0 ms 0 KB -