Submission #9520

#	Time	Username	Problem	Language	Result	Execution time	Memory
9520		jaehadad	N-orthotope (kriii2_N)	C++14	4 / 4	0 ms	1676 KiB

N

#include<cstdio>
#include<cassert>
#include<cstring>
#include<map>
#include<set>
#include<time.h>
#include<algorithm>
#include<stack>
#include<queue>
#include<utility>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
using namespace std;
int main() {
  int n;
  cin >> n;
  vector<int> s(n), e(n);
  for(int i = 0; i < n; ++i)
    cin >> s[i] >> e[i];
  int neg = 0, pos = 0;
  for(int i = 0; i < n; ++i) {
    int si, ei;
    cin >> si >> ei;
    s[i] = max(si, s[i]);
    e[i] = min(ei, e[i]);
    if(e[i] - s[i] < 0) ++neg;
    if(e[i] - s[i] > 0) ++pos;
  }
  if(neg)
    cout << -1 << endl;
  else
    cout << pos << endl;

}

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