oj.uz

Submission #9521

# Submission time Handle Problem Language Result Execution time Memory
9521 2014-09-28T07:01:06 Z dolpang2 N-orthotope (kriii2_N) C++14
1 / 4
 0 ms 1088 KB 
#include <cstdio>
#include <vector>

const int kModulo = 1000000007;
int main() {
  int N;

  scanf("%d", &N);
  if (N == 1) {
    int a, b;
    int ap, bp;

    scanf("%d%d", &a, &b);
    scanf("%d%d", &ap, &bp);

    if (a > bp || b < ap) {
      printf("-1");
    } else if (b == ap || bp == a) {
      printf("0");
    } else {
      printf("1");
    }

  } else if (N == 2) {
    int a, b, c, d;
    int ap, bp, cp, dp;

    scanf("%d%d%d%d", &a, &c, &b, &d);
    scanf("%d%d%d%d", &ap, &cp, &bp, &dp);

    if (a > cp || c < ap || b > dp || d < bp) {
      printf("-1");
    } else if (a >= cp || c <= ap || b >= dp || d <= bp) {
      if ((a == cp && b == dp) || (c == ap && d == bp) ||
          (c == ap && b == dp) || (a == cp && d == bp)) {
        printf("0");
      } else {
        printf("1");
      }
    } else {
      printf("2");
    }
  }

  //for (int i = 0; i < 2; ++i) {
  //  for (int j = 0; j < N; ++j) {

  //  }
  //}
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1088 KB Output is correct
2 Correct 0 ms 1088 KB Output is correct
3 Correct 0 ms 1088 KB Output is correct
4 Correct 0 ms 1088 KB Output is correct
5 Correct 0 ms 1088 KB Output is correct
6 Correct 0 ms 1088 KB Output is correct
7 Correct 0 ms 1088 KB Output is correct
8 Correct 0 ms 1088 KB Output is correct
9 Correct 0 ms 1088 KB Output is correct
10 Correct 0 ms 1088 KB Output is correct
11 Correct 0 ms 1088 KB Output is correct
12 Correct 0 ms 1088 KB Output is correct
13 Correct 0 ms 1088 KB Output is correct
14 Correct 0 ms 1088 KB Output is correct
15 Correct 0 ms 1088 KB Output is correct
16 Correct 0 ms 1088 KB Output is correct
17 Correct 0 ms 1088 KB Output is correct
18 Correct 0 ms 1088 KB Output is correct
19 Correct 0 ms 1088 KB Output is correct
20 Correct 0 ms 1088 KB Output is correct
21 Correct 0 ms 1088 KB Output is correct
22 Correct 0 ms 1088 KB Output is correct
23 Correct 0 ms 1088 KB Output is correct
24 Correct 0 ms 1088 KB Output is correct
25 Correct 0 ms 1088 KB Output is correct
26 Correct 0 ms 1088 KB Output is correct
27 Correct 0 ms 1088 KB Output is correct
28 Correct 0 ms 1088 KB Output is correct
29 Correct 0 ms 1088 KB Output is correct
30 Correct 0 ms 1088 KB Output is correct
31 Correct 0 ms 1088 KB Output is correct
32 Correct 0 ms 1088 KB Output is correct
33 Correct 0 ms 1088 KB Output is correct
34 Correct 0 ms 1088 KB Output is correct
35 Correct 0 ms 1088 KB Output is correct
36 Correct 0 ms 1088 KB Output is correct
37 Correct 0 ms 1088 KB Output is correct
38 Correct 0 ms 1088 KB Output is correct
39 Correct 0 ms 1088 KB Output is correct
40 Correct 0 ms 1088 KB Output is correct
41 Correct 0 ms 1088 KB Output is correct
42 Correct 0 ms 1088 KB Output is correct
43 Correct 0 ms 1088 KB Output is correct
44 Correct 0 ms 1088 KB Output is correct
45 Correct 0 ms 1088 KB Output is correct
46 Correct 0 ms 1088 KB Output is correct
47 Correct 0 ms 1088 KB Output is correct
48 Correct 0 ms 1088 KB Output is correct
49 Correct 0 ms 1088 KB Output is correct
50 Correct 0 ms 1088 KB Output is correct

Subtask #2
0.0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1084 KB Output isn't correct
2 Halted 0 ms 0 KB -