Submission #152909

#	Time	Username	Problem	Language	Result	Execution time	Memory
152909		luciocf	Pairs (IOI07_pairs)	C++14	30 / 100	28 ms	1656 KiB

pairs

#include <bits/stdc++.h>

using namespace std;

const int maxn = 1e5+10;

int x[maxn];

int main(void)
{
	int b, n, d, m;
	scanf("%d %d %d %d", &b, &n, &d, &m);

	for (int i = 1; i <= n; i++)
		scanf("%d", &x[i]);

	sort(x+1, x+n+1);

	long long ans = 0;

	int l = 1, r = 2;
	while (l <= n && r <= n)
	{
		if (l != r && x[r]-x[l] <= d)
			ans += 1ll*(r-l);

		if (x[r]-x[l] <= d) r++;
		else l++;
	}

	printf("%lld\n", ans);
}

Compilation message (stderr)

pairs.cpp: In function 'int main()':
pairs.cpp:12: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);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
pairs.cpp:15:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &x[i]);
   ~~~~~^~~~~~~~~~~~~

• 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