Submission #9327

#	Time	Username	Problem	Language	Result	Execution time	Memory
9327		yukariko	N-orthotope (kriii2_N)	C11	0 / 4	0 ms	1088 KiB

N

#include <stdio.h>
#include <string.h>

int main(){
	int i,n,lines=0,dots=0,ps[2][16][2];
	scanf("%d",&n);
	for(i=0;i<n;i++){
		scanf("%d %d",&ps[0][i][0],&ps[0][i][1]);
	}
	for(i=0;i<n;i++){
		scanf("%d %d",&ps[1][i][0],&ps[1][i][1]);
	}
	for(i=0;i<n;i++){
		if(	ps[0][i][1] == ps[1][i][0] ||
			ps[0][i][0] == ps[1][i][1])
			dots += 1;
		else if(ps[0][i][0] <= ps[1][i][0]){
			if(ps[0][i][1] > ps[1][i][0]) lines+=1;
		}
		else{
			if(ps[1][i][1] > ps[0][i][0]) lines+=1;
		}
	}
	if(lines>0) printf("%d\n",lines);
	else if(dots>0) printf("%d\n",0);
	else printf("%d\n",-1);
	
	return 0;
}

• Subtask 1: 0 / 1
• Subtask 2: 0 / 3