Submission #786458

#	Time	Username	Problem	Language	Result	Execution time	Memory
786458		danikoynov	Pairs (IOI07_pairs)	C++14	30 / 100	47 ms	2596 KiB

pairs

#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];

bool cmp(point p1, point p2)
{
    return p1.x < p2.x;
}

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;
    }
}

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

• Subtask 1: 6 / 6
• Subtask 2: 6 / 6
• Subtask 3: 6 / 6
• Subtask 4: 6 / 6
• Subtask 5: 6 / 6
• Subtask 6: 0 / 7
• Subtask 7: 0 / 7
• Subtask 8: 0 / 8
• Subtask 9: 0 / 8
• Subtask 10: 0 / 10
• Subtask 11: 0 / 10
• Subtask 12: 0 / 10
• Subtask 13: 0 / 10