oj.uz

답안 #1005638

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1005638 2024-06-22T16:56:21 Z bachhoangxuan Pairs (IOI07_pairs) C++17
100 / 100
 29 ms 2912 KB 
#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define fi first
#define se second
int B,N,D,M;

namespace B1{
    void solve(){
        vector<int> X(N);
        for(int i=0;i<N;i++) cin >> X[i];
        sort(X.begin(),X.end());
        int p=0;
        long long total=0;
        for(int i=0;i<N;i++){
            while(p<N && X[i]-X[p]>D) p++;
            total+=i-p;
        }
        cout << total << '\n';
    }
}
namespace B2{
    const int maxn = 150005;
    int bit[maxn];
    void update(int x,int val){
        for(int i=x;i<=2*M;i+=(i&(-i))) bit[i]+=val;
    }
    int query(int x){
        int res=0;
        for(int i=x;i>=1;i-=(i&(-i))) res+=bit[i];
        return res;
    }

    void solve(){
        vector<pii> P(N);
        for(int i=0;i<N;i++){
            cin >> P[i].fi >> P[i].se;
            P[i]={P[i].fi+P[i].se,P[i].fi-P[i].se+M};
        }
        sort(P.begin(),P.end());
        int p=0;
        long long total=0;
        for(int i=0;i<N;i++){
            while(p<N && P[i].fi-P[p].fi>D) update(P[p++].se,-1);
            int l=max(1,P[i].se-D),r=min(2*M,P[i].se+D);
            total+=query(r)-query(l-1);
            update(P[i].se,1);
        }
        cout << total << '\n';
    }
}
namespace B3{
    const int maxn = 155;
    vector<pii> p[maxn];
    int cnt[maxn][maxn];

    void solve(){
        for(int i=0;i<N;i++){
            int x,y,z;cin >> x >> y >> z;
            p[x].push_back({y+z,y-z+M});
        }
        long long total=0;
        for(int i=1;i<=M;i++){
            for(int a=1;a<=2*M;a++) for(int b=1;b<=2*M;b++) cnt[a][b]=0;
            for(auto [x,y]:p[i]) cnt[x][y]++;
            for(int a=1;a<=2*M;a++) for(int b=1;b<=2*M;b++) cnt[a][b]+=cnt[a-1][b]+cnt[a][b-1]-cnt[a-1][b-1];
            for(int j=i;j<=M;j++){
                int d=D-(j-i);
                if(d<0) continue;
                long long add=0;
                for(auto [x,y]:p[j]){
                    int u=min(2*M,x+d),v=min(2*M,y+d);
                    x=max(1,x-d);y=max(1,y-d);
                    add+=cnt[u][v]-cnt[x-1][v]-cnt[u][y-1]+cnt[x-1][y-1];
                }
                if(j==i) add=(add-(int)p[i].size())/2;
                total+=add;
            }
        }
        cout << total << '\n';
    }
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    cin >> B >> N >> D >> M;
    if(B==1) B1::solve();
    else if(B==2) B2::solve();
    else B3::solve();
}

Subtask #1
6.0 / 6.0

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

Subtask #2
6.0 / 6.0

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

Subtask #3
6.0 / 6.0

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

Subtask #4
6.0 / 6.0

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

Subtask #5
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 1656 KB Output is correct
2 Correct 13 ms 1624 KB Output is correct
3 Correct 12 ms 1628 KB Output is correct

Subtask #6
7.0 / 7.0

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

Subtask #7
7.0 / 7.0

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

Subtask #8
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 1884 KB Output is correct
2 Correct 20 ms 1892 KB Output is correct
3 Correct 20 ms 1880 KB Output is correct
4 Correct 19 ms 1884 KB Output is correct

Subtask #9
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 2900 KB Output is correct
2 Correct 23 ms 2908 KB Output is correct
3 Correct 24 ms 2912 KB Output is correct
4 Correct 23 ms 2784 KB Output is correct

Subtask #10
10.0 / 10.0

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

Subtask #11
10.0 / 10.0

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

Subtask #12
10.0 / 10.0

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

Subtask #13
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 2392 KB Output is correct
2 Correct 29 ms 2396 KB Output is correct
3 Correct 26 ms 2396 KB Output is correct