oj.uz

답안 #886587

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
886587 2023-12-12T10:56:39 Z ono_de206 Intercastellar (JOI22_ho_t1) C++14
100 / 100
 58 ms 16064 KB 
#include<bits/stdc++.h>
using namespace std;

#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second

#define int long long

typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
// typedef pair<int, int> P;

template<typename T, typename U>
ostream & operator << (ostream &out, const pair<T, U> &c) {
	out << c.first << ' ' << c.second;
	return out;
}

template<typename T>
ostream & operator << (ostream &out, vector<T> &v) {
	const int sz = v.size();
	for (int i = 0; i < sz; i++) {
		if (i) out << ' ';
		out << v[i];
	}
	return out;
}

template<typename T>
istream & operator >> (istream &in, vector<T> &v) {
	for (T &x : v) in >> x;
	return in;
}

template<typename T, typename U>
	istream & operator >> (istream &in, pair<T, U> &c) {
	in >> c.first;
	in >> c.second;
	return in;
}

template<typename T>
void mxx(T &a, T b){if(b > a) a = b;}
template<typename T>
void mnn(T &a, T b){if(b < a) a = b;}

const int mxn = 2e5 + 10, MXLOG = 22, mod = 1e9 + 7, P = 1181, D = 1523;
const long long inf = 2e18 + 10;

void go() {
	int n;
	cin >> n;
	vector<pair<int, int>> v;
	for(int i = 0; i < n; i++) {
		int x;
		cin >> x;
		int cnt = 1;
		while(!(x & 1)) {
			cnt <<= 1;
			x >>= 1;
		}
		v.eb(x, cnt);
	}
	int q;
	cin >> q;
	vector<pair<int, int>> qs;
	vector<int> ans(q);
	for(int i = 0; i < q; i++) {
		int x;
		cin >> x;
		qs.eb(x, i);
	}
	sort(all(qs));
	int cnt = 0, l = 0;
	for(int i = 0; i < n; i++) {
		cnt += v[i].ss;
		while(l < q && qs[l].ff <= cnt) {
			ans[qs[l].ss] = v[i].ff;
			l++;
		}
	}
	for(int i = 0; i < q; i++) {
		cout << ans[i] << '\n';
	}
}

signed main() {
	fast;
	int t = 1;
	// cin >> t;
	while(t--) {
		go();
	}
	return 0;
}

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 17 ms 6708 KB Output is correct
4 Correct 25 ms 7768 KB Output is correct
5 Correct 39 ms 12748 KB Output is correct
6 Correct 28 ms 8396 KB Output is correct
7 Correct 40 ms 13008 KB Output is correct
8 Correct 39 ms 13256 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 464 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 17 ms 6708 KB Output is correct
4 Correct 25 ms 7768 KB Output is correct
5 Correct 39 ms 12748 KB Output is correct
6 Correct 28 ms 8396 KB Output is correct
7 Correct 40 ms 13008 KB Output is correct
8 Correct 39 ms 13256 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 464 KB Output is correct
23 Correct 22 ms 5964 KB Output is correct
24 Correct 27 ms 9156 KB Output is correct
25 Correct 58 ms 15968 KB Output is correct
26 Correct 32 ms 8656 KB Output is correct
27 Correct 31 ms 11264 KB Output is correct
28 Correct 58 ms 15964 KB Output is correct
29 Correct 54 ms 15552 KB Output is correct
30 Correct 30 ms 9784 KB Output is correct
31 Correct 57 ms 16064 KB Output is correct