oj.uz

Submission #778366

# Submission time Handle Problem Language Result Execution time Memory
778366 2023-07-10T08:55:15 Z fve5 Pairs (IOI07_pairs) C++17
100 / 100
 177 ms 9464 KB 
#include <bits/stdc++.h>
using namespace std;

struct Fenwick {
    vector<int> arr;
    
    void add(int x, int d) {
        for (; x < arr.size(); x += x & -x)
            arr[x] += d;
    }
    
    int query(int x) {
        int ans = 0;
        for (; x; x -= x & -x)
            ans += arr[x];
        return ans;
    }
    
    Fenwick(int size) : arr(size) { }  
};

void _1D(int N, int D, int M) {
    vector<int> animals(N);
    for (auto &x: animals) cin >> x;
    sort(animals.begin(), animals.end());
    
    long long ans = 0;
    queue<int> in_range;
    for (auto x: animals) {
        while (!in_range.empty() && x - in_range.front() > D) {
            in_range.pop();
        }
        ans += in_range.size();
        in_range.push(x);
    }
    cout << ans << '\n';
}

void _2D(int N, int D, int M) {
    vector<pair<int, int>> animals(N);
    for (auto &[x, y]: animals) {
        int i, j; cin >> i >> j;
        x = i + j - 1;
        y = j - i + M;
    }
    
    sort(animals.begin(), animals.end());
    Fenwick fenwick(2 * M);
    
    long long ans = 0;
    queue<pair<int, int>> in_range;
    for (auto [x, y]: animals) {
        while (!in_range.empty() && x - in_range.front().first > D) {
            fenwick.add(in_range.front().second, -1);
            in_range.pop();
        }
        ans += fenwick.query(min(2 * M - 1, y + D)) - fenwick.query(max(0, y - D - 1));
        in_range.push({x, y});
        fenwick.add(y, 1);
    }
    cout << ans << '\n';
}

void _3D(int N, int D, int M) {
    vector<tuple<int, int, int>> animals(N);
    vector prefix_sums(M + 1, vector(2 * M, vector(2 * M, 0)));
    for (auto &[x, y, z]: animals) {
        int i, j, k; cin >> i >> j >> k;
        x = i + j - 1;
        y = j - i + M;
        z = k;
        
        prefix_sums[z][x][y]++;
    }
    
    for (int k = 1; k <= M; k++) {
        for (int i = 1; i < 2 * M; i++) {
            for (int j = 1; j < 2 * M; j++) {
                prefix_sums[k][i][j] += prefix_sums[k][i - 1][j] + prefix_sums[k][i][j - 1] - prefix_sums[k][i - 1][j - 1];
            }
        }
    }
    
    long long ans = 0;
    for (auto [x, y, z]: animals) {
        for (int curr_z = max(1, z - D); curr_z <= min(M, z + D); curr_z++) {
            int off = abs(z - curr_z);
            ans += prefix_sums[curr_z][min(2 * M - 1, x + D - off)][min(2 * M - 1, y + D - off)]
                 - prefix_sums[curr_z][min(2 * M - 1, x + D - off)][max(0, y - D + off - 1)]
                 - prefix_sums[curr_z][max(0, x - D + off - 1)][min(2 * M - 1, y + D - off)]
                 + prefix_sums[curr_z][max(0, x - D + off - 1)][max(0, y - D + off - 1)];
        } 
    }
    cout << (ans - N) / 2 << endl;
}

int main() {
    int B, N, D, M; cin >> B >> N >> D >> M;
    
    if (B == 1) _1D(N, min(D, B * M), M);
    if (B == 2) _2D(N, min(D, B * M), M);
    if (B == 3) _3D(N, min(D, B * M), M);
}

Compilation message

pairs.cpp: In member function 'void Fenwick::add(int, int)':
pairs.cpp:8:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 |         for (; x < arr.size(); x += x & -x)
      |                ~~^~~~~~~~~~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
6.0 / 6.0

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

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 1068 KB Output is correct
2 Correct 21 ms 1364 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 1552 KB Output is correct
2 Correct 32 ms 1948 KB Output is correct

Subtask #5
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 1456 KB Output is correct
2 Correct 39 ms 1576 KB Output is correct
3 Correct 40 ms 1564 KB Output is correct

Subtask #6
7.0 / 7.0

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

Subtask #7
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 1652 KB Output is correct
2 Correct 36 ms 2352 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 1828 KB Output is correct
2 Correct 44 ms 2228 KB Output is correct
3 Correct 45 ms 2228 KB Output is correct
4 Correct 47 ms 2096 KB Output is correct

Subtask #9
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 2864 KB Output is correct
2 Correct 58 ms 3112 KB Output is correct
3 Correct 60 ms 3372 KB Output is correct
4 Correct 55 ms 3088 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7340 KB Output is correct
2 Correct 9 ms 7380 KB Output is correct

Subtask #11
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 2004 KB Output is correct
2 Correct 40 ms 1984 KB Output is correct
3 Correct 39 ms 2128 KB Output is correct

Subtask #12
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 6000 KB Output is correct
2 Correct 90 ms 6016 KB Output is correct
3 Correct 68 ms 6024 KB Output is correct

Subtask #13
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 177 ms 9460 KB Output is correct
2 Correct 148 ms 9452 KB Output is correct
3 Correct 114 ms 9464 KB Output is correct