oj.uz

Submission #453195

# Submission time Handle Problem Language Result Execution time Memory
453195 2021-08-04T08:53:16 Z prvocislo Pairs (IOI07_pairs) C++17
27 / 100
 599 ms 31756 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
typedef long long ll;
using namespace std;

const int maxn = 1.5e5 + 5;
vector<int> st[maxn * 2];
void upd(int x, int y)
{
    for (x += maxn; x > 0; x >>= 1) st[x].push_back(y);
}
int query1d(int y1, int y2, int vr) { return upper_bound(st[vr].begin(), st[vr].end(), y2) - lower_bound(st[vr].begin(), st[vr].end(), y1); }
int query(int x1, int y1, int x2, int y2)
{
    int ans = 0;
    for (x1 += maxn, x2 += maxn + 1; x1 < x2; x1 >>= 1, x2 >>= 1)
    {
        if (x1 & 1) ans += query1d(y1, y2, x1++);
        if (x2 & 1) ans += query1d(y1, y2, --x2);
    }
    return ans;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int b, n, d, m;
    cin >> b >> n >> d >> m;
    vector<int> x(n), y(n);
    for (int i = 0; i < n; i++)
    {
        if (b == 1) cin >> y[i];
        else
        {
            int x1, y1; cin >> x1 >> y1;
            x[i] = x1 + y1, y[i] = x1 - y1;
        }
        upd(x[i], y[i]);
    }
    for (int i = 0; i < maxn * 2; i++) sort(st[i].begin(), st[i].end());
    ll ans = 0;
    for (int i = 0; i < n; i++)
    {
        ans += query(x[i] - d, y[i] - d, x[i] + d, y[i] + d);
    }
    cout << (ans - n) / 2 << "\n";
    return 0;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 7316 KB Output is correct
2 Correct 8 ms 7256 KB Output is correct

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Runtime error 16 ms 14860 KB Execution killed with signal 11

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 172 ms 15748 KB Output is correct
2 Correct 156 ms 15740 KB Output is correct

Subtask #4
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 206 ms 16224 KB Output is correct
2 Runtime error 228 ms 31756 KB Execution killed with signal 11

Subtask #5
0 / 6.0

# Verdict Execution time Memory Grader output
1 Runtime error 217 ms 31712 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7628 KB Output is correct
2 Runtime error 17 ms 15260 KB Execution killed with signal 11

Subtask #7
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 225 ms 16744 KB Output is correct
2 Correct 166 ms 16732 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 307 ms 17676 KB Output is correct
2 Correct 303 ms 17680 KB Output is correct
3 Correct 292 ms 17772 KB Output is correct
4 Correct 296 ms 17608 KB Output is correct

Subtask #9
0 / 8.0

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

Subtask #10
0 / 10.0

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

Subtask #11
0 / 10.0

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

Subtask #12
0 / 10.0

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

Subtask #13
0 / 10.0

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