제출 #992674

#제출 시각아이디문제언어결과실행 시간메모리
992674ezzzayPairs (IOI07_pairs)C++14
30 / 100
42 ms1492 KiB
#include<bits/stdc++.h> using namespace std; #define ff first #define ss second #define pb push_back #define int long long const int N=3e5+5; void sbtsk1(int N, int D , int M){ vector<int>v; for(int i=0;i<N;i++){ int a; cin>>a; v.pb(a); } sort(v.begin(),v.end()); int cnt=0; for(auto i=v.begin();i!=v.end();i++){ int a=*i; auto it= upper_bound(v.begin(),v.end(),a-D-1); cnt+= i-it; } cout<<cnt; } signed main(){ int B,N,D,M; cin>>B>>N>>D>>M; if(B==1){ sbtsk1(N,D,M); return 0; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...