Irrational Division

#include <bits/stdc++.h>
#define ll unsigned long long

typedef long double ld;

using namespace std;

map<int, map<int, int>> dpa, dpb;
//int dpa[200][200];
//int dpb[200][200];
int sumdp[200][200];

int p, q;

int sdp(int a, int b) {
  if (a < 0 || b < 0) return 0;
  return sumdp[a][b];
}
int area(int x1, int y1, int x2, int y2) {
  if ((x2-x1+1)%2 == 0 || (y2-y1+1)%2 == 0) return 0;
  if (x2%2 == y2%2) return 1;
  return -1;
}


int main() {

  cin >> p >> q;

  /*for (int i = 0; i < 10; i++) {
    for (int j = 0; j < 10; j++) {
      cout<<area(0, 0, i, j) << " ";
    }
    cout << endl;
  }*/
  //return 0;

  cout << 2*area(0,0,p-1,q)<<endl;
  return 0;

  for (int i = 0; i < 200; i++) {
    for (int j = 0; j < 200; j++) {
      sumdp[i][j] = i%2 == j%2;
    }
  }
  for (int i = 1; i < 200; i++) {
    sumdp[0][i] += sumdp[0][i-1];
    sumdp[i][0] += sumdp[i-1][0];
  }
  for (int i = 1; i < 200; i++) {
    for (int j = 1; j < 200; j++) {
      sumdp[i][j] = sumdp[i-1][j] + sumdp[i][j-1] - sumdp[i-1][j-1];
    }
  }

  for (int i = 0; i < p; i++) dpb[i][q-1] = area(i, q-1, p, 1);
  for (int i = 0; i < q; i++) dpb[p-1][i] = area(i, q-1, p, 1);

  for (int y = 0; y < p; y++) {
    for (int x = 0; x < q; x++) {
      int res = -1e6;
      for (int i = x+1; i < q; i++) {
        res = max(res,
          dpb[y][i] + area(x, y, i, q)
        );
      }
      dpa[y][x] = res;
      
      res = 1e6;
      for (int i = y+1; i < p; i++) {
        res = min(res,
          dpa[i][x] - area(x, y, p, i)
        );
      }
      dpb[y][x] = res;
    }
  }

  for (int y = 0; y <= p; y++) {
    for (int x = 0; x <= q; x++) {
      cout << dpa[y][x] << "\t";
    }
    cout << endl;
  }
  for (int y = 0; y <= p; y++) {
    for (int x = 0; x <= q; x++) {
      cout << dpb[y][x] << "\t";
    }
    cout << endl;
  }

  return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: WRONG ANSWER

Test 19

Verdict: WRONG ANSWER

Test 20

Verdict: WRONG ANSWER

Test 21

Verdict: WRONG ANSWER

Test 22

Verdict: WRONG ANSWER

Test 23

Verdict: ACCEPTED

Test 24

Verdict: WRONG ANSWER

Test 25

Verdict: ACCEPTED

Test 26

Verdict: WRONG ANSWER

Test 27

Verdict: ACCEPTED

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED

Test 31

Verdict: ACCEPTED

Test 32

Verdict: ACCEPTED

Test 33

Verdict: ACCEPTED

Test 34

Verdict: ACCEPTED

Test 35

Verdict: ACCEPTED

Test 36

Verdict: WRONG ANSWER

Test 37

Verdict: WRONG ANSWER

Test 38

Verdict: WRONG ANSWER

Test 39

Verdict: ACCEPTED

Test 40

Verdict: ACCEPTED

Test 41

Verdict: ACCEPTED

Test 42

Verdict: WRONG ANSWER

Test 43

Verdict: WRONG ANSWER

Test 44

Verdict: ACCEPTED

Test 45

Verdict: ACCEPTED

Test 46

Verdict: WRONG ANSWER

Test 47

Verdict: ACCEPTED

Test 48

Verdict: ACCEPTED

Test 49

Verdict: ACCEPTED

Test 50

Verdict: WRONG ANSWER

Test 51

Verdict: ACCEPTED

Test 52

Verdict: ACCEPTED

Test 53

Verdict: ACCEPTED

Test 54

Verdict: WRONG ANSWER

Test 55

Verdict: ACCEPTED

Test 56

Verdict: ACCEPTED

Test 57

Verdict: ACCEPTED

Test 58

Verdict: ACCEPTED

Test 59

Verdict: WRONG ANSWER

Test 60

Verdict: ACCEPTED

Test 61

Verdict: ACCEPTED

Test 62

Verdict: ACCEPTED

Test 63

Verdict: WRONG ANSWER