oj.uz

답안 #1019363

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1019363 2024-07-10T18:18:34 Z underwaterkillerwhale Intercastellar (JOI22_ho_t1) C++17
25 / 100
 48 ms 14964 KB 
#include <bits/stdc++.h>
#define se              second
#define fs              first
#define mp              make_pair
#define pb              push_back
#define ll              long long
#define ii              pair<ll,ll>
#define ld              long double
#define SZ(v)           (int)v.size()
#define ALL(v)          v.begin(), v.end()
#define bit(msk, i)     ((msk >> i) & 1)
#define iter(id, v)     for(auto id : v)
#define rep(i,m,n)      for(int i=(m); i<=(n); i++)
#define reb(i,m,n)      for(int i=(m); i>=(n); i--)

using namespace std;

mt19937_64 rd(chrono :: steady_clock :: now().time_since_epoch().count());
ll Rand(ll l, ll r)
{
    return uniform_int_distribution<ll> (l, r)(rd);
}

const int N  = 2e5 + 7;
const int Mod =1e9 + 7;
const int szBL = 916;
const ll INF = 1e18;
const int BASE = 137;

struct Data {
    ll a, b, c;
};

int n, Q;
ll a[N];
ll g[(int)1e7 + 7];
ll dp[N];
vector<ll> Val;

void solution () {
    cin >> n;
    rep (i, 1, n) {
        cin >> a[i];
        ll X = a[i];
        while (X > 0 && X % 2 == 0) {
            Val.push_back(X);
            X /= 2;
        }
        Val.push_back(X);
    }
    sort (ALL(Val));
    Val.resize(unique(ALL(Val)) - Val.begin());
//    iter (&id, Val) cout << id <<"\n";
    rep (i, 0, SZ(Val) - 1) {
        ll cur = Val[i];
        if (cur & 1) g[i] = 1;
        else {
            g[i] = g[lower_bound(ALL(Val), cur / 2) - Val.begin()] * 2;
//            cout << cur<<" "<<g[5]<<" "<<lower_bound(ALL(Val), cur / 2) - Val.begin()<<"\n";
        }
    }
    rep (i, 1, n) {
        dp[i] = dp[i - 1] + g[lower_bound(ALL(Val), a[i]) - Val.begin()];
//        cout << g[lower_bound(ALL(Val), a[i]) - Val.begin()]<<","<<dp[i] <<" ";
    }
//    cout<<"\n";

    int ptr = 0;
    cin >> Q;
    rep (i, 1, Q) {
        int X;
        cin >> X;
        while (ptr < n - 1 && dp[ptr + 1] < X) ++ptr;
        ll cur = a[ptr + 1];
        ll delta = X - dp[ptr];
        while (cur > 0 && cur % 2 == 0) {
            cur /= 2;
        }
        cout << cur <<"\n";
    }

}

#define file(name) freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout);
int main () {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
//    file ("c");
    int num_Test = 1;
//    cin >> num_Test;
    while (num_Test--)
        solution();
}
/*
1 2
*/

Compilation message

Main.cpp: In function 'void solution()':
Main.cpp:75:12: warning: unused variable 'delta' [-Wunused-variable]
   75 |         ll delta = X - dp[ptr];
      |            ^~~~~

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 24 ms 9456 KB Output is correct
4 Correct 20 ms 6872 KB Output is correct
5 Correct 47 ms 11612 KB Output is correct
6 Correct 33 ms 10244 KB Output is correct
7 Correct 48 ms 11960 KB Output is correct
8 Correct 46 ms 14964 KB Output is correct

Subtask #2
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4440 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 2 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Incorrect 1 ms 4444 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 24 ms 9456 KB Output is correct
4 Correct 20 ms 6872 KB Output is correct
5 Correct 47 ms 11612 KB Output is correct
6 Correct 33 ms 10244 KB Output is correct
7 Correct 48 ms 11960 KB Output is correct
8 Correct 46 ms 14964 KB Output is correct
9 Correct 1 ms 4440 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4440 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 2 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Incorrect 1 ms 4444 KB Output isn't correct
18 Halted 0 ms 0 KB -