oj.uz

답안 #1042571

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1042571 2024-08-03T07:28:45 Z Whisper Intercastellar (JOI22_ho_t1) C++17
100 / 100
 48 ms 9428 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, a) for (int i = 0; i < (a); ++i)
#define REPD(i, a) for (int i = (a) - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)


constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

/*
    Phu Trong from Nguyen Tat Thanh High School for gifted student
*/

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
#define MAX             200005
int A[MAX];
int nArr, numQuery;

void process(void){
    cin >> nArr;
    for (int i = 1; i <= nArr; ++i) cin >> A[i];
    cin >> numQuery;
    vector<int> val;

    for (int i = 1; i <= nArr; ++i){
        if (A[i] & 1){
            val.emplace_back(!val.empty() ? val.back() + 1 : 1);
        }
        else{
            int k = 0;
            while (A[i] % 2 == 0){
                A[i] /= 2; k++;
            }
            val.emplace_back(!val.empty() ? val.back() + MASK(k) : MASK(k));
        }
    }
    for (int i = 1; i <= numQuery; ++i){
        int x; cin >> x;
        auto pos = lower_bound(val.begin(), val.end(), x) - val.begin() + 1;
        cout << A[pos] << '\n';
    }
}
signed main(){
    #define name "Whisper"
    cin.tie(nullptr) -> sync_with_stdio(false);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    process();
    return (0 ^ 0);
}

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 12 ms 4568 KB Output is correct
4 Correct 16 ms 2636 KB Output is correct
5 Correct 30 ms 5844 KB Output is correct
6 Correct 17 ms 4312 KB Output is correct
7 Correct 28 ms 6088 KB Output is correct
8 Correct 30 ms 5712 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 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 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 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 0 ms 400 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 476 KB Output is correct
14 Correct 1 ms 348 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 12 ms 4568 KB Output is correct
4 Correct 16 ms 2636 KB Output is correct
5 Correct 30 ms 5844 KB Output is correct
6 Correct 17 ms 4312 KB Output is correct
7 Correct 28 ms 6088 KB Output is correct
8 Correct 30 ms 5712 KB Output is correct
9 Correct 1 ms 344 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 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 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 0 ms 400 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 476 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 19 ms 3296 KB Output is correct
24 Correct 20 ms 5332 KB Output is correct
25 Correct 39 ms 8904 KB Output is correct
26 Correct 32 ms 5720 KB Output is correct
27 Correct 25 ms 5844 KB Output is correct
28 Correct 44 ms 9344 KB Output is correct
29 Correct 48 ms 8992 KB Output is correct
30 Correct 20 ms 3800 KB Output is correct
31 Correct 44 ms 9428 KB Output is correct