oj.uz

Submission #137450

# Submission time Handle Problem Language Result Execution time Memory
137450 2019-07-27T18:32:08 Z MladenP Fortune Telling 2 (JOI14_fortune_telling2) C++17
4 / 100
 66 ms 4848 KB 
#include<bits/stdc++.h>
#define STIZE(x) fprintf(stderr, "STIZE%d\n", x);
#define PRINT(x) fprintf(stderr, "%s = %d\n", #x, x);
#define NL(x) printf("%c", " \n"[(x)]);
#define lld long long
#define pii pair<int,int>
#define pb push_back
#define fi first
#define se second
#define mid (l+r)/2
#define endl '\n'
#define all(a) begin(a),end(a)
#define sz(a) int((a).size())
#define LINF 1000000000000000LL
#define INF 1000000000
#define EPS 1e-9
using namespace std;
#define MAXN 200010
lld N, K, a[MAXN], b[MAXN], t[MAXN];
lld seg[4*MAXN];
vector<pii> T, B;
void init(int node, int l, int r) {
    if(l == r) seg[node] = T[l].se;
    else {
        init(2*node, l, mid); init(2*node+1, mid+1, r);
        seg[node] = max(seg[2*node], seg[2*node+1]);
    }
}
lld query(int node, int l, int r, int L, int R) {
    if(r < l || R < L || r < L || R < l) return 0;
    if(L <= l && r <= R) return seg[node];
    return max(query(2*node, l, mid, L, R), query(2*node+1, mid+1, r, L, R));
}
lld bit[MAXN];
void update(int idx, lld val) {
    for( ; idx < MAXN; idx += idx&-idx) bit[idx] += val;
}
lld query(int idx) {
    lld rez = 0;
    for( ; idx ; idx -= idx&-idx) rez += bit[idx];
    return rez;
}
int bsL(int key) {
    auto l = lower_bound(all(T), make_pair(key, -INF));
    return l-T.begin();
}
int bsR(int key) {
    auto r = lower_bound(all(T), make_pair(key, INF)); r--;
    return r-T.begin();
}
int sred[MAXN];
int main() {
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cerr.tie(0);
    cin >> N >> K;
    for(int i = 1; i <= N; i++) cin >> a[i] >> b[i];
    for(int i = 1; i <= K; i++) cin >> t[i];
    T.pb({-INF, -INF}); B.pb({-INF, -INF});
    for(int i = 1; i <= N; i++) B.pb({max(a[i], b[i]), i});
    for(int i = 1; i <= K; i++) T.pb({t[i], i});
    sort(all(T));
    sort(all(B));
    init(1, 1, K);
    lld rez = 0;
    for(int i = 1; i <= N; i++) {
        int L = bsL(min(a[i], b[i])), R = bsR(max(a[i], b[i])-1);
        //PRINT(L);
        //PRINT(R);
        sred[i] = query(1, 1, K, L, R);
    }
    int cb = N, ct = K;
    while(cb > 0 || ct > 0) {
        int mode;
        if(cb == 0) mode = 0;
        else if(ct == 0) mode = 1;
        else mode = (B[cb] > T[ct]);
        if(mode == 0) {
            update(T[ct].se, +1);
            ct--;
        } else {
            lld vece = (query(MAXN-1)-query(sred[B[cb].se]))%2;
            int idx = B[cb].se;
            if(sred[idx] == 0) {
                if(vece == 1) rez += b[idx];
                else rez += a[idx];
            } else {
                if(vece == 1) rez += min(a[idx], b[idx]);
                else rez += max(a[idx], b[idx]);
            }
            cb--;
        }
    }
    cout << rez << endl;
}

Subtask #1
4.0 / 4.0

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

Subtask #2
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 4 ms 504 KB Output is correct
4 Correct 4 ms 504 KB Output is correct
5 Correct 4 ms 504 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 3 ms 508 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 3 ms 508 KB Output is correct
13 Correct 3 ms 504 KB Output is correct
14 Correct 15 ms 1528 KB Output is correct
15 Correct 29 ms 2676 KB Output is correct
16 Correct 45 ms 3400 KB Output is correct
17 Correct 62 ms 4848 KB Output is correct
18 Correct 66 ms 4700 KB Output is correct
19 Correct 59 ms 4696 KB Output is correct
20 Correct 62 ms 4724 KB Output is correct
21 Correct 56 ms 4708 KB Output is correct
22 Correct 39 ms 4340 KB Output is correct
23 Correct 41 ms 4336 KB Output is correct
24 Correct 42 ms 4340 KB Output is correct
25 Correct 38 ms 4312 KB Output is correct
26 Correct 46 ms 4468 KB Output is correct
27 Correct 54 ms 4696 KB Output is correct
28 Correct 49 ms 4760 KB Output is correct
29 Incorrect 45 ms 4724 KB Output isn't correct

Subtask #3
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 3 ms 504 KB Output is correct
3 Correct 4 ms 504 KB Output is correct
4 Correct 4 ms 504 KB Output is correct
5 Correct 4 ms 504 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 3 ms 508 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 3 ms 508 KB Output is correct
13 Correct 3 ms 504 KB Output is correct
14 Correct 15 ms 1528 KB Output is correct
15 Correct 29 ms 2676 KB Output is correct
16 Correct 45 ms 3400 KB Output is correct
17 Correct 62 ms 4848 KB Output is correct
18 Correct 66 ms 4700 KB Output is correct
19 Correct 59 ms 4696 KB Output is correct
20 Correct 62 ms 4724 KB Output is correct
21 Correct 56 ms 4708 KB Output is correct
22 Correct 39 ms 4340 KB Output is correct
23 Correct 41 ms 4336 KB Output is correct
24 Correct 42 ms 4340 KB Output is correct
25 Correct 38 ms 4312 KB Output is correct
26 Correct 46 ms 4468 KB Output is correct
27 Correct 54 ms 4696 KB Output is correct
28 Correct 49 ms 4760 KB Output is correct
29 Incorrect 45 ms 4724 KB Output isn't correct