oj.uz

Submission #578351

# Submission time Handle Problem Language Result Execution time Memory
578351 2022-06-16T12:12:04 Z OttoTheDino Examination (JOI19_examination) C++17
43 / 100
 3000 ms 307168 KB 
#include <bits/stdc++.h>
using namespace std;

#define rep(i,s,e)                  for (int i = s; i <= e; ++i)
#define rrep(i,s,e)                 for (int i = s; i >= e; --i)
#define pb                          push_back
#define pf                          push_front
#define fi                          first
#define se                          second
#define aint(a)                      a.begin(), a.end()
#define len(a)                      (int)a.size()
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<int> vint;

unordered_map<int,int> seg_tree[2] = {};
unordered_map<int,int> lazy[2] = {};
 
void upd (int tp, int val, int l, int r, int bl, int br, int id) {
    seg_tree[tp][id] += val;
    if (l==bl && r==br) {
        lazy[tp][id] += val;
        return;
    }
    int mid = (bl+br)/2;
    if (r<=mid) upd (tp, val, l, r, bl, mid, 2*id);
    else if (l>mid) upd (tp, val, l, r, mid+1, br, 2*id+1);
    else {
        upd (tp, val, l, mid, bl, mid, 2*id);
        upd (tp, val, mid+1, r, mid+1, br, 2*id+1);
    }
} 
 
