Submission #9361

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

N

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

int main(){
	int i,n,ps[2][16][2];
	int sum=0;
	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])
			sum += 0;
		else if(ps[0][i][0] <= ps[1][i][0]){
			if(ps[0][i][1] > ps[1][i][0]) sum+=1;
			else{
				sum = -1;
				break;
			}
		}
		else{
			if(ps[1][i][1] > ps[0][i][0]) sum+=1;
			else{
				sum=-1;
				break;
			}
		}
	}
	printf("%d\n",sum);
	
	return 0;
}

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