oj.uz

Submission #376091

# Submission time Handle Problem Language Result Execution time Memory
376091 2021-03-10T21:39:02 Z souvenir_vayne Examination (JOI19_examination) C++14
100 / 100
 766 ms 56148 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <chrono>
#define pb push_back
#define INF 0x3f3f3f3f
#define LINF 0x3f3f3f3f3f3f3f3f
#define endl '\n'
#define ll long long
#define f first
#define fin cin
#define fout cout
#define s second
#define FAST cin.tie(0), cout.tie(0), ios::sync_with_stdio(0)
#define debug(x) cout << "DEBUG " << x << endl
#define debug2(x, y) cout << "DEBUG " << x << " " << y << endl
#define debug3(x, y, z) cout << "DEBUG " << x << " " << y << " " << z<< endl
#define debug4(x, y, z, o) cout << "DEBUG " << x << " " << y << " " << z<< " " << o << endl
#define all(x) x.begin(), x.end()
#define left vadia
#define lb lower_bound
#define right puta
using namespace std;
using namespace __gnu_pbds;
void setIO(string s) {
  ios_base::sync_with_stdio(0); cin.tie(0);
  freopen((s+".in").c_str(),"r",stdin);
  freopen((s+".out").c_str( ),"w",stdout);
}
typedef pair<ll, ll> pii;
typedef vector<vector<char>> mat;
typedef pair<int, string> pis;
const ll mod = 1e9+7, MAXN = 1e5;
typedef vector<int> vi;
typedef pair<int, pair<int, int>> piii;

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

vector<int> seg[2][4*MAXN];

void update(int u, int id, int l, int r, int i, ll x) {

    if(l > i or r < i)
        return;

    seg[id][u].pb(x);
    if(l == r)
        return;

    int mid = (l + r)/2;
    update(2*u, id, l, mid, i, x);
    update(2*u+1, id, mid+1, r, i, x);

    return;
}

int query(int u, int id, int l, int r, int lq, int rq, ll x) {
    if(l >= lq && r <= rq)
        return lower_bound(seg[id][u].begin(), seg[id][u].end(), x) - seg[id][u].begin();
    if(lq > r or rq < l)
        return 0;
    int mid = (l + r) >> 1;
    return query(2*u, id, l, mid, lq, rq, x) + query(2*u+1, id, mid+1, r, lq, rq, x);
}

int32_t main() {

    FAST;
    int n, Q;
    cin >> n >> Q;

    vector<pii> v(n), v2(n);
    vector<int> compress;

    for(int i = 0; i < n; i++) {
        int a, b;
        cin >> a >> b;
        v[i].f = a + b, v[i].s = a;
        v2[i].f = a + b, v2[i].s = b;
    }

    sort(all(v));
    sort(all(v2));

    for(int i = 0; i < n; i++) {
        update(1, 0, 1, n, i+1, v[i].s);
        update(1, 1, 1, n, i+1, v2[i].s);
    }

    for(int i = 1; i < 4 * MAXN; i++) {
        sort(all(seg[0][i]));
        sort(all(seg[1][i]));
    }

    vector<qu> q(Q);

    for(int i = 0; i < Q; i++) {

        cin >> q[i].a >> q[i].b >> q[i].c;
        q[i].c = max(q[i].c, q[i].a + q[i].b);

        int ini = 0, mid, end = n, ans = n;

        while(ini <= end) {
            mid = (ini+end)>>1;
            if(v[mid].f >= q[i].c) {
                end = mid-1;
                ans = min(ans, mid);
            }
            else
                ini = mid+1;
        }

        mid = ans + 1;
        cout << n - mid + 1 - (query(1, 0, 1, n, mid, n, q[i].a) + query(1, 1, 1, n, mid, n, q[i].b)) << endl;

    }



}

Compilation message

