Submission #995587
Source Code Expand
#include<cstdio> #include <algorithm> #include <cstdlib> #include <set> using namespace std; int N, A[101010], B[101010]; void fail() { puts("-1"); exit(0); } int bas[101010]; set<pair<int, int> > P; 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]; // puts("x"); 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; } } // puts("y"); int ret = 0; for (int i = 0; i < D; ++i) { if (bas[i] == 0) fail(); ret += max(bas[i], bas[i + 1]); } // puts("z"); for (int i = 0; i < N; ++i) P.insert(make_pair(A[i], B[i])); 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(); } 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 | 1111 Byte |
Status | WA |
Exec Time | 73 ms |
Memory | 6144 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:20:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &N); ^ ./Main.cpp:21: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 |
|
|
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 | WA | 13 ms | 640 KB |
01-07.txt | WA | 27 ms | 1280 KB |
01-08.txt | WA | 27 ms | 1280 KB |
01-09.txt | WA | 22 ms | 1024 KB |
01-10.txt | WA | 21 ms | 1024 KB |
01-11.txt | AC | 33 ms | 1152 KB |
01-12.txt | AC | 31 ms | 1152 KB |
01-13.txt | AC | 72 ms | 5760 KB |
01-14.txt | AC | 52 ms | 6144 KB |
01-15.txt | AC | 73 ms | 5760 KB |
01-16.txt | AC | 17 ms | 1024 KB |
01-17.txt | AC | 17 ms | 1024 KB |
01-18.txt | AC | 17 ms | 1024 KB |
01-19.txt | WA | 52 ms | 5760 KB |
01-20.txt | WA | 70 ms | 4864 KB |
01-21.txt | WA | 71 ms | 4992 KB |
01-22.txt | WA | 63 ms | 3072 KB |
01-23.txt | AC | 27 ms | 1280 KB |
01-24.txt | AC | 27 ms | 1280 KB |
01-25.txt | AC | 16 ms | 1024 KB |
01-26.txt | AC | 17 ms | 1024 KB |
01-27.txt | AC | 16 ms | 1024 KB |
01-28.txt | AC | 17 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 |