oj.uz

Submission #964638

# Submission time Handle Problem Language Result Execution time Memory
964638 2024-04-17T08:48:07 Z Esgeer Pairs (IOI07_pairs) C++17
60 / 100
 3932 ms 16660 KB 
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <unistd.h>
using namespace __gnu_pbds;
template <class T>
using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#ifndef Local
    #pragma GCC optimize("O3,unroll-loops")
#endif
#define int long long
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define vpi vector<pii>
#define vvpi vector<vpi>
#define vb vector<bool>
#define vvb vector<vb>
#define endl '\n'
#define sp << " " <<
#define F(i, s, n) for(int i = s; i < (int) n; i++)
#define pb push_back
#define fi first
#define se second

int mod = 1e9+7;
int inf = 1e6;
const int N = 3e5;

int t[N];

template<typename T> struct bit2d {
    vector<T> bit;
    vi xs;
    vi st;
    vi cnt;
    int n, alllen;
    void init(int N, vpi Q) {
        n = N;
        cnt.assign(N+1, 0);
        st.resize(N+1);
        sort(Q.begin(), Q.end(), [](pii &a, pii &b) { return a.se > b.se; });
        F(i, 0, Q.size()) {
            for(int j = Q[i].fi; j > 0 && j < N; j += (j & -j)) cnt[j]++;
        }
        st[0] = cnt[0]+1;
        F(i, 1, N) {
            st[i] = st[i-1] + cnt[i];
        }
        alllen = st[N-1];
        xs.assign(alllen+3, 0);
        bit.assign(alllen+3, 0);
        F(i, 0, Q.size()) {
            for(int j = Q[i].fi; j > 0 && j < N; j += (j & -j)) xs[--st[j]] = Q[i].se;
        }
    }

    int find(int y, int el) {
        return upper_bound(xs.begin() + st[y], xs.begin() + st[y] + cnt[y], el) - xs.begin() - st[y];
    }

    void update(int y, int x, T el) {
        while(y > 0 && y < n) {
            //cout << y sp x sp find(y, x) sp cnt[y] << endl;
            for(int i = find(y, x); i > 0 && i <= cnt[y]; i += (i & -i)) {
                //cout << y sp i << endl;
                bit[i + st[y]] += el;
            }
            y += (y & -y);
        }
    }

    T query(int y, int x) {
        T res = T();
        while(y > 0 && y < n) {
            //cout << y sp x sp find(y, x) sp cnt[y] << endl;
            for(int i = find(y, x); i > 0 && i <= cnt[y]; i -= (i & -i)) {
                //cout << y sp i << endl;
                res += bit[i + st[y]];
            }
            y -= (y & -y);
        }
        return res;
    }
};

void solve() {
    int d, n, k, m;
    cin >> d >> n >> k >> m;
    if(d == 1) {
        vi a(n);
        F(i, 0, n) cin >> a[i];
        sort(a.begin(), a.end());
        queue<int> last;
        int ans = 0;
        F(i, 0, n) {
            while(last.size() && last.front() < a[i] - k) last.pop();
            ans += last.size();
            last.push(a[i]);
        }
        cout << ans << endl;
    } else if(d == 2) {
        vpi a(n);
        F(i, 0, n) cin >> a[i].fi >> a[i].se;
        F(i, 0, n) {
            int y = a[i].fi, x = a[i].se;
            a[i].fi = x - y;
            a[i].se = x + y;
        }
        sort(a.begin(), a.end());
        Tree<pii> st;
        int ans = 0;
        queue<int> q;
        F(i, 0, n) {
            while(q.size() && a[q.front()].fi < a[i].fi - k) {
                st.erase({a[q.front()].se, q.front()});
                q.pop();
            }
            ans += st.order_of_key({a[i].se + k, inf}) - st.order_of_key({a[i].se - k, -1});
            st.insert({a[i].se, i});
            q.push(i);
        }
        cout << ans << endl;
    } else if(d == 3) {
        vector<pair<int, pii>> a(n);
        F(i, 0, n) {
            cin >> a[i].se.fi >> a[i].se.se >> a[i].fi;
            int y = a[i].se.fi, x = a[i].se.se;
            a[i].se.fi = x + y;
            a[i].se.se = x - y + m;
        }
        sort(a.begin(), a.end());
        vpi Q[305];
        F(i, 0, n) Q[a[i].fi].pb({a[i].se.fi, a[i].se.se});
        bit2d<int> bit[305];
        F(i, 0, 305) bit[i].init(4*m, Q[i]);
        int ans = 0;
        queue<int> q;
        F(i, 0, n) {
            //while(q.size() && a[q.front()].fi < a[i].fi - )
            F(z, 0, 305) {
                int nk = k - abs(z - a[i].fi);
                if(nk < 0) continue;
                ans += bit[z].query(a[i].se.fi + nk, a[i].se.se + nk) - bit[z].query(a[i].se.fi + nk, a[i].se.se - nk - 1) - bit[z].query(a[i].se.fi - nk - 1, a[i].se.se + nk) + bit[z].query(a[i].se.fi - nk - 1, a[i].se.se - nk - 1);
            }
            q.push(i);
            bit[a[i].fi].update(a[i].se.fi, a[i].se.se, 1);
        }
        cout << ans << endl;
    }
}

void setIO() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    #ifdef Local
        freopen("local.in", "r", stdin);
        freopen("local.out", "w", stdout);
    #else 
        // freopen("friendcross.in","r",stdin);
        // freopen("friendcross.out","w",stdout);
    #endif
}

signed main() {
    setIO();
    int t = 1;
    //cin >> t;
    while(t--) solve();
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1112 KB Output is correct
2 Correct 11 ms 1884 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 1296 KB Output is correct
2 Correct 14 ms 1880 KB Output is correct

Subtask #5
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 1112 KB Output is correct
2 Correct 14 ms 1372 KB Output is correct
3 Correct 14 ms 1372 KB Output is correct

Subtask #6
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 344 KB Output is correct

Subtask #7
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 2428 KB Output is correct
2 Correct 58 ms 8924 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 2688 KB Output is correct
2 Correct 94 ms 5980 KB Output is correct
3 Correct 83 ms 4692 KB Output is correct
4 Correct 83 ms 4948 KB Output is correct

Subtask #9
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 2644 KB Output is correct
2 Correct 92 ms 5684 KB Output is correct
3 Correct 69 ms 5532 KB Output is correct
4 Correct 67 ms 5260 KB Output is correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 1884 KB Output is correct
2 Incorrect 11 ms 2108 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 154 ms 11972 KB Output is correct
2 Correct 227 ms 11868 KB Output is correct
3 Incorrect 206 ms 11884 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #12
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1197 ms 14744 KB Output is correct
2 Correct 3268 ms 14764 KB Output is correct
3 Incorrect 731 ms 14536 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #13
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3357 ms 16660 KB Output is correct
2 Correct 3932 ms 16096 KB Output is correct
3 Incorrect 1150 ms 16416 KB Output isn't correct
4 Halted 0 ms 0 KB -