Submission #9156

#	Time	Username	Problem	Language	Result	Execution time	Memory
9156		kcm1700	N-orthotope (kriii2_N)	C++14	4 / 4	0 ms	1088 KiB

N

#include <cstdio>
#include <algorithm>

using namespace std;

int n;
int s1[20],s2[20];
int e1[20],e2[20];

int main(){
  scanf("%d",&n);
  for(int i = 0; i < n; i++) scanf("%d%d",&s1[i],&e1[i]);
  for(int i = 0; i < n; i++) scanf("%d%d",&s2[i],&e2[i]);

  int cnt = 0;
  for(int i = 0; i < n; i++) {
    if (s1[i] > e2[i] || s2[i] > e1[i]) {
      puts("-1");
      return 0;
    }
    if (s1[i] == e2[i] || s2[i] == e1[i]) {
      continue;
    }
    cnt++;
  }
  printf("%d\n",cnt);
  return 0;
}

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