Submission #9168

#	Time	Username	Problem	Language	Result	Execution time	Memory
9168		myungwoo	N-orthotope (kriii2_N)	C++98	4 / 4	0 ms	1088 KiB

N

#include<stdio.h>
#define max2(a,b) ((a)<(b)?(b):(a))
#define min2(a,b) ((a)>(b)?(b):(a))

int s1[12], e1[12], s2[12], e2[12], fl, cnt;

int main(){
	int i, n;
	scanf("%d", &n);
	for(i=0; i<n; i++)scanf("%d%d", &s1[i], &e1[i]);
	for(i=0; i<n; i++)scanf("%d%d", &s2[i], &e2[i]);
	for(i=0; i<n; i++){
		if(max2(s1[i],s2[i]) > min2(e1[i],e2[i]))fl=1;
		if(max2(s1[i],s2[i]) < min2(e1[i],e2[i]))cnt++;
	}
	if(fl)puts("-1");
	else printf("%d", cnt);
	return 0;
}

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