oj.uz

Submission #681004

# Submission time Handle Problem Language Result Execution time Memory
681004 2023-01-12T08:36:14 Z adilet_321 Intercastellar (JOI22_ho_t1) C++14
100 / 100
 143 ms 21760 KB 
#include <bits/stdc++.h>
#include <vector>
#include <map>
#include <queue>
#include <deque>
#include <algorithm>
#include <iomanip>
#define ll long long
#define FOR(i,a) for (long long i=0;i<a;i++)
#define FORN(i,a) for (long long i=1;i<=a;i++)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define int long long
using namespace std;

int oo=9e17;
int mod=1e9 + 7;
int a[200001];
int s[51];
map<int,int>pp;
int z[200002];

void solve(){
	int o=1;
	for(int i=0;i<=50;i++){
		s[i]=o;
		o*=2;
	}
	int n;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		int o=0;
		while(a[i]%2==0){
			o++;
			a[i]/=2;
		}
		pp[i]=a[i];
		z[i]=s[o];
	}
	int q;
	cin>>q;
	int l=1,sm=0;
	while(q--){
		int x;
		cin>>x;
		while(true){
			if(sm<=x && x<=sm+z[l]){
				cout<<pp[l]<<"\n";
				break;
			}
			sm+=z[l];
			l++;
		}
	}
}
signed main(){
	//srand( time(0));
	//rand()
	//freopen("sum.in", "r", stdin);
	//freopen("sum.out", "w", stdout);
	ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    int c=1;
    while(c--){
    	solve();
	}
    return 0;
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 60 ms 15436 KB Output is correct
4 Correct 44 ms 5312 KB Output is correct
5 Correct 117 ms 17996 KB Output is correct
6 Correct 84 ms 14532 KB Output is correct
7 Correct 100 ms 18132 KB Output is correct
8 Correct 98 ms 18112 KB Output is correct

Subtask #2
35.0 / 35.0

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

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 60 ms 15436 KB Output is correct
4 Correct 44 ms 5312 KB Output is correct
5 Correct 117 ms 17996 KB Output is correct
6 Correct 84 ms 14532 KB Output is correct
7 Correct 100 ms 18132 KB Output is correct
8 Correct 98 ms 18112 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 1 ms 360 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 360 KB Output is correct
23 Correct 37 ms 5044 KB Output is correct
24 Correct 64 ms 14040 KB Output is correct
25 Correct 118 ms 21324 KB Output is correct
26 Correct 73 ms 13572 KB Output is correct
27 Correct 72 ms 14552 KB Output is correct
28 Correct 130 ms 21760 KB Output is correct
29 Correct 127 ms 21244 KB Output is correct
30 Correct 49 ms 5324 KB Output is correct
31 Correct 143 ms 21644 KB Output is correct