Submission #9267

#	Time	Username	Problem	Language	Result	Execution time	Memory
9267		lhch6759	N-orthotope (kriii2_N)	C++98	0 / 4	0 ms	1672 KiB

N

// 제2회 kriiICPC
// 
// 

#include <iostream>
#include <vector>

using namespace std;


int main(){

	int case_num;
	cin >> case_num;

	int A[12][2];
	int B[12][2];
	int orthotope[12]; //안겹칠 경우 -1, 한점에서 만나는경우 0, 선이 겹치는 경우 1
	//input
	for (int nc = 0; nc < case_num; nc++){
		orthotope[nc] = -1;
		for (int n = 0; n < 2; n++){
			cin >> A[nc][n];	
		}
	}
	for (int nc = 0; nc < case_num; nc++){
		for (int n = 0; n < 2; n++){
			cin >> B[nc][n];
		}
	}
	
	//
	
	for (int i = 0; i < case_num; i++){
		// B 안에 A
		if (A[i][1] == B[i][0] || B[i][0] == A[i][1])  orthotope[i] = 0;

		if (A[i][1] < B[i][1] && B[i][0] < A[i][1]) orthotope[i] = 1;
		if (B[i][0] < A[i][0] && A[i][0] < B[i][1]) orthotope[i] = 1;

	}
	int result = 0;
	
	for (int i = 0; i < case_num; i++){
		if (orthotope[i] > 0){
			result++;
		}
	}

	//output
	cout << result << endl;
	
}

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