Submission #435144

#	Time	Username	Problem	Language	Result	Execution time	Memory
435144		sumit_kk10	Pairs (IOI07_pairs)	C++14	37 / 100	4075 ms	2252 KiB

pairs

#include <bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL)
#define ll long long int
#define ld long double
using namespace std;
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;

void solve(){
    long long b, n, d, m;
    cin >> b >> n >> d >> m;
    long long ans = 0;
    if(b == 1){
        long long a[n];
        for(int i = 0; i < n; ++i)
            cin >> a[i];
        sort(a, a + n);
        for(int i = 0; i < n; ++i){
            int low = i + 1, ok = -1, high = n - 1;
            while(low <= high){
                int mid = (low + high) / 2;
                if(a[mid] - a[i] <= d){
                    ok = mid;
                    low = mid + 1;
                }
                else
                    high = mid - 1;
            }
            if(ok != -1)
                ans += (ok - i);
        }
        cout << ans << '\n';
    }
    else if(b == 2){
        pair<long long, long long> a[n];
        for(int i = 0; i < n; ++i)
            cin >> a[i].first >> a[i].second;
        for(int i = 0; i < n; ++i){
            for(int j = i + 1; j < n; ++j){
                long long dis = abs(a[i].first - a[j].first);
                dis += abs(a[i].second - a[j].second);
                ans += (dis <= d); 
            }
        }
        cout << ans << '\n';
    }
}

int main(){
    fast;
    int t = 1;
    // cin >> t;
    while(t--)
        solve();
    return 0;
}

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