Submission #9198

#	Time	Username	Problem	Language	Result	Execution time	Memory
9198		altertain	N-orthotope (kriii2_N)	C++14	4 / 4	0 ms	1672 KiB

N

#include <vector>
#include <map>
#include <set>
#include <stack>
#include <algorithm>
#include <sstream>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cctype>
#include <cstring>
#include <queue>
#include <cassert>

using namespace std;

typedef long long LL;
typedef vector<string> VS;
typedef vector<int> VI;
typedef pair<int,int> PII;
typedef vector<PII> VPII;

#define MP make_pair
#define ST first
#define ND second
#define PB push_back
#define FOR(i,a,b) for( int i=(a); i<(b); ++i)
#define FORD(i,a,b) for( int i=(a); i>(b); --i)
#define REP(i,n) for(int i=0; i<(n); ++i)
#define ALL(X) (X).begin(),(X).end()
#define SZ(X) (int)(X).size()
#define FORE(it,X) for(__typeof((X).begin()) it=(X).begin(); it!=(X).end();++it)

int n;
int s[2][16],e[2][16];

int main()
{
	cin>>n;
	REP(j,2)
		REP(i,n)
			cin>>s[j][i]>>e[j][i];

	int dp = n;
	REP(i, n) {
		if (e[0][i] < s[1][i] || e[1][i] < s[0][i]) {
			dp = -1;
			break;
		}
		if (e[0][i] == s[1][i] || e[1][i] == s[0][i])
			dp--;
	}

	cout<<dp<<endl;
	return 0;
}

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