oj.uz

Submission #534068

# Submission time Handle Problem Language Result Execution time Memory
534068 2022-03-08T00:10:13 Z balbit Intercastellar (JOI22_ho_t1) C++14
100 / 100
 107 ms 5320 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int ll
#define pii pair<int, int>
#define f first
#define s second

#define REP(i,n) for (int i = 0; i<n; ++i)
#define REP1(i,n) for (int i = 1; i<=n; ++i)

#define SZ(x) (int)((x).size())
#define ALL(x) (x).begin(), (x).end()
#define pb push_back

#define MX(a,b) a = max(a,b)
#define MN(a,b) a = min(a,b)

#ifdef BALBIT
#define bug(...) cerr<<"#"<<__LINE__<<" "<<#__VA_ARGS__<<" - ", _do(__VA_ARGS__)
template <typename T> void _do( T && x) {cerr<<x<<endl;}
template <typename T, typename ...S> void _do( T && x, S && ...y) {cerr<<x<<", "; _do(y...);}
#else
#define bug(...)
#define endl '\n'
#endif // BALBIT

const int maxn = 3e5+5;

signed main(){
    ios::sync_with_stdio(0), cin.tie(0);

    bug(1,2);

    int n; cin>>n;
    vector<int> a(n);
    vector<int> eee(n,1);
    REP(i,n) {
        cin>>a[i];
        while (a[i] % 2 == 0) {
            eee[i] *= 2; a[i] /= 2;
        }
    }
    int q; cin>>q;
    int prv = 1;
    int at = 0;
    while (q--) {
        ll x; cin>>x;
        ll df = x - prv;
        while (df) {
            int tk = min(
                         (ll)eee[at],
                         df);
            eee[at] -= tk;
            df -= tk;
            if (eee[at] == 0) ++at;
        }
        cout<<a[at]<<endl;
        prv = x;
    }
}

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 28 ms 3404 KB Output is correct
4 Correct 28 ms 1356 KB Output is correct
5 Correct 40 ms 3832 KB Output is correct
6 Correct 25 ms 3064 KB Output is correct
7 Correct 42 ms 3844 KB Output is correct
8 Correct 43 ms 3728 KB Output is correct

Subtask #2
35.0 / 35.0

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

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 28 ms 3404 KB Output is correct
4 Correct 28 ms 1356 KB Output is correct
5 Correct 40 ms 3832 KB Output is correct
6 Correct 25 ms 3064 KB Output is correct
7 Correct 42 ms 3844 KB Output is correct
8 Correct 43 ms 3728 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 25 ms 1996 KB Output is correct
24 Correct 32 ms 3292 KB Output is correct
25 Correct 63 ms 5320 KB Output is correct
26 Correct 49 ms 2884 KB Output is correct
27 Correct 49 ms 3012 KB Output is correct
28 Correct 83 ms 4720 KB Output is correct
29 Correct 107 ms 3884 KB Output is correct
30 Correct 37 ms 1416 KB Output is correct
31 Correct 96 ms 4356 KB Output is correct