oj.uz

답안 #731980

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
731980 2023-04-28T08:06:10 Z GrindMachine Pairs (IOI07_pairs) C++17
100 / 100
 1088 ms 16588 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

template<typename T>
struct fenwick {
    int siz;
    vector<T> tree;

    fenwick(int n) {
        siz = n;
        tree = vector<T>(n + 1);
    }

    int lsb(int x) {
        return x & -x;
    }

    void build(vector<T> &a, int n) {
        for (int i = 1; i <= n; ++i) {
            int par = i + lsb(i);
            tree[i] += a[i];

            if (par <= siz) {
                tree[par] += tree[i];
            }
        }
    }

    void pupd(int i, T v) {
        while (i <= siz) {
            tree[i] += v;
            i += lsb(i);
        }
    }

    T sum(int i) {
        T res = 0;

        while (i) {
            res += tree[i];
            i -= lsb(i);
        }

        return res;
    }

    T query(int l, int r) {
        if (l > r) return 0;
        T res = sum(r) - sum(l - 1);
        return res;
    }
};

void solve(int test_case)
{
    ll b, n, d, m; cin >> b >> n >> d >> m;

    if (b == 1) {
        vector<ll> a(n);
        rep(i, n) cin >> a[i];

        sort(all(a));

        ll ans = 0;
        ll ptr = 0;

        rep(i, n) {
            while (a[i] - a[ptr] > d) {
                ptr++;
            }

            ans += i - ptr;
        }

        cout << ans << endl;
    }

    else if (b == 2) {
        vector<pll> a(n);
        rep(i, n) cin >> a[i].ff >> a[i].ss;

        rep(i, n) {
            ll x = a[i].ff + a[i].ss;
            ll y = a[i].ff - a[i].ss;
            a[i] = {x, y + m};
        }

        map<ll, vector<pll>> mp;

        for (auto [x, y] : a) {
            mp[x].pb({y, 1});
        }

        for (auto [x, y] : a) {
            mp[x - d - 1].pb({y, -1});
        }

        fenwick<ll> fenw(2 * m + 5);
        ll ans = 0;

        for (auto [x, v] : mp) {
            for (auto [y, c] : v) {
                ll l = max(y - d, 1ll), r = min(y + d, 2 * m);
                ans += fenw.query(l, r) * c;
                if (c == 1) {
                    fenw.pupd(y, 1);
                }
            }
        }

        cout << ans << endl;
    }

    else {
        vector<pll> here[m + 5];
        rep(i, n) {
            ll x, y, z; cin >> x >> y >> z;
            here[z].pb({x + y, x - y + m});
        }

        ll ans = 0;

        rep1(z1, m) {
            for (int z2 = z1 + 1; z2 <= m; ++z2) {
                ll d2 = d - (z2 - z1);
                if (d2 < 0) conts;

                map<ll, vector<pll>> mp;

                for (auto [x, y] : here[z1]) {
                    mp[x].pb({y, 0});
                }

                for (auto [x, y] : here[z2]) {
                    mp[x + d2].pb({y, 1});
                    mp[x - d2 - 1].pb({y, -1});
                }

                fenwick<ll> fenw(2 * m + 5);

                for (auto [x, v] : mp) {
                    for (auto [y, c] : v) {
                        if (c == 0) {
                            fenw.pupd(y, 1);
                        }
                        else {
                            ll l = max(y - d2, 1ll), r = min(y + d2, 2 * m);
                            ans += fenw.query(l, r) * c;
                        }
                    }
                }
            }
        }

        rep1(z, m) {
            auto a = here[z];
            map<ll, vector<pll>> mp;

            for (auto [x, y] : a) {
                mp[x].pb({y, 1});
            }

            for (auto [x, y] : a) {
                mp[x - d - 1].pb({y, -1});
            }

            fenwick<ll> fenw(2 * m + 5);

            for (auto [x, v] : mp) {
                for (auto [y, c] : v) {
                    ll l = max(y - d, 1ll), r = min(y + d, 2 * m);
                    ans += fenw.query(l, r) * c;
                    if (c == 1) {
                        fenw.pupd(y, 1);
                    }
                }
            }
        }

        cout << ans << endl;

        // rep(i, n) {
        //     for (int j = i + 1; j < n; ++j) {
        //         ll dis = 0;
        //         rep(k, b) {
        //             dis += abs(a[i][k] - a[j][k]);
        //         }

        //         ans += (dis <= d);
        //     }
        // }

        // cout << ans << endl;
    }
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 1108 KB Output is correct
2 Correct 15 ms 1108 KB Output is correct

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 1108 KB Output is correct
2 Correct 20 ms 1108 KB Output is correct

Subtask #5
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 1108 KB Output is correct
2 Correct 26 ms 1108 KB Output is correct
3 Correct 16 ms 1108 KB Output is correct

Subtask #6
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1620 KB Output is correct
2 Correct 2 ms 1620 KB Output is correct

Subtask #7
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 6112 KB Output is correct
2 Correct 34 ms 6308 KB Output is correct

Subtask #8
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 62 ms 7352 KB Output is correct
2 Correct 41 ms 7508 KB Output is correct
3 Correct 48 ms 7212 KB Output is correct
4 Correct 39 ms 6920 KB Output is correct

Subtask #9
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 136 ms 15436 KB Output is correct
2 Correct 158 ms 16588 KB Output is correct
3 Correct 60 ms 8776 KB Output is correct
4 Correct 48 ms 8524 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 340 KB Output is correct
2 Correct 21 ms 364 KB Output is correct

Subtask #11
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 2940 KB Output is correct
2 Correct 87 ms 3076 KB Output is correct
3 Correct 85 ms 3544 KB Output is correct

Subtask #12
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 260 ms 2356 KB Output is correct
2 Correct 775 ms 3192 KB Output is correct
3 Correct 758 ms 3196 KB Output is correct

Subtask #13
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 655 ms 2696 KB Output is correct
2 Correct 1018 ms 3544 KB Output is correct
3 Correct 1088 ms 3560 KB Output is correct