oj.uz

답안 #1094433

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1094433 2024-09-29T15:32:25 Z stefanopulos Intercastellar (JOI22_ho_t1) C++17
100 / 100
 49 ms 9296 KB 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ldb;
 
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ldb,ldb> pdd;

#define ff(i,a,b) for(int i = a; i <= b; i++)
#define fb(i,b,a) for(int i = b; i >= a; i--)
#define trav(a,x) for(auto& a : x)
 
#define sz(a) (int)(a).size()
#define fi first
#define se second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

const int mod = 1000000007;
const int inf = 1e9 + 5;
const int mxN = 200005; 

int n, q;
int niz[mxN];

int A[mxN];
ll pref[mxN];

int main(){
    cin.tie(0)->sync_with_stdio(0);

    cin >> n;
    ff(i,1,n)cin >> niz[i];

    ff(i,1,n){
        int X = niz[i];

        while(X % 2 == 0)X /= 2; 

        pref[i] = pref[i - 1] + niz[i] / X; A[i] = X;

    }

    cin >> q; int j = 1;
    while(q--){
        ll k;
        cin >> k;

        while(j + 1 <= n && k > pref[j])j += 1;

        cout << A[j] << '\n';

    }

    return 0;
}
/*



// probati bojenje sahovski
*/

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 13 ms 4188 KB Output is correct
4 Correct 18 ms 2648 KB Output is correct
5 Correct 30 ms 5460 KB Output is correct
6 Correct 19 ms 4352 KB Output is correct
7 Correct 29 ms 5724 KB Output is correct
8 Correct 30 ms 5712 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 348 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 1 ms 348 KB Output is correct
10 Correct 1 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 344 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 13 ms 4188 KB Output is correct
4 Correct 18 ms 2648 KB Output is correct
5 Correct 30 ms 5460 KB Output is correct
6 Correct 19 ms 4352 KB Output is correct
7 Correct 29 ms 5724 KB Output is correct
8 Correct 30 ms 5712 KB Output is correct
9 Correct 0 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 0 ms 348 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 1 ms 348 KB Output is correct
18 Correct 1 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 344 KB Output is correct
23 Correct 16 ms 3224 KB Output is correct
24 Correct 22 ms 5292 KB Output is correct
25 Correct 43 ms 8828 KB Output is correct
26 Correct 27 ms 5720 KB Output is correct
27 Correct 27 ms 5712 KB Output is correct
28 Correct 48 ms 9296 KB Output is correct
29 Correct 47 ms 8788 KB Output is correct
30 Correct 24 ms 3772 KB Output is correct
31 Correct 49 ms 9296 KB Output is correct