Submission #95255

#	Time	Username	Problem	Language	Result	Execution time	Memory
95255		easrui	Pairs (IOI07_pairs)	C++14	40 / 100	4093 ms	1964 KiB

pairs

#include <bits/stdc++.h>
using namespace std;
const int MN = 1e5+5;

int B,N,D,M,X[MN],Y[MN],Z[MN],cnt;
long long ans;
int main()
{
    cin >> B >> N >> D >> M;
    if(B==1) {
        for(int i=0; i<N; i++)
            cin >> X[i];
        sort(X,X+N);
        for(int i=0; i<N; i++) {
            while(cnt<N && X[i]+D>=X[cnt])
                cnt++;
            ans += cnt-i-1;
        }
        cout << ans;
    } else {
        for(int i=0; i<N; i++)
            cin >> X[i] >> Y[i] >> Z[i];
        for(int i=0; i<N; i++) {
            for(int j=i+1; j<N; j++) {
                if(abs(X[i]-X[j])+abs(Y[i]-Y[j])+abs(Z[i]-Z[j])<=D)
                    ans++;
            }
        }
        cout << ans;
    }
}

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