Submission #995620


Source Code Expand

#include<cstdio>
#include <algorithm>
#include <cstdlib>
#include <map>
using namespace std;

int N, A[101010], B[101010];

void fail()
{
	puts("-1");
	exit(0);
}

int bas[101010];
map<pair<int, int>, int> P;

bool is_good(int y, int x)
{
	return P.count(make_pair(y - 1, x - 1)) > 0;
}

int main()
{
	scanf("%d", &N);
	for (int i = 0; i < N; ++i) scanf("%d%d", A + i, B + i);

	if (A[0] != 0) fail();
	if (B[1] != 0) fail();
	if (A[1] != B[0]) fail();
	int D = A[1];

	for (int i = 2; i < N; ++i) {
		if (A[i] == 0 || B[i] == 0 || A[i] + B[i] < D) fail();
	}

	for (int i = 0; i < N; ++i) {
		if (A[i] + B[i] == D) {
			bas[A[i]] += 1;
		}
	}

	int ret = 0;
	for (int i = 0; i < D; ++i) {
		if (bas[i] == 0) fail();
		ret += max(bas[i], bas[i + 1]);
	}

	for (int i = 0; i < N; ++i) P[make_pair(A[i], B[i])] += 1;

	for (int i = 2; i < N; ++i) if (A[i] + B[i] != D) {
		int x = A[i], y = B[i];
		if (P.count(make_pair(x - 1, y - 1))) {
			++ret;
		} else if (P.count(make_pair(x, y - 1)) && P.count(make_pair(x - 1, y))) {
			ret += 2;
		} else fail();
	}
	for (map<pair<int, int>, int>::iterator p = P.begin(); p != P.end(); ++p) {
		int y = p->first.first, x = p->first.second;
		if (y + x == D) continue;
		if (P.count(make_pair(y, x)) && P.count(make_pair(y - 1, x + 1)) && !is_good(y, x) && !is_good(y - 1, x + 1)) {
			ret -= min(P[make_pair(y, x)], P[make_pair(y - 1, x + 1)]);
		}
	}
	printf("%d\n", ret);

	return 0;
}

Submission Info

Submission Time
Task A - Distance Pairs
User sugim48
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1498 Byte
Status WA
Exec Time 94 ms
Memory 7680 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:25:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
                 ^
./Main.cpp:26:57: 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%d", A + i, B + i);
                                                         ^

Judge Result

Set Name sample All
Score / Max Score 0 / 0 0 / 1500
Status
AC × 2
AC × 25
WA × 8
Set Name Test Cases
sample sample-01.txt, sample-02.txt
All sample-01.txt, sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 01-27.txt, 01-28.txt, 01-29.txt, 01-30.txt, 01-31.txt
Case Name Status Exec Time Memory
01-01.txt AC 19 ms 1024 KB
01-02.txt AC 16 ms 1024 KB
01-03.txt AC 2 ms 256 KB
01-04.txt AC 2 ms 256 KB
01-05.txt AC 3 ms 256 KB
01-06.txt AC 12 ms 640 KB
01-07.txt WA 26 ms 1280 KB
01-08.txt WA 26 ms 1408 KB
01-09.txt WA 21 ms 1152 KB
01-10.txt AC 21 ms 1024 KB
01-11.txt AC 32 ms 1152 KB
01-12.txt AC 30 ms 1152 KB
01-13.txt AC 93 ms 7296 KB
01-14.txt AC 58 ms 7680 KB
01-15.txt AC 93 ms 7296 KB
01-16.txt AC 17 ms 1024 KB
01-17.txt AC 21 ms 1024 KB
01-18.txt AC 18 ms 1024 KB
01-19.txt WA 56 ms 7424 KB
01-20.txt WA 93 ms 6144 KB
01-21.txt WA 94 ms 6272 KB
01-22.txt WA 78 ms 3840 KB
01-23.txt AC 26 ms 1408 KB
01-24.txt AC 26 ms 1408 KB
01-25.txt AC 16 ms 1024 KB
01-26.txt AC 16 ms 1024 KB
01-27.txt AC 16 ms 1024 KB
01-28.txt AC 16 ms 1024 KB
01-29.txt WA 2 ms 256 KB
01-30.txt AC 2 ms 256 KB
01-31.txt AC 2 ms 256 KB
sample-01.txt AC 2 ms 256 KB
sample-02.txt AC 2 ms 256 KB