oj.uz

Submission #157751

# Submission time Handle Problem Language Result Execution time Memory
157751 2019-10-12T19:37:57 Z stefdasca Pairs (IOI07_pairs) C++14
100 / 100
 3868 ms 320136 KB 
#include<bits/stdc++.h>
using namespace std;
int tip, n, d, m;
long long ans;

struct tp
{
    int x, y, z;
};
tp vv[100002];

int v[100002];
void solve1()
{
    for(int i = 1; i <= n; ++i)
        cin >> v[i];
    sort(v+1, v+n+1);
    for(int i = 1; i <= n; ++i)
    {
        int sm = i;
        int st = 1;
        int dr = i-1;
        while(st <= dr)
        {
            int mid = (st + dr) / 2;
            if(v[i] - v[mid] <= d)
                sm = mid, dr = mid - 1;
            else
                st = mid + 1;
        }
        ans += (i - sm);
    }
    cout << ans << '\n';
}

pair<int, int> nr[100002];
int aib[401][200002];
vector<int>coord[150002];
void upd(int bu, int pz, int val)
{
    aib[bu][pz] += val;
}
int compute(int bu, int pz)
{
    pz = max(pz, 0);
    pz = min(pz, 200000);
    return aib[bu][pz];
}
int cb(int linie, int col)
{
    int ans = 0;
    int st = 0;
    int dr = coord[linie].size() - 1;
    if(coord[linie].back() <= col)
        return coord[linie].size();
    if(coord[linie][0] > col)
        return 0;
    while(st <= dr)
    {
        int mid = (st + dr) / 2;
        if(coord[linie][mid] <= col)
            ans = (mid + 1), st = mid + 1;
        else
            dr = mid - 1;
    }
    return ans;
}
void solve2()
{
    int buk = 400;
    for(int i = 1; i <= n; ++i)
    {
        int x, y;
        cin >> x >> y;
        nr[i].first = x + y;
        nr[i].second = x - y + 100000;
        coord[nr[i].first].push_back(nr[i].second);
        int nrbuk = nr[i].first / buk + (nr[i].first % buk > 0);
        upd(nrbuk, nr[i].second, 1);
    }
    for(int i = 1; i <= 400; ++i)
        for(int j = 1; j <= 200000; ++j)
            aib[i][j] += aib[i][j-1];
    for(int i = 0; i <= 150000; ++i)
        sort(coord[i].begin(), coord[i].end());
    for(int i = 1; i <= n; ++i)
    {
        int st = max(1, nr[i].first - d);
        int sf = min(150000, nr[i].first + d);
        int nrbuk = st / buk + (st % buk > 0);
        --ans;
        while(st <= sf && st <= nrbuk * buk)
        {
            if(!coord[st].empty())
                ans += cb(st, nr[i].second + d) - cb(st, nr[i].second - d - 1);
            ++st;
        }
        while(st + buk - 1 <= sf)
        {
            nrbuk = st / buk + (st % buk > 0);
            ans += compute(nrbuk, nr[i].second + d) - compute(nrbuk, nr[i].second - d - 1);
            st += buk;
        }
        while(st <= sf)
        {
            if(!coord[st].empty())
                ans += cb(st, nr[i].second + d) - cb(st, nr[i].second - d - 1);
            ++st;
        }
    }
    cout << ans / 2 << '\n';
}

int is[80][80][80];
int sp[80][80][80];
void solve3()
{
    for(int i = 1; i <= n; ++i)
        cin >> vv[i].x >> vv[i].y >> vv[i].z, is[vv[i].x][vv[i].y][vv[i].z]++;
    for(int i = 1; i <= 75; ++i)
        for(int j = 1; j <= 75; ++j)
            for(int x = 1; x <= 75; ++x)
                sp[i][j][x] = sp[i][j][x-1] + is[i][j][x];
    for(int i = 1; i <= n; ++i)
    {
        --ans;
        for(int x = 1; x <= 75; ++x)
        {
            if(abs(vv[i].x - x) > d)
                continue;
            for(int y = 1; y <= 75; ++y)
            {
                int rem = d - abs(vv[i].x - x) - abs(vv[i].y - y);
                if(rem >= 0)
                    ans = ans + sp[x][y][min(75, vv[i].z + rem)] - sp[x][y][max(0, vv[i].z - rem - 1)];
            }
        }
    }
    cout << ans/2 << '\n';
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> tip >> n >> d >> m;
    if(tip == 1)
        solve1();
    if(tip == 2)
        solve2();
    if(tip == 3)
        solve3();
    return 0;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 3960 KB Output is correct
2 Correct 5 ms 3832 KB Output is correct

Subtask #2
6.0 / 6.0

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

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 4264 KB Output is correct
2 Correct 24 ms 4216 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 4312 KB Output is correct
2 Correct 30 ms 4216 KB Output is correct

Subtask #5
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 4216 KB Output is correct
2 Correct 34 ms 4300 KB Output is correct
3 Correct 33 ms 4216 KB Output is correct

Subtask #6
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 452 ms 316996 KB Output is correct
2 Correct 461 ms 317052 KB Output is correct

Subtask #7
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 665 ms 318668 KB Output is correct
2 Correct 669 ms 318656 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2033 ms 318776 KB Output is correct
2 Correct 2059 ms 318732 KB Output is correct
3 Correct 2651 ms 318748 KB Output is correct
4 Correct 2290 ms 318724 KB Output is correct

Subtask #9
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1483 ms 320136 KB Output is correct
2 Correct 2126 ms 320128 KB Output is correct
3 Correct 1249 ms 318868 KB Output is correct
4 Correct 1546 ms 318816 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 7416 KB Output is correct
2 Correct 49 ms 7516 KB Output is correct

Subtask #11
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 7440 KB Output is correct
2 Correct 243 ms 7420 KB Output is correct
3 Correct 554 ms 7544 KB Output is correct

Subtask #12
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 394 ms 8760 KB Output is correct
2 Correct 2857 ms 8740 KB Output is correct
3 Correct 3868 ms 8736 KB Output is correct

Subtask #13
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1436 ms 9244 KB Output is correct
2 Correct 3439 ms 9232 KB Output is correct
3 Correct 3813 ms 9228 KB Output is correct