제출 #890823

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
890823		Sir_Ahmed_Imran	Pairs (IOI07_pairs)	C++17	30 / 100	331 ms	293976 KiB

pairs

                              ///~~~LOTA~~~///
#include <bits/stdc++.h>
using namespace std;
#define nl '\n'
#define ff first
#define ss second
#define ll long long 
#define append push_back
#define all(x) (x).begin(),(x).end()
void solvefor1(){
    ll r;
    int n,m,o,p;
    cin>>n>>o>>m;
    int dp[m+1]={0};
    vector<int> v;
    for(int i=0;i<n;i++){
        cin>>p;
        dp[p]++;
        v.append(p);
    }
    for(int i=1;i<=m;i++)
        dp[i]+=dp[i-1];
    r=0;
    for(auto& i:v)
        r+=dp[min(m,i+o)]-dp[max(0,i-o-1)]-1;
    cout<<r/2;
}
void solvefor2(){

}
void solvefor3(){

}
void solve(){
    int t;
    cin>>t;
    if(t==1) solvefor1();
    if(t==2) solvefor2();
    if(t==3) solvefor3();
}
int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    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: 0 / 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