Submission #3333118


Source Code Expand

#include<stdio.h>
#include<map>
using namespace std;
map<int,map<int,int> >mp,vis;
int a[100010],b[100010];
bool ex(int x,int y){
	return mp.count(x)&&mp[x].count(y);
}
int main(){
	int n,i,j,s,las,now;
	scanf("%d",&n);
	#define wa {puts("-1");return 0;}
	for(i=1;i<=n;i++){
		scanf("%d%d",a+i,b+i);
		if(i!=1&&a[i]==0)wa
		if(i!=2&&b[i]==0)wa
		mp[a[i]][b[i]]++;
	}
	for(i=1;i<=n;i++){
		if(i!=2){
			if(!(ex(a[i]-1,b[i]-1)||ex(a[i],b[i]-1)||ex(a[i]+1,b[i]-1)))wa
		}
		if(i!=1){
			if(!(ex(a[i]-1,b[i]+1)||ex(a[i]-1,b[i])||ex(a[i]-1,b[i]-1)))wa
		}
	}
	s=0;
	for(i=1;i<=n;i++){
		if(!ex(a[i]-1,b[i]+1)&&!vis[a[i]][b[i]]){
			if(a[i]==3&&b[i]==5){
				i++;
				i--;
			}
			vis[a[i]][b[i]]=1;
			las=0;
			for(j=0;ex(a[i]+j,b[i]-j);j++){
				now=mp[a[i]+j][b[i]-j];
				s+=min(las,now);
				now-=min(las,now);
				if(ex(a[i]+j-1,b[i]-j-1)){
					s+=now;
					now=min(las,mp[a[i]+j][b[i]-j]);
				}else
					now=mp[a[i]+j][b[i]-j];
				las=now;
			}
		}
	}
	printf("%d",2*n-2-s);
}

Submission Info

Submission Time
Task A - Distance Pairs
User jefflyy
Language C++14 (GCC 5.4.1)
Score 1500
Code Size 1030 Byte
Status AC
Exec Time 358 ms
Memory 29184 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:11:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:14:24: 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
AC × 2
AC × 35
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, sample-01.txt, sample-02.txt
Case Name Status Exec Time Memory
01-01.txt AC 63 ms 11648 KB
01-02.txt AC 17 ms 1024 KB
01-03.txt AC 1 ms 256 KB
01-04.txt AC 1 ms 256 KB
01-05.txt AC 2 ms 256 KB
01-06.txt AC 13 ms 640 KB
01-07.txt AC 76 ms 1408 KB
01-08.txt AC 59 ms 1280 KB
01-09.txt AC 35 ms 1152 KB
01-10.txt AC 23 ms 1024 KB
01-11.txt AC 76 ms 1280 KB
01-12.txt AC 69 ms 1280 KB
01-13.txt AC 317 ms 19712 KB
01-14.txt AC 243 ms 15104 KB
01-15.txt AC 358 ms 29184 KB
01-16.txt AC 19 ms 1024 KB
01-17.txt AC 20 ms 1024 KB
01-18.txt AC 20 ms 1024 KB
01-19.txt AC 281 ms 17408 KB
01-20.txt AC 202 ms 8448 KB
01-21.txt AC 206 ms 8576 KB
01-22.txt AC 153 ms 4736 KB
01-23.txt AC 33 ms 1280 KB
01-24.txt AC 42 ms 1280 KB
01-25.txt AC 14 ms 896 KB
01-26.txt AC 3 ms 512 KB
01-27.txt AC 14 ms 896 KB
01-28.txt AC 12 ms 896 KB
01-29.txt AC 1 ms 256 KB
01-30.txt AC 1 ms 256 KB
01-31.txt AC 1 ms 256 KB
sample-01.txt AC 1 ms 256 KB
sample-02.txt AC 1 ms 256 KB