oj.uz

Submission #634176

# Submission time Handle Problem Language Result Execution time Memory
634176 2022-08-24T02:41:45 Z Spade1 Pairs (IOI07_pairs) C++14
60 / 100
 32 ms 3572 KB 
#include<bits/stdc++.h>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define ll long long
#define ld long double
#define st first
#define nd second
#define pb push_back
#define INF INT_MAX
using namespace std;

const int N = 2e5 + 10;

int a[N], fw[N];
pii c[N], e[N];

void update1(int i, int val) {
    if (i == 0) {
        fw[i] += val;
        return;
    }
    for (; i < N; i += i&-i) {
        fw[i] += val;
    }
}

int query1(int i) {
    if (i == 0) {
        return fw[i];
    }
    int ret = 0;
    for (; i > 0; i -= i&-i) {
        ret += fw[i];
    }
    return ret;
}

void solve() {
    int b, n, d, m; cin >> b >> n >> d >> m;
    ll ans = 0;
    if (b == 1) {
        for (int i = 0; i < n; ++i) cin >> a[i];
        sort(a, a+n);
        int l = 0;
        for (int i = 1; i < n; ++i) {
            while (a[i] - a[l] > d) l++;
            ans += (i-l);
        }
    }
    else if (b == 2) {
        for (int i = 0; i < n; ++i) cin >> c[i].st >> c[i].nd;
        for (int i = 0; i < n; ++i) {
            e[i].st = c[i].st - c[i].nd;
            e[i].nd = c[i].st + c[i].nd;
        }
        sort(e, e+n);
        int l = 0;
        update1(e[0].nd, 1);
        for (int i = 1; i < n; ++i) {
            while (e[i].st - e[l].st > d) {
                update1(e[l].nd, -1);
                l++;
            }
            ans += (query1(e[i].nd + d) - query1(max(0, e[i].nd - d - 1)));
            update1(e[i].nd, 1);
        }
    }
    else if (b == 3) {

    }
    cout << ans << '\n';
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(NULL);
    int t = 1;
//    cin >> t;
    while (t--) {
        solve();
    }
}

Subtask #1
6.0 / 6.0

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

Subtask #2
6.0 / 6.0

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

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1108 KB Output is correct
2 Correct 11 ms 980 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 1576 KB Output is correct
2 Correct 15 ms 1492 KB Output is correct

Subtask #5
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 1500 KB Output is correct
2 Correct 16 ms 1492 KB Output is correct
3 Correct 16 ms 1520 KB Output is correct

Subtask #6
7.0 / 7.0

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

Subtask #7
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 2488 KB Output is correct
2 Correct 24 ms 2464 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 2644 KB Output is correct
2 Correct 27 ms 2656 KB Output is correct
3 Correct 27 ms 2640 KB Output is correct
4 Correct 27 ms 2652 KB Output is correct

Subtask #9
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 3572 KB Output is correct
2 Correct 30 ms 3552 KB Output is correct
3 Correct 30 ms 3540 KB Output is correct
4 Correct 29 ms 3424 KB Output is correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #12
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #13
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -