oj.uz

답안 #54573

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
54573 2018-07-04T06:44:08 Z 노영훈(#1490) Pairs (IOI07_pairs) C++11
80 / 100
 4000 ms 443648 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MX=100010, inf=2e9;

int b,n,d,m;

ll ans=0;

inline int _min(int x, int y) { return x<y ? x : y; }

void solve1(){
    int A[MX];
    for(int i=1; i<=n; i++) cin>>A[i];
    sort(A+1, A+n+1);
    for(int i=1, r=1; i<=n; i++){
        while(r<n && A[r+1]<=A[i]+d) r++;
        ans+=r-i;
    }
}

struct _SEG {
    int tree[150000*4], n;
    void init(int sz){
        n=sz;
        for(int i=1; i<150000*4; i++) tree[i]=0;
    }
    void upt(int v, int s, int e, int pos, int val){
        if(pos<s || e<pos) return;
        tree[v]+=val;
        if(s==e) return;
        upt(v*2,s,(s+e)/2,pos,val);
        upt(v*2+1,(s+e)/2+1,e,pos,val);
    }
    int sum(int v, int s, int e, int l, int r){
        if(e<l || r<s) return 0;
        if(l<=s && e<=r) return tree[v];
        return sum(v*2,s,(s+e)/2,l,r) + sum(v*2+1,(s+e)/2+1,e,l,r);
    }
    void upt(int pos, int val){
        upt(1,1,n,pos,val);
    }
    int sum(int l, int r){
        l=max(l,1);
        r=_min(r,n);
        if(r<l) return 0;
        return sum(1,1,n,l,r);
    }
};
struct pt2 {
    int x, y;
    bool operator < (const pt2 &p) const {
        return x-y<p.x-p.y;
    }
    void scan(){
        cin>>x>>y;
    }
};
void solve2(){
    _SEG Seg; Seg.init(150000);
    pt2 P[MX];
    for(int i=1; i<=n; i++) P[i].scan();
    sort(P+1, P+n+1);
    for(int i=1, r=0, l=1; i<=n; i++){
        while(r<n && P[r+1].x-P[r+1].y<=P[i].x-P[i].y+d){
            r++;
            Seg.upt(P[r].x+P[r].y,1);
        }
        while(l<=i){
            Seg.upt(P[l].x+P[l].y,-1);
            l++;
        }
        ans+=Seg.sum(P[i].x+P[i].y-d, P[i].x+P[i].y+d);
    }
}

struct pt3 {
    int x, y, z;
    void scan(){
        cin>>x>>y>>z;
    }
    int f(){
        return x+y+z;
    }
    bool operator < (const pt3 &p) const {
        return x+y+z<p.x+p.y+p.z;
    }
    bool hit(const pt3 &p){
        return abs(x-p.x)+abs(y-p.y)+abs(z-p.z)<=d;
    }
};

int A[76][76][76][76]; // '/'
int B[76][76][76][76]; // '\'
int C[151][76][76][76];// 마름모

int geta(int k, int x, int y, int z){
    if(x<1 || y<1 || z<1 || m<x || m<y || m<z || k<1) return 0;
    return A[k][x][y][z];
}
int getb(int k, int x, int y, int z){
    if(x<1 || y<1 || z<1 || m<x || m<y || m<z || k<1) return 0;
    return B[k][x][y][z];
}
int getc(int k, int x, int y, int z){
    if(x<1 || y<1 || z<1 || m<x || m<y || m<z || k<1) return 0;
    k=min(k, 150);
    return C[k][x][y][z];
}

void solve3(){
    pt3 P[MX];
    for(int i=1; i<=n; i++) P[i].scan();
    if(d>=3*m){
        ans=1LL*n*(n-1)/2;
        return;
    }

    for(int i=1; i<=n; i++){
        int x=P[i].x, y=P[i].y, z=P[i].z;
        A[1][x][y][z]++;
        B[1][x][y][z]++;
        C[1][x][y][z]++;
    }

    for(int i=2; i<=75; i++){
        for(int x=1; x<=m; x++)
            for(int y=1; y<=m; y++)
                for(int z=1; z<=m; z++){
                    A[i][x][y][z]=geta(i-1, x, y-1, z-1)+A[1][x][y][z];
                    B[i][x][y][z]=getb(i-1, x, y+1, z-1)+B[1][x][y][z];
                }
    }

    for(int i=2; i<=150; i++){
        for(int x=1; x<=m; x++)
            for(int y=1; y<=m; y++)
                for(int z=1; z<=m; z++){
                    int &now=C[i][x][y][z]; now=0;
                    // bool deb=false;
                    // if(i==3 && x==1 && y==2 && z==1) deb=true;
                    now+=getc(i-1,x,y,z);
                    {
                        int k=_min(z+i-1, m);
                        int l=z+i-1-k;
                        now+=geta(i-1-l,x,y-l,k);
                        // if(deb) cout<<i-1-l<<" : "<<geta(i-1-l,x,y-l,k)<<'\n';
                    }
                    {
                        int k=max(1,y-i+1);
                        int l=k-(y-i+1);
                        now+=getb(i-1-l,x,k,z-l);
                        // if(deb) cout<<i-1-l<<' '<<k<<' '<<z+l<<" : "<<getb(i-1-l,x,k,z+l)<<'\n';
                    }
                    {
                        int k=_min(y+i-1, m);
                        int l=y+i-1-k;
                        now+=geta(i-l,x,k,z-l);
                        // if(deb) cout<<i-l<<" : "<<geta(i-l,x,k,z-l)<<'\n';
                    }
                    {
                        int k=_min(z+i-2, m);
                        int l=z+i-2-k;
                        now+=getb(i-2-l,x,y+1+l,k);
                        // if(deb) cout<<i-2-l<<" : "<<getb(i-2-l,x,y+1+l,k)<<'\n';
                    }
                    // if(deb) cout<<'\n';
                }
    }

/*
    for(int i=1; i<=5; i++, cout<<'\n')
        for(int x=1; x<=m; x++, cout<<'\n')
            for(int y=1; y<=m; y++, cout<<'\n')
                for(int z=1; z<=m; z++){
                    cout<<getc(i,x,y,z);
                }

    cout<<"A:\n";
    for(int i=1; i<=5; i++, cout<<'\n')
        for(int x=1; x<=m; x++, cout<<'\n')
            for(int y=1; y<=m; y++, cout<<'\n')
                for(int z=1; z<=m; z++){
                    cout<<geta(i,x,y,z);
                }
*/
    for(int i=1; i<=n; i++){
        int x=P[i].x, y=P[i].y, z=P[i].z;
        ll now=0;
        for(int a=1; a<=m; a++){
            now+=getc(d-abs(a-x)+1,a,y,z);
            // cout<<getc(d-abs(a-x)+1,a,y,z)<<' ';
        }
        // cout<<'\n'<<now<<'\n';
        ans+=now-1;
    }
    ans/=2;
}

int main(){
    ios::sync_with_stdio(0); cin.tie(0);
    cin>>b>>n>>d>>m;
    if(b==1) solve1();
    if(b==2) solve2();
    if(b==3) solve3();
    cout<<ans;
    return 0;
}

Subtask #1
6.0 / 6.0

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

Subtask #2
6.0 / 6.0

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

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 1340 KB Output is correct
2 Correct 17 ms 1612 KB Output is correct

Subtask #4
6.0 / 6.0

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

Subtask #5
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 4160 KB Output is correct
2 Correct 25 ms 5152 KB Output is correct
3 Correct 22 ms 6080 KB Output is correct

Subtask #6
7.0 / 7.0

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

Subtask #7
7.0 / 7.0

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

Subtask #8
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 124 ms 10252 KB Output is correct
2 Correct 82 ms 10352 KB Output is correct
3 Correct 105 ms 10352 KB Output is correct
4 Correct 94 ms 10352 KB Output is correct

Subtask #9
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 118 ms 11528 KB Output is correct
2 Correct 113 ms 11536 KB Output is correct
3 Correct 81 ms 11536 KB Output is correct
4 Correct 78 ms 11536 KB Output is correct

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4066 ms 443648 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #11
10.0 / 10.0

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

Subtask #12
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2356 ms 443648 KB Output is correct
2 Correct 2533 ms 443648 KB Output is correct
3 Correct 2767 ms 443648 KB Output is correct

Subtask #13
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4059 ms 443648 KB Time limit exceeded
2 Halted 0 ms 0 KB -