Submission #992667

#TimeUsernameProblemLanguageResultExecution timeMemory
992667ezzzayPairs (IOI07_pairs)C++14
0 / 100
1 ms428 KiB
#include<bits/stdc++.h> using namespace std; #define ff first #define ss second #define pb push_back const int N=3e5+5; int 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; } }

Compilation message (stderr)

pairs.cpp: In function 'int sbtsk1(int, int, int)':
pairs.cpp:22:1: warning: no return statement in function returning non-void [-Wreturn-type]
   22 | }
      | ^
#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...