Submission #9154

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

N

#include<stdio.h>
int s[15][2], e[15][2];
int over[15];
int main()
{
	int N;
	int M;
	scanf("%d", &N);
	M = N;
	for(int i = 1; i <= N; i++)
		scanf("%d %d", &s[i][0],&s[i][1]);
	for(int i = 1; i <= N; i++)
		scanf("%d %d", &e[i][0],&e[i][1]);

	for(int i = 1; i <= N; i++)
	{
		if(e[i][1] < s[i][0] || s[i][1] < e[i][0]) {
			printf("-1");
			return 0;
		}
		else if(e[i][1] <= s[i][0] || s[i][1] <= e[i][0]) {
			M--;
		}
	}
	printf("%d", M);
	return 0;
}

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