Submission #996096
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------
template<int um> class UF {
public:
vector<int> par,rank,cnt;
UF() {par=rank=vector<int>(um,0); cnt=vector<int>(um,1); for(int i=0;i<um;i++) par[i]=i;}
void reinit() {int i; FOR(i,um) rank[i]=0,cnt[i]=1,par[i]=i;}
int operator[](int x) {return (par[x]==x)?(x):(par[x] = operator[](par[x]));}
int count(int x) { return cnt[operator[](x)];}
int operator()(int x,int y) {
if((x=operator[](x))==(y=operator[](y))) return x;
cnt[y]=cnt[x]=cnt[x]+cnt[y];
if(rank[x]>rank[y]) return par[x]=y;
rank[x]+=rank[x]==rank[y]; return par[y]=x;
}
};
int N;
int A[101010],B[101010];
map<pair<int,int>,int> S;
UF<500000> uf;
map<int,int> V[202020];
void solve() {
int i,j,k,l,r,x,y; string s;
cin>>N;
FOR(i,N) {
cin>>A[i]>>B[i];
if(i!=0 && A[i]==0) return _P("-1\n");
if(i==0 && A[i]) return _P("-1\n");
if(i!=1 && B[i]==0) return _P("-1\n");
if(i==1 && B[i]) return _P("-1\n");
if(A[i]+B[i]<B[0]) return _P("-1\n");
S[{A[i],B[i]}]=i;
V[A[i]+B[i]][A[i]]++;
}
if(B[0]!=A[1]) return _P("-1\n");
FOR(i,N) {
if(i!=0) {
if(S.count({A[i]-1,B[i]-1})) uf(i,S[{A[i]-1,B[i]-1}]);
if(S.count({A[i]-1,B[i]})) uf(i,S[{A[i]-1,B[i]}]);
if(S.count({A[i]-1,B[i]+1})) uf(i,S[{A[i]-1,B[i]+1}]);
}
if(i!=1) {
if(S.count({A[i]-1,B[i]-1})) uf(i,S[{A[i]-1,B[i]-1}]);
if(S.count({A[i],B[i]-1})) uf(i,S[{A[i],B[i]-1}]);
if(S.count({A[i]+1,B[i]-1})) uf(i,S[{A[i]+1,B[i]-1}]);
}
}
if(uf.count(0)!=N) return _P("-1\n");
int ret=2*N-2;
FOR(i,2*N) if(V[i].size()) {
int pre=-2,left=0;
int del=0;
FORR(r,V[i]) {
x = r.second;
if(r.first==pre+1) {
ret -= min(left,x);
del+=min(left,x);
x-=min(left,x);
}
if(S.count({r.first-1,(i-r.first)-1})) {
ret-=x;
del+=x;
x=0;
}
pre=r.first;
left=x;
}
}
cout<<ret<<endl;
}
int main(int argc,char** argv){
string s;int i;
if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
FOR(i,argc-1) s+=argv[i+1],s+='\n';
FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
solve(); return 0;
}
Submission Info
Submission Time |
|
Task |
A - Distance Pairs |
User |
kmjp |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
2553 Byte |
Status |
WA |
Exec Time |
254 ms |
Memory |
27264 KB |
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 |
17 ms |
15616 KB |
01-02.txt |
AC |
17 ms |
15616 KB |
01-03.txt |
AC |
17 ms |
15616 KB |
01-04.txt |
AC |
18 ms |
15616 KB |
01-05.txt |
WA |
18 ms |
15616 KB |
01-06.txt |
WA |
38 ms |
16000 KB |
01-07.txt |
WA |
135 ms |
16896 KB |
01-08.txt |
WA |
167 ms |
16896 KB |
01-09.txt |
WA |
114 ms |
16512 KB |
01-10.txt |
WA |
59 ms |
16384 KB |
01-11.txt |
WA |
103 ms |
16640 KB |
01-12.txt |
WA |
94 ms |
16640 KB |
01-13.txt |
WA |
207 ms |
27264 KB |
01-14.txt |
WA |
213 ms |
27264 KB |
01-15.txt |
AC |
191 ms |
27264 KB |
01-16.txt |
WA |
37 ms |
17024 KB |
01-17.txt |
AC |
35 ms |
16512 KB |
01-18.txt |
AC |
35 ms |
16384 KB |
01-19.txt |
WA |
215 ms |
27264 KB |
01-20.txt |
WA |
250 ms |
25216 KB |
01-21.txt |
WA |
254 ms |
25344 KB |
01-22.txt |
WA |
229 ms |
21120 KB |
01-23.txt |
WA |
168 ms |
17024 KB |
01-24.txt |
WA |
167 ms |
16896 KB |
01-25.txt |
AC |
17 ms |
15616 KB |
01-26.txt |
AC |
17 ms |
15616 KB |
01-27.txt |
AC |
35 ms |
16512 KB |
01-28.txt |
AC |
32 ms |
16512 KB |
01-29.txt |
AC |
17 ms |
15616 KB |
01-30.txt |
AC |
17 ms |
15616 KB |
01-31.txt |
AC |
17 ms |
15616 KB |
sample-01.txt |
AC |
17 ms |
15616 KB |
sample-02.txt |
AC |
17 ms |
15616 KB |