oj.uz

답안 #736291

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
736291 2023-05-05T12:04:04 Z Vanilla Examination (JOI19_examination) C++17
100 / 100
 799 ms 458892 KB 
#include <bits/stdc++.h>
#include <fstream>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
struct custom_hash {static uint64_t splitmix64(uint64_t x) {x += 0x9e3779b97f4a7c15;x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;x = (x ^ (x >> 27)) * 0x94d049bb133111eb;return x ^ (x >> 31);}size_t operator()(uint64_t x) const {static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();return splitmix64(x + FIXED_RANDOM);}};
// string __fname = ""; ifstream in (__fname + ".in"); ofstream out (__fname + ".out"); 
// #define cin in 
// #define cout out
#define int64 long long
#define uint64 unsigned long long
#define x first
#define y second
#define pb push_back
#define pii pair <int, int> 
#define pii64 pair <int64, int64>
#define db(x) cout << "> " << #x << ": " << (x) << "\n"
#define qr queries()
#define yn(x) if (x) {ctn("Yes");}else {ctn("No");}
void solve(int);
void queries(){int n;cin >> n;for (int i = 1; i <= n; i++) solve(i);}
template<class T>T ceildiv(T a, T b) {return a / b + !!(a % b);}
template<class T>T gcd (T a, T b){return (b ? gcd(b, a % b): a);}
template<class T>T lcm (T a, T b){return a * b / gcd(a, b);}
// // // // // // // // // // // // // // // // // // // // // // 
/*                  TEMPLATE - VANILLA                         */
// // // // // // // // // // // // // // // // // // // // // //
const int ddx[] = {-1, -1, 0, 1, 1, 1, 0, -1};
const int ddy[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
const double pi = 3.14159265359;
const double eps = 1e-6;
const int64 hash_inv = 940594066;
const int64 hash_p = 101;
const int64 mod = 1e9 + 7;
const int maxn = 2e5 + 2;
const int maxv = 2e9 + 2;
pii a [maxn];
int rs [maxn];

void solve(int id){
    
    return;
}

struct node {
    int l,r;
    int64 v;

    node* left = NULL;
    node* right = NULL;

    node(int _l, int _r, int64 _v): l(_l), r(_r), v(_v) {};
    
    inline void extend() {
        if (left != NULL) return;
        int mid = (l + r) / 2;
        left = new node(l, mid, 0);
        right = new node(mid + 1, r, 0);
    }

    inline int64 query (int il, int ir) {
        if (il <= l && r <= ir) return v;
        if (l > ir || r < il) return 0;
        extend();
        return left->query(il, ir) + right->query(il, ir);
    }

    inline void update (int x, int64 nval) {
        if (l == r && l == x) return void(v+=nval);
        if (l > x || r < x) return;
        extend();
        left->update(x, nval);
        right->update(x, nval);
        v = left->v + right->v;
    }
};

struct event {
    int type;
    int x;
    int l;
    int r;
    int idx;

    bool operator < (const event& oth) const {
        if (x != oth.x) return x > oth.x;
        return type < oth.type;
    }
};


int main(){
    ios_base::sync_with_stdio(0); cin.tie(0); cout << fixed; cout << setprecision(10); 
    node* xsg = new node (0, maxv, 0), *ysg = new node (0, maxv, 0);
    vector <event> sl;
    int n,q;
    cin >> n >> q;
    for (int i = 0; i < n; i++){
        cin >> a[i].x >> a[i].y;
        sl.push_back({0, a[i].x + a[i].y, a[i].x, a[i].y, -1});
    }
    for (int i = 0; i < q; i++){
        int x,y,z;
        cin >> x >> y >> z;
        sl.push_back({1, max(x + y, z), x, y, i});
    }
    sort(sl.begin(), sl.end());
    int sf = 0;
    for (auto& [t, x, l, r, idx]: sl) {
        // cout << t << " " << x << " " << l << " " << r << " " << idx << "\n";
        if (t == 0) {
            xsg->update(l, 1);
            ysg->update(r, 1);
            sf++;
        }
        else  {
            rs[idx] = xsg->query(l, maxv) + ysg->query(r, maxv) - sf;
        }
    }
    for (int i = 0; i < q; i++){
        cout << rs[i] << "\n";
    }
    return 0;
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 24 ms 19776 KB Output is correct
8 Correct 24 ms 19724 KB Output is correct
9 Correct 23 ms 19732 KB Output is correct
10 Correct 14 ms 10132 KB Output is correct
11 Correct 13 ms 10164 KB Output is correct
12 Correct 4 ms 596 KB Output is correct
13 Correct 29 ms 19680 KB Output is correct
14 Correct 24 ms 19736 KB Output is correct
15 Correct 30 ms 19756 KB Output is correct
16 Correct 12 ms 10164 KB Output is correct
17 Correct 12 ms 10164 KB Output is correct
18 Correct 4 ms 596 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 302 ms 24420 KB Output is correct
2 Correct 271 ms 24224 KB Output is correct
3 Correct 323 ms 24380 KB Output is correct
4 Correct 164 ms 15168 KB Output is correct
5 Correct 145 ms 15132 KB Output is correct
6 Correct 121 ms 6340 KB Output is correct
7 Correct 253 ms 23956 KB Output is correct
8 Correct 251 ms 23920 KB Output is correct
9 Correct 227 ms 23724 KB Output is correct
10 Correct 144 ms 15008 KB Output is correct
11 Correct 135 ms 14892 KB Output is correct
12 Correct 98 ms 6340 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 302 ms 24420 KB Output is correct
2 Correct 271 ms 24224 KB Output is correct
3 Correct 323 ms 24380 KB Output is correct
4 Correct 164 ms 15168 KB Output is correct
5 Correct 145 ms 15132 KB Output is correct
6 Correct 121 ms 6340 KB Output is correct
7 Correct 253 ms 23956 KB Output is correct
8 Correct 251 ms 23920 KB Output is correct
9 Correct 227 ms 23724 KB Output is correct
10 Correct 144 ms 15008 KB Output is correct
11 Correct 135 ms 14892 KB Output is correct
12 Correct 98 ms 6340 KB Output is correct
13 Correct 280 ms 24264 KB Output is correct
14 Correct 267 ms 24248 KB Output is correct
15 Correct 265 ms 24280 KB Output is correct
16 Correct 161 ms 15116 KB Output is correct
17 Correct 194 ms 15148 KB Output is correct
18 Correct 120 ms 6400 KB Output is correct
19 Correct 273 ms 24180 KB Output is correct
20 Correct 296 ms 24316 KB Output is correct
21 Correct 258 ms 23932 KB Output is correct
22 Correct 129 ms 14912 KB Output is correct
23 Correct 137 ms 14900 KB Output is correct
24 Correct 98 ms 6300 KB Output is correct

Subtask #4
57.0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 24 ms 19776 KB Output is correct
8 Correct 24 ms 19724 KB Output is correct
9 Correct 23 ms 19732 KB Output is correct
10 Correct 14 ms 10132 KB Output is correct
11 Correct 13 ms 10164 KB Output is correct
12 Correct 4 ms 596 KB Output is correct
13 Correct 29 ms 19680 KB Output is correct
14 Correct 24 ms 19736 KB Output is correct
15 Correct 30 ms 19756 KB Output is correct
16 Correct 12 ms 10164 KB Output is correct
17 Correct 12 ms 10164 KB Output is correct
18 Correct 4 ms 596 KB Output is correct
19 Correct 302 ms 24420 KB Output is correct
20 Correct 271 ms 24224 KB Output is correct
21 Correct 323 ms 24380 KB Output is correct
22 Correct 164 ms 15168 KB Output is correct
23 Correct 145 ms 15132 KB Output is correct
24 Correct 121 ms 6340 KB Output is correct
25 Correct 253 ms 23956 KB Output is correct
26 Correct 251 ms 23920 KB Output is correct
27 Correct 227 ms 23724 KB Output is correct
28 Correct 144 ms 15008 KB Output is correct
29 Correct 135 ms 14892 KB Output is correct
30 Correct 98 ms 6340 KB Output is correct
31 Correct 280 ms 24264 KB Output is correct
32 Correct 267 ms 24248 KB Output is correct
33 Correct 265 ms 24280 KB Output is correct
34 Correct 161 ms 15116 KB Output is correct
35 Correct 194 ms 15148 KB Output is correct
36 Correct 120 ms 6400 KB Output is correct
37 Correct 273 ms 24180 KB Output is correct
38 Correct 296 ms 24316 KB Output is correct
39 Correct 258 ms 23932 KB Output is correct
40 Correct 129 ms 14912 KB Output is correct
41 Correct 137 ms 14900 KB Output is correct
42 Correct 98 ms 6300 KB Output is correct
43 Correct 783 ms 458892 KB Output is correct
44 Correct 799 ms 458892 KB Output is correct
45 Correct 777 ms 458728 KB Output is correct
46 Correct 389 ms 233388 KB Output is correct
47 Correct 380 ms 233336 KB Output is correct
48 Correct 122 ms 7172 KB Output is correct
49 Correct 754 ms 441880 KB Output is correct
50 Correct 758 ms 441976 KB Output is correct
51 Correct 718 ms 425160 KB Output is correct
52 Correct 366 ms 233344 KB Output is correct
53 Correct 324 ms 232344 KB Output is correct