oj.uz

답안 #157649

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
157649 2019-10-12T16:44:01 Z stefdasca Pairs (IOI07_pairs) C++14
54 / 100
 1633 ms 126616 KB 
#include<bits/stdc++.h>
using namespace std;
int tip, n, d, m;
long long ans;


struct tp
{
    int x, y, z;
};
tp vv[10002];
void solvesmall()
{
    for(int i = 1; i <= n; ++i)
    {
        cin >> vv[i].x;
        if(tip >= 2)
            cin >> vv[i].y;
        if(tip >= 3)
            cin >> vv[i].z;
    }
    for(int i = 1; i <= n; ++i)
        for(int j = i+1; j <= n; ++j)
        {
            int dd = abs(vv[i].x - vv[j].x) + abs(vv[i].y - vv[j].y) + abs(vv[i].z - vv[j].z);
            if(dd <= d)
                ++ans;
        }
    cout << ans << '\n';
}

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[400][200002];
vector<int>coord[150002];
void upd(int bu, int pz, int val)
{
    for(; pz <= 200000; pz += (pz & (-pz)))
        aib[bu][pz] += val;
}
int compute(int bu, int pz)
{
    pz = min(pz, 200000);
    int ans = 0;
    for(; pz > 0; pz -= (pz & (-pz)))
        ans += aib[bu][pz];
    return ans;
}
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;
        // x = min(75000, i), y = min(75000, i);
        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 = 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);
        upd(nrbuk, nr[i].second, -1);
        while(st <= sf && st <= nrbuk * buk)
        {
            if(st == nr[i].first)
                --ans;
            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(st == nr[i].first)
                --ans;
            if(!coord[st].empty())
                ans += cb(st, nr[i].second + d) - cb(st, nr[i].second - d - 1);
            ++st;
        }
        upd(nrbuk, nr[i].second, 1);
    }
    cout << ans / 2 << '\n';
}

void solve3()
{

}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> tip >> n >> d >> m;
    if(tip == 1)
        solve1();
    else
        if(n <= 20000)
            solvesmall();
        else
            if(tip == 2)
                solve2();
            else
                if(tip == 3)
                    solve3();
    return 0;
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 3832 KB Output is correct
2 Correct 5 ms 3832 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 3832 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 4216 KB Output is correct
2 Correct 23 ms 4216 KB Output is correct

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 4216 KB Output is correct
2 Correct 30 ms 4188 KB Output is correct

Subtask #5
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 4348 KB Output is correct
2 Correct 34 ms 4344 KB Output is correct
3 Correct 33 ms 4216 KB Output is correct

Subtask #6
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 3960 KB Output is correct
2 Correct 7 ms 3832 KB Output is correct

Subtask #7
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 226 ms 5304 KB Output is correct
2 Correct 221 ms 5368 KB Output is correct

Subtask #8
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1629 ms 5548 KB Output is correct
2 Incorrect 1633 ms 5500 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #9
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1615 ms 126616 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 3960 KB Output is correct
2 Correct 7 ms 3832 KB Output is correct

Subtask #11
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 3832 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #12
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 3832 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #13
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 3832 KB Output isn't correct
2 Halted 0 ms 0 KB -