oj.uz

Submission #786464

# Submission time Handle Problem Language Result Execution time Memory
786464 2023-07-18T08:07:58 Z danikoynov Pairs (IOI07_pairs) C++14
37 / 100
 4000 ms 2648 KB 
#include<bits/stdc++.h>
#define endl '\n'

using namespace std;
typedef long long ll;

void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}

const int maxn = 1e5 + 10;

struct point
{
    int x, y, z;

    point(int _x = 0, int _y = 0, int _z = 0)
    {
        x = _x;
        y = _y;
        z = _z;
    }
}p[maxn], s[maxn];

bool cmp(point p1, point p2)
{
    if (p1.x != p2.x)
    return p1.x < p2.x;
    if (p1.y != p2.y)
        return p1.y < p2.y;
    return p1.z < p2.z;
}

struct fenwick_1d
{
    int fen[75010];

    void update(int pos, int val)
    {

    }
};
int b, n, d, m;
void solve()
{
    cin >> b >> n >> d >> m;
    for (int i = 1; i <= n; i ++)
    {
        cin >> p[i].x;
        if (b >= 2)
            cin >> p[i].y;
        if (b == 3)
            cin >> p[i].z;
    }

    if (b == 1)
    {
        sort(p + 1, p + n + 1, cmp);
        int pt = 1;
        ll ans = 0;
        for (int i = 1; i <= n; i ++)
        {
            while(p[i].x - p[pt].x > d)
                pt ++;
                ///cout << i << " : " << p[i].x << " " << pt << endl;
            ans += (ll)(i - pt);
        }
        cout << ans << endl;
    }
    else
    if (b == 2)
    {
        for (int i = 1; i <= n; i ++)
        {
            s[i].x = p[i].x - p[i].y;
            s[i].y = p[i].x + p[i].y;
        }

        ll ans = 0;
        for (int i = 1; i <= n; i ++)
            for (int j = i + 1; j <= n; j ++)
            if (abs(s[i].x - s[j].x) <= d && abs(s[i].y - s[j].y) <= d)
                ans ++;
        cout << ans << endl;
    }
}

int main()
{
    solve();
    return 0;
}

Subtask #1
6.0 / 6.0

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

Subtask #2
6.0 / 6.0

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

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 2644 KB Output is correct
2 Correct 23 ms 2648 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 2644 KB Output is correct
2 Correct 34 ms 2516 KB Output is correct

Subtask #5
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 2644 KB Output is correct
2 Correct 35 ms 2516 KB Output is correct
3 Correct 34 ms 2644 KB Output is correct

Subtask #6
7.0 / 7.0

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

Subtask #7
0 / 7.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4059 ms 2644 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4065 ms 2644 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4051 ms 2516 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

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

Subtask #11
0 / 10.0

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

Subtask #12
0 / 10.0

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

Subtask #13
0 / 10.0

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