examination.cpp: In function 'void setIO(std::string)':
examination.cpp:26:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   26 |   freopen((s+".in").c_str(),"r",stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
examination.cpp:27:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   27 |   freopen((s+".out").c_str( ),"w",stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 19180 KB Output is correct
2 Correct 14 ms 19180 KB Output is correct
3 Correct 15 ms 19180 KB Output is correct
4 Correct 14 ms 19180 KB Output is correct
5 Correct 15 ms 19180 KB Output is correct
6 Correct 14 ms 19180 KB Output is correct
7 Correct 25 ms 20076 KB Output is correct
8 Correct 25 ms 20076 KB Output is correct
9 Correct 26 ms 20076 KB Output is correct
10 Correct 23 ms 20076 KB Output is correct
11 Correct 23 ms 20076 KB Output is correct
12 Correct 22 ms 20076 KB Output is correct
13 Correct 30 ms 20076 KB Output is correct
14 Correct 26 ms 20076 KB Output is correct
15 Correct 26 ms 20076 KB Output is correct
16 Correct 23 ms 20076 KB Output is correct
17 Correct 22 ms 20224 KB Output is correct
18 Correct 22 ms 19948 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 752 ms 53796 KB Output is correct
2 Correct 741 ms 53860 KB Output is correct
3 Correct 735 ms 53716 KB Output is correct
4 Correct 578 ms 52968 KB Output is correct
5 Correct 595 ms 53140 KB Output is correct
6 Correct 367 ms 52308 KB Output is correct
7 Correct 710 ms 53716 KB Output is correct
8 Correct 685 ms 53940 KB Output is correct
9 Correct 620 ms 53752 KB Output is correct
10 Correct 508 ms 53076 KB Output is correct
11 Correct 485 ms 52820 KB Output is correct
12 Correct 261 ms 51924 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 752 ms 53796 KB Output is correct
2 Correct 741 ms 53860 KB Output is correct
3 Correct 735 ms 53716 KB Output is correct
4 Correct 578 ms 52968 KB Output is correct
5 Correct 595 ms 53140 KB Output is correct
6 Correct 367 ms 52308 KB Output is correct
7 Correct 710 ms 53716 KB Output is correct
8 Correct 685 ms 53940 KB Output is correct
9 Correct 620 ms 53752 KB Output is correct
10 Correct 508 ms 53076 KB Output is correct
11 Correct 485 ms 52820 KB Output is correct
12 Correct 261 ms 51924 KB Output is correct
13 Correct 678 ms 54228 KB Output is correct
14 Correct 741 ms 54084 KB Output is correct
15 Correct 766 ms 53908 KB Output is correct
16 Correct 557 ms 53360 KB Output is correct
17 Correct 559 ms 53460 KB Output is correct
18 Correct 378 ms 52436 KB Output is correct
19 Correct 695 ms 54100 KB Output is correct
20 Correct 713 ms 54120 KB Output is correct
21 Correct 668 ms 54228 KB Output is correct
22 Correct 509 ms 52940 KB Output is correct
23 Correct 508 ms 52832 KB Output is correct
24 Correct 252 ms 51924 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 19180 KB Output is correct
2 Correct 14 ms 19180 KB Output is correct
3 Correct 15 ms 19180 KB Output is correct
4 Correct 14 ms 19180 KB Output is correct
5 Correct 15 ms 19180 KB Output is correct
6 Correct 14 ms 19180 KB Output is correct
7 Correct 25 ms 20076 KB Output is correct
8 Correct 25 ms 20076 KB Output is correct
9 Correct 26 ms 20076 KB Output is correct
10 Correct 23 ms 20076 KB Output is correct
11 Correct 23 ms 20076 KB Output is correct
12 Correct 22 ms 20076 KB Output is correct
13 Correct 30 ms 20076 KB Output is correct
14 Correct 26 ms 20076 KB Output is correct
15 Correct 26 ms 20076 KB Output is correct
16 Correct 23 ms 20076 KB Output is correct
17 Correct 22 ms 20224 KB Output is correct
18 Correct 22 ms 19948 KB Output is correct
19 Correct 752 ms 53796 KB Output is correct
20 Correct 741 ms 53860 KB Output is correct
21 Correct 735 ms 53716 KB Output is correct
22 Correct 578 ms 52968 KB Output is correct
23 Correct 595 ms 53140 KB Output is correct
24 Correct 367 ms 52308 KB Output is correct
25 Correct 710 ms 53716 KB Output is correct
26 Correct 685 ms 53940 KB Output is correct
27 Correct 620 ms 53752 KB Output is correct
28 Correct 508 ms 53076 KB Output is correct
29 Correct 485 ms 52820 KB Output is correct
30 Correct 261 ms 51924 KB Output is correct
31 Correct 678 ms 54228 KB Output is correct
32 Correct 741 ms 54084 KB Output is correct
33 Correct 766 ms 53908 KB Output is correct
34 Correct 557 ms 53360 KB Output is correct
35 Correct 559 ms 53460 KB Output is correct
36 Correct 378 ms 52436 KB Output is correct
37 Correct 695 ms 54100 KB Output is correct
38 Correct 713 ms 54120 KB Output is correct
39 Correct 668 ms 54228 KB Output is correct
40 Correct 509 ms 52940 KB Output is correct
41 Correct 508 ms 52832 KB Output is correct
42 Correct 252 ms 51924 KB Output is correct
43 Correct 704 ms 56084 KB Output is correct
44 Correct 717 ms 56148 KB Output is correct
45 Correct 748 ms 56148 KB Output is correct
46 Correct 542 ms 54664 KB Output is correct
47 Correct 551 ms 54484 KB Output is correct
48 Correct 305 ms 52052 KB Output is correct
49 Correct 685 ms 56148 KB Output is correct
50 Correct 667 ms 56020 KB Output is correct
51 Correct 649 ms 55892 KB Output is correct
52 Correct 492 ms 54356 KB Output is correct
53 Correct 518 ms 53644 KB Output is correct