oj.uz

Submission #594882

# Submission time Handle Problem Language Result Execution time Memory
594882 2022-07-13T06:09:20 Z PoPularPlusPlus Intercastellar (JOI22_ho_t1) C++17
25 / 100
 43 ms 4004 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];
	int 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 , sum = 0;
	for(int i = 0; i < q; i++){
		int 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 320 KB Output is correct
3 Correct 19 ms 2444 KB Output is correct
4 Correct 25 ms 1912 KB Output is correct
5 Correct 42 ms 3872 KB Output is correct
6 Correct 29 ms 2740 KB Output is correct
7 Correct 43 ms 3944 KB Output is correct
8 Correct 41 ms 4004 KB Output is correct

Subtask #2
0 / 35.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 1 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 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 Runtime error 1 ms 340 KB Execution killed with signal 11
10 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 320 KB Output is correct
3 Correct 19 ms 2444 KB Output is correct
4 Correct 25 ms 1912 KB Output is correct
5 Correct 42 ms 3872 KB Output is correct
6 Correct 29 ms 2740 KB Output is correct
7 Correct 43 ms 3944 KB Output is correct
8 Correct 41 ms 4004 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 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 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 Runtime error 1 ms 340 KB Execution killed with signal 11
18 Halted 0 ms 0 KB -