Submission #992669

#	Time	Username	Problem	Language	Result	Execution time	Memory
992669		ezzzay	Pairs (IOI07_pairs)	C++14	0 / 100	32 ms	1600 KiB

pairs

#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
const int N=3e5+5;
int arr[N];
int sbtsk1(int N, int D , int M){
	vector<int>v;
	for(int i=1;i<=N;i++){
		v.pb(arr[i]);
	}
	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;
    for(int i=1;i<=N;i++)cin>>arr[i];
    if(B==1){
    	sbtsk1(N,D,M);
    	return 0;
	}
}

Compilation message (stderr)

pairs.cpp: In function 'int sbtsk1(int, int, int)':
pairs.cpp:21:1: warning: no return statement in function returning non-void [-Wreturn-type]
   21 | }
      | ^

• Subtask 1: 0 / 6
• Subtask 2: 0 / 6
• Subtask 3: 0 / 6
• Subtask 4: 0 / 6
• Subtask 5: 0 / 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