Submission #120041

#	Time	Username	Problem	Language	Result	Execution time	Memory
120041		Boxworld	Pairs (IOI07_pairs)	C++14	30 / 100	24 ms	1664 KiB

pairs

#include <bits/stdc++.h>
using namespace std;
const int N=100010;
long long ans=0;
int B,n,d,m;
void solve1(){
	int a[N];
	for (int i=0;i<n;i++)scanf("%d",&a[i]);
	sort(a,a+n);
	int tmp=0;
	for (int i=1;i<n;i++){
		while (a[i]-a[tmp]>d)tmp++;
		ans+=(i-tmp);
	}
	printf("%lld\n",ans);
}
int main(){
	scanf("%d%d%d%d",&B,&n,&d,&m);
	if (B==1)solve1();
//	if (B==2)solve2();
//	if (B==3)solve3();
	return 0;
}

Compilation message (stderr)

pairs.cpp: In function 'void solve1()':
pairs.cpp:8:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (int i=0;i<n;i++)scanf("%d",&a[i]);
                       ~~~~~^~~~~~~~~~~~
pairs.cpp: In function 'int main()':
pairs.cpp:18:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d%d",&B,&n,&d,&m);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

• 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