Submission #9490

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

N

#include <cstdio>

int main() {
	int n;
	int a[11][2], b[11][2];
	scanf("%d", &n);
	for(int i=0; i<n; i++) {
		scanf("%d %d", &a[i][0], &a[i][1]);
	}
	for(int i=0; i<n; i++) {
		scanf("%d %d", &b[i][0], &b[i][1]);
	}
	int ans = n;
	for(int i=0; i<n; i++) {
		if(a[i][1] == b[i][0] || a[i][0] == b[i][1]) ans-=1;
		else if(a[i][0] == a[i][1] && a[i][1] == b[i][0] && b[i][0] == b[i][1]) ans-=2;
		else if(a[i][0] > b[i][1] || a[i][1] < b[i][0]) {
			printf("-1\n");
			break;
		}
	}
	printf("%d\n", ans);
}

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