codeforces/2106C-cherry-bomb.cpp at main · benwu25/codeforces · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
#include <iostream>

// Misconception: complement can exceed k, b[i] cannot

void run_testcase(int *results, int test_num, int n, int k) {
  int *a = new int[n];
  int *b = new int[n];
  int skip = 0;
  int complement = -1;
  int max_of_a = -1;
  int min_of_a = INT_MAX;
  for (int i = 0; i < n; i++) {
    std::cin >> a[i];
    if (skip)
      continue;
    if (a[i] > k) {
      skip = 1;
      continue;
    }
    if (a[i] > max_of_a)
      max_of_a = a[i];
    if (a[i] < min_of_a)
      min_of_a = a[i];
  }
  for (int i = 0; i < n; i++) {
    std::cin >> b[i];
    if (skip)
      continue;
    if (b[i] > k) {
      skip = 1;
      continue;
    }
    if (b[i] != -1 && complement == -1) {
      complement = a[i] + b[i];
    } else if (b[i] != -1 && complement != -1) {
      if (complement != a[i] + b[i]) { // no possible ways
	skip = 1;
      }
    }
  }
  if (skip) { // found inconsistency
    results[test_num] = 0;
    delete[] a;
    delete[] b;
    return;
  }

  // Found complement -> check that for each b[i] == -1, 0 <= complement - a[i] <= k (check non-negative because a[i] could be bigger than complement
  // All b[i] == -1 -> complement := max(a[i])
  if (complement != -1) {
    for (int i = 0; i < n; i++) {
      if (complement - a[i] > k || a[i] > complement) {
	results[test_num] = 0;
	return;
      }
    }
    results[test_num] = 1;
  } else {
    int first_value = max_of_a - min_of_a;
    if (first_value > k) {
      results[test_num] = 0;
    } else {
      results[test_num] = k - first_value + 1;
    }
  }
  delete[] a;
  delete[] b;

  // Convince yourself of this algorithm


}

int main(int argc, char **argv) {
  int t;
  std::cin >> t;
  int *results = new int[t];
  for (int i = 0; i < t; i++) {
    int n, k;
    std::cin >> n;
    std::cin >> k;
    run_testcase(results, i, n, k);
  }
  for (int i = 0; i < t; i++) {
    std::cout << results[i] << std::endl;
  }
  return 0;
}