Submission #453270

#	Time	Username	Problem	Language	Result	Execution time	Memory
453270		prvocislo	Pairs (IOI07_pairs)	C++17	100 / 100	585 ms	21904 KiB

pairs

#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)
{
    x1 = max(x1, 0), x2 = min(x2, maxn - 1);
    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), z(n);
    if (b == 3)
    {
        const int maxn = 80;
        vector<vector<vector<int> > > pf(maxn, vector<vector<int> >(maxn * 2, vector<int>(maxn * 2, 0)));
        for (int i = 0, x1, y1; i < n; i++)
        {
            cin >> x1 >> y1 >> z[i];
            x[i] = x1 + y1, y[i] = maxn + x1 - y1;
            pf[z[i]][x[i]][y[i]]++;
        }
        for (int i = 0; i < pf.size(); i++) for (int j = 1; j < pf[i].size(); j++) for (int k = 1; k < pf[i][j].size(); k++)
            pf[i][j][k] += pf[i][j - 1][k] + pf[i][j][k - 1] - pf[i][j - 1][k - 1];
        ll ans = 0;
        for (int i = 0; i < n; i++) for (int zi = 0; zi < maxn; zi++)
        {
            int di = d - abs(zi - z[i]);
            if (di < 0) continue;
            int x1 = max(1, x[i] - di), y1 = max(1, y[i] - di), x2 = min(maxn * 2 - 1, x[i] + di), y2 = min(maxn * 2 - 1, y[i] + di);
            ans += pf[zi][x2][y2] - pf[zi][x1 - 1][y2] - pf[zi][x2][y1 - 1] + pf[zi][x1 - 1][y1 - 1];
            //cout << pf[zi][x2][y2] - pf[zi][x1 - 1][y2] - pf[zi][x2][y1 - 1] + pf[zi][x1 - 1][y1 - 1] << "\n";
        }
        ans -= n;
        cout << ans / 2 << "\n";
        return 0;
    }
    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;
}

Compilation message (stderr)

pairs.cpp: In function 'int main()':
pairs.cpp:43:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<std::vector<int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |         for (int i = 0; i < pf.size(); i++) for (int j = 1; j < pf[i].size(); j++) for (int k = 1; k < pf[i][j].size(); k++)
      |                         ~~^~~~~~~~~~~
pairs.cpp:43:63: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |         for (int i = 0; i < pf.size(); i++) for (int j = 1; j < pf[i].size(); j++) for (int k = 1; k < pf[i][j].size(); k++)
      |                                                             ~~^~~~~~~~~~~~~~
pairs.cpp:43:102: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |         for (int i = 0; i < pf.size(); i++) for (int j = 1; j < pf[i].size(); j++) for (int k = 1; k < pf[i][j].size(); k++)
      |                                                                                                    ~~^~~~~~~~~~~~~~~~~

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