oj.uz

Submission #594884

# Submission time Handle Problem Language Result Execution time Memory
594884 2022-07-13T06:10:22 Z PoPularPlusPlus Intercastellar (JOI22_ho_t1) C++17
100 / 100
 81 ms 8396 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long 
#define pb(e) push_back(e)
#define sv(a) sort(a.begin(),a.end())
#define sa(a,n) sort(a,a+n)
#define mp(a,b) make_pair(a,b)
#define vf first
#define vs second
#define ar array
#define all(x) x.begin(),x.end()
const int inf = 0x3f3f3f3f;
const int mod = 1000000007; 
const double PI=3.14159265358979323846264338327950288419716939937510582097494459230;
bool remender(ll a , ll b){return a%b;}

//freopen("problemname.in", "r", stdin);
//freopen("problemname.out", "w", stdout);

void solve(){
	int n;
	cin >> n;
	int arr[n];
	ll siz[n];
	for(int i = 0; i < n; i++){
		cin >> arr[i];
		siz[i] = 1;
		while(arr[i] % 2 == 0){
			arr[i] /= 2;
			siz[i] *= 2;
		}
	}
	int q;
	cin >> q;
	int j = 0;
	ll sum = 0;
	for(int i = 0; i < q; i++){
		ll x;
		cin >> x;
		while(sum < x){
			sum += siz[j];
			j++;
		}
		cout << arr[j-1] << '\n';
	}
}

int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
	//int t;cin >> t;while(t--)
	solve();
	return 0;
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 17 ms 2644 KB Output is correct
4 Correct 26 ms 1064 KB Output is correct
5 Correct 46 ms 2932 KB Output is correct
6 Correct 27 ms 2384 KB Output is correct
7 Correct 54 ms 3036 KB Output is correct
8 Correct 46 ms 2980 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 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 340 KB Output is correct
12 Correct 1 ms 328 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 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 17 ms 2644 KB Output is correct
4 Correct 26 ms 1064 KB Output is correct
5 Correct 46 ms 2932 KB Output is correct
6 Correct 27 ms 2384 KB Output is correct
7 Correct 54 ms 3036 KB Output is correct
8 Correct 46 ms 2980 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 328 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 34 ms 2892 KB Output is correct
24 Correct 34 ms 4684 KB Output is correct
25 Correct 57 ms 8012 KB Output is correct
26 Correct 42 ms 5004 KB Output is correct
27 Correct 47 ms 4912 KB Output is correct
28 Correct 73 ms 8396 KB Output is correct
29 Correct 76 ms 7828 KB Output is correct
30 Correct 37 ms 3572 KB Output is correct
31 Correct 81 ms 8264 KB Output is correct