Submission #1004586
Source Code Expand
#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> static void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> static void amax(T &x, U y) { if(x < y) x = y; }
int main() {
int N;
while(~scanf("%d", &N)) {
vector<int> A(N);
vector<int> B(N);
for(int i = 0; i < N; ++ i)
scanf("%d%d", &A[i], &B[i]);
bool ok = true;
set<pair<int, int>> coordinates;
map<pair<int, int>, vector<int>> unmatched;
rep(i, N) {
ok &= (A[i] == 0) == (i == 0);
ok &= (B[i] == 0) == (i == 1);
coordinates.insert(make_pair(A[i], B[i]));
unmatched[{A[i], B[i]}].push_back(i);
}
vector<pair<int, int>> ord(N);
rep(i, N)
ord[i] = {A[i], i};
sort(ord.begin(), ord.end());
vector<bool> matched(N);
int matching = 0;
rep(ix, N) {
int i = ord[ix].second;
if(i != 0) {
bool ook = false;
rer(d, -1, 1)
ook |= coordinates.count({ A[i] - 1, B[i] + d }) != 0;
ok &= ook;
}
if(i != 1) {
bool ook = false;
rer(d, -1, 1)
ook |= coordinates.count({ A[i] + d, B[i] - 1 }) != 0;
ok &= ook;
}
if(!matched[i] && coordinates.count({ A[i] - 1, B[i] - 1 })) {
++ matching;
} else {
auto &v = unmatched[{ A[i] + 1, B[i] - 1 }];
if(!v.empty()) {
matched[v.back()] = true;
v.pop_back();
++ matching;
}
}
}
if(!ok) {
puts("-1");
continue;
}
int ans = N * 2 - 2 - matching;
printf("%d\n", ans);
}
return 0;
}
Submission Info
Submission Time
2016-12-01 17:23:59+0900
Task
A - Distance Pairs
User
anta
Language
C++14 (GCC 5.4.1)
Score
1500
Code Size
1898 Byte
Status
AC
Exec Time
189 ms
Memory
25216 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:17:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &A[i], &B[i]);
^
Judge Result
Set Name
sample
All
Score / Max Score
0 / 0
1500 / 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
189 ms
25216 KB
01-02.txt
AC
46 ms
2432 KB
01-03.txt
AC
3 ms
256 KB
01-04.txt
AC
3 ms
256 KB
01-05.txt
AC
3 ms
256 KB
01-06.txt
AC
23 ms
1536 KB
01-07.txt
AC
72 ms
3072 KB
01-08.txt
AC
78 ms
3072 KB
01-09.txt
AC
54 ms
2560 KB
01-10.txt
AC
40 ms
2304 KB
01-11.txt
AC
60 ms
2688 KB
01-12.txt
AC
56 ms
2688 KB
01-13.txt
AC
182 ms
17408 KB
01-14.txt
AC
183 ms
17408 KB
01-15.txt
AC
168 ms
17408 KB
01-16.txt
AC
27 ms
2296 KB
01-17.txt
AC
27 ms
2296 KB
01-18.txt
AC
27 ms
2296 KB
01-19.txt
AC
152 ms
17408 KB
01-20.txt
AC
147 ms
15232 KB
01-21.txt
AC
147 ms
15360 KB
01-22.txt
AC
113 ms
9088 KB
01-23.txt
AC
78 ms
3200 KB
01-24.txt
AC
76 ms
3200 KB
01-25.txt
AC
72 ms
2944 KB
01-26.txt
AC
74 ms
3072 KB
01-27.txt
AC
73 ms
3072 KB
01-28.txt
AC
78 ms
3200 KB
01-29.txt
AC
3 ms
256 KB
01-30.txt
AC
3 ms
256 KB
01-31.txt
AC
3 ms
256 KB
sample-01.txt
AC
3 ms
256 KB
sample-02.txt
AC
3 ms
256 KB