제출 #197628

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
197628		arnold518	Pairs (IOI07_pairs)	C++14	30 / 100	43 ms	2552 KiB

pairs

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1e5;

struct Point
{
	int x, y, z;
	Point() {}
	Point(int x) : x(x) {}
	Point(int x, int y) : x(x), y(y) {}
	Point(int x, int y, int z) : x(x), y(y), z(z) {}
};

int B, N, D, M;
Point A[MAXN+10];
ll ans;

int main()
{
	int i, j;

	scanf("%d%d%d%d", &B, &N, &D, &M);
	for(i=1; i<=N; i++)
	{
		if(B==1) scanf("%d", &A[i].x);
		if(B==2) scanf("%d%d", &A[i].x, &A[i].y);
		if(B==3) scanf("%d%d%d", &A[i].x, &A[i].y, &A[i].z);
	}

	if(B==1)
	{
		sort(A+1, A+N+1, [&](const Point &p, const Point &q) { return p.x<q.x; });
		for(i=1; i<=N; i++) ans+=upper_bound(A+1, A+N+1, Point(A[i].x+D), [&](const Point &p, const Point &q) { return p.x<q.x; })-lower_bound(A+1, A+N+1, Point(A[i].x-D), [&](const Point &p, const Point &q) { return p.x<q.x; });
		ans-=N; ans/=2;
		printf("%lld", ans);
		return 0;
	}
}

컴파일 시 표준 에러 (stderr) 메시지

pairs.cpp: In function 'int main()':
pairs.cpp:25:9: warning: unused variable 'j' [-Wunused-variable]
  int i, j;
         ^
pairs.cpp:27: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:30:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   if(B==1) scanf("%d", &A[i].x);
            ~~~~~^~~~~~~~~~~~~~~
pairs.cpp:31:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   if(B==2) scanf("%d%d", &A[i].x, &A[i].y);
            ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
pairs.cpp:32:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   if(B==3) scanf("%d%d%d", &A[i].x, &A[i].y, &A[i].z);
            ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• 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