int query (int tp, int l, int r, int bl, int br, int id) {
    if (l==bl && r==br) return seg_tree[tp][id];
    if (bl!=br) {
        lazy[tp][2*id] += lazy[tp][id];
        lazy[tp][2*id+1] += lazy[tp][id];
        seg_tree[tp][2*id] += lazy[tp][id];
        seg_tree[tp][2*id+1] += lazy[tp][id];
        lazy[tp][id] = 0;
    }
    int mid = (bl+br)/2;
    if (r<=mid) return query (tp, l, r, bl, mid, 2*id);
    if (l>mid) return query (tp, l, r, mid+1, br, 2*id+1);
    return query (tp, l, mid, bl, mid, 2*id) + query (tp, mid+1, r, mid+1, br, 2*id+1);
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    
    int n, q, x = 0; cin >> n >> q;

    vector<pair<int,ii>> peep;
    vector<pair<ii,ii>> ques;
    int ans[q+1];

    rep (i,1,n) {
        int a, b; cin >> a >> b;
        peep.pb({a+b,{a,b}});
    }

    rep (i,1,q) {
        int a, b, c; cin >> a >> b >> c;
        ques.pb({{max(a+b,c),i},{a,b}});
    }

    sort(aint(ques));
    reverse(aint(ques));
    sort(aint(peep));
    reverse(aint(peep));

    rep (i,0,q-1) {
        int c = ques[i].fi.fi, a = ques[i].se.fi, b = ques[i].se.se, u = ques[i].fi.se;
        while (x < n && peep[x].fi>=c) {
            upd (0, 1, peep[x].se.fi, peep[x].se.fi, 0, 1e9, 1);
            upd (1, 1, peep[x].se.se, peep[x].se.se, 0, 1e9, 1);
            x++;
        }
        ans[u] = query(0,a,1e9,0,1e9,1) + query(1,b,1e9,0,1e9,1) - x;
    }

    rep (i,1,q) cout << ans[i] << "\n";

    return 0;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 164 ms 22316 KB Output is correct
8 Correct 163 ms 22328 KB Output is correct
9 Correct 165 ms 22236 KB Output is correct
10 Correct 86 ms 11352 KB Output is correct
11 Correct 85 ms 11312 KB Output is correct
12 Correct 44 ms 492 KB Output is correct
13 Correct 157 ms 22220 KB Output is correct
14 Correct 154 ms 22196 KB Output is correct
15 Correct 162 ms 22280 KB Output is correct
16 Correct 71 ms 11396 KB Output is correct
17 Correct 71 ms 11332 KB Output is correct
18 Correct 34 ms 468 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1835 ms 38228 KB Output is correct
2 Correct 1793 ms 38172 KB Output is correct
3 Correct 1765 ms 38292 KB Output is correct
4 Correct 1198 ms 21296 KB Output is correct
5 Correct 1167 ms 21288 KB Output is correct
6 Correct 1378 ms 5044 KB Output is correct
7 Correct 1642 ms 30852 KB Output is correct
8 Correct 1627 ms 30912 KB Output is correct
9 Correct 1472 ms 22992 KB Output is correct
10 Correct 868 ms 21204 KB Output is correct
11 Correct 868 ms 21244 KB Output is correct
12 Correct 1080 ms 4936 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1835 ms 38228 KB Output is correct
2 Correct 1793 ms 38172 KB Output is correct
3 Correct 1765 ms 38292 KB Output is correct
4 Correct 1198 ms 21296 KB Output is correct
5 Correct 1167 ms 21288 KB Output is correct
6 Correct 1378 ms 5044 KB Output is correct
7 Correct 1642 ms 30852 KB Output is correct
8 Correct 1627 ms 30912 KB Output is correct
9 Correct 1472 ms 22992 KB Output is correct
10 Correct 868 ms 21204 KB Output is correct
11 Correct 868 ms 21244 KB Output is correct
12 Correct 1080 ms 4936 KB Output is correct
13 Correct 1740 ms 38996 KB Output is correct
14 Correct 1834 ms 38292 KB Output is correct
15 Correct 1786 ms 38280 KB Output is correct
16 Correct 1309 ms 21224 KB Output is correct
17 Correct 1310 ms 21248 KB Output is correct
18 Correct 1377 ms 4980 KB Output is correct
19 Correct 1707 ms 38308 KB Output is correct
20 Correct 1869 ms 38216 KB Output is correct
21 Correct 1883 ms 31892 KB Output is correct
22 Correct 876 ms 21240 KB Output is correct
23 Correct 859 ms 21160 KB Output is correct
24 Correct 1061 ms 5064 KB Output is correct

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 164 ms 22316 KB Output is correct
8 Correct 163 ms 22328 KB Output is correct
9 Correct 165 ms 22236 KB Output is correct
10 Correct 86 ms 11352 KB Output is correct
11 Correct 85 ms 11312 KB Output is correct
12 Correct 44 ms 492 KB Output is correct
13 Correct 157 ms 22220 KB Output is correct
14 Correct 154 ms 22196 KB Output is correct
15 Correct 162 ms 22280 KB Output is correct
16 Correct 71 ms 11396 KB Output is correct
17 Correct 71 ms 11332 KB Output is correct
18 Correct 34 ms 468 KB Output is correct
19 Correct 1835 ms 38228 KB Output is correct
20 Correct 1793 ms 38172 KB Output is correct
21 Correct 1765 ms 38292 KB Output is correct
22 Correct 1198 ms 21296 KB Output is correct
23 Correct 1167 ms 21288 KB Output is correct
24 Correct 1378 ms 5044 KB Output is correct
25 Correct 1642 ms 30852 KB Output is correct
26 Correct 1627 ms 30912 KB Output is correct
27 Correct 1472 ms 22992 KB Output is correct
28 Correct 868 ms 21204 KB Output is correct
29 Correct 868 ms 21244 KB Output is correct
30 Correct 1080 ms 4936 KB Output is correct
31 Correct 1740 ms 38996 KB Output is correct
32 Correct 1834 ms 38292 KB Output is correct
33 Correct 1786 ms 38280 KB Output is correct
34 Correct 1309 ms 21224 KB Output is correct
35 Correct 1310 ms 21248 KB Output is correct
36 Correct 1377 ms 4980 KB Output is correct
37 Correct 1707 ms 38308 KB Output is correct
38 Correct 1869 ms 38216 KB Output is correct
39 Correct 1883 ms 31892 KB Output is correct
40 Correct 876 ms 21240 KB Output is correct
41 Correct 859 ms 21160 KB Output is correct
42 Correct 1061 ms 5064 KB Output is correct
43 Execution timed out 3092 ms 307168 KB Time limit exceeded
44 Halted 0 ms 0 KB -