Submission #995584


Source Code Expand

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<cassert>
#define PB push_back
#define MP make_pair
#define sz(v) (in((v).size()))
#define forn(i,n) for(in i=0;i<(n);++i)
#define forv(i,v) forn(i,sz(v))
#define fors(i,s) for(auto i=(s).begin();i!=(s).end();++i)
#define all(v) (v).begin(),(v).end()
using namespace std;
typedef long long in;
typedef vector<in> VI;
typedef vector<VI> VVI;
void no(){
  cout<<-1<<endl;
  exit(0);
}
VI a,b;
vector<set<in> > cna,cnb;
int main(){
  ios::sync_with_stdio(0);
  cin.tie(0);
  in n;
  cin>>n;
  a.resize(n);
  b.resize(n);
  forn(i,n)
    cin>>a[i]>>b[i];
  if(a[0]!=0 || b[1]!=0)
    no();
  forn(i,n){
    if(i!=0 && a[i]==0)
      no();
    if(i!=1 && b[i]==0)
      no();
  }
  if(a[1]!=b[0])
    no();
  cna.resize(n+1);
  cnb.resize(n+1);
  forn(i,n){
    cna[a[i]].insert(b[i]);
    cnb[b[i]].insert(a[i]);
  }
  in sm=0;
  forn(i,n){
    if(i>=2){
      if(cna[a[i]-1].count(b[i]-1)){
	++sm;
	continue;
      }
    }
    if(i!=0){
      if(!cna[a[i]-1].count(b[i]) && !cna[a[i]-1].count(b[i]+1))
	no();
    }
    if(i!=1){
      if(!cnb[b[i]-1].count(a[i]) && !cnb[b[i]-1].count(a[i]+1))
	no();
    }
    sm+=2;
  }
  sm-=3;
  cout<<sm<<endl;
  return 0;
}

Submission Info

Submission Time
Task A - Distance Pairs
User w4yneb0t
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1339 Byte
Status WA
Exec Time 65 ms
Memory 20608 KB

Judge Result

Set Name sample All
Score / Max Score 0 / 0 0 / 1500
Status
AC × 2
AC × 17
WA × 16
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 58 ms 20608 KB
01-02.txt AC 32 ms 11264 KB
01-03.txt AC 2 ms 256 KB
01-04.txt AC 2 ms 256 KB
01-05.txt WA 3 ms 384 KB
01-06.txt WA 18 ms 6528 KB
01-07.txt WA 45 ms 11648 KB
01-08.txt WA 48 ms 11648 KB
01-09.txt WA 37 ms 11264 KB
01-10.txt WA 31 ms 11264 KB
01-11.txt WA 36 ms 11264 KB
01-12.txt WA 36 ms 11392 KB
01-13.txt WA 61 ms 20608 KB
01-14.txt WA 58 ms 20608 KB
01-15.txt AC 55 ms 20608 KB
01-16.txt WA 27 ms 11264 KB
01-17.txt WA 28 ms 11264 KB
01-18.txt AC 27 ms 11264 KB
01-19.txt WA 65 ms 20608 KB
01-20.txt WA 61 ms 18688 KB
01-21.txt WA 62 ms 18944 KB
01-22.txt WA 50 ms 15360 KB
01-23.txt AC 45 ms 11648 KB
01-24.txt AC 47 ms 11648 KB
01-25.txt AC 16 ms 1792 KB
01-26.txt AC 16 ms 1792 KB
01-27.txt AC 16 ms 1792 KB
01-28.txt AC 16 ms 1792 KB
01-29.txt AC 2 ms 256 KB
01-30.txt AC 2 ms 256 KB
01-31.txt AC 3 ms 256 KB
sample-01.txt AC 3 ms 256 KB
sample-02.txt AC 2 ms 256 KB