Problem p02859 (C++)

Buggy submission (status: Runtime Error):
//
//  main.cpp
//  ABC124
//
//  Created by hiroaki on 2019/05/07.
//  Copyright © 2019年 hiroaki. All rights reserved.
//

#include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <tuple>
#include <vector>
// pair sort firstに揃う

#define int long long
#define double long double
#define Rap(n, i) for (int(i) = 0; (i) < (n); (i)++)
#define Pr(n) cout << n << endl;
#define PairV vector<pair<int, int>>
#define F first
#define S second
#define Vector1 vector<int>
#define VectorS vector<string>
#define vector2 vector<vector<int>>
#define index(v, x) find((v).begin(), (v).end(), (x)) - (v).begin()
#define ctoi(c) (int)(c - '0')
#define incin(n)                                                               \
  int(n);                                                                      \
  cin >> (n);
#define incin2(n, m)                                                           \
  int(n), (m);                                                                 \
  cin >> (n) >> (m);
#define stcin(s)                                                               \
  string(s);                                                                   \
  cin >> (s);
#define all(v) (v).begin(), (v).end()
namespace Mathf {
const int INF = 1000000000000;
const double PI = 3.14159274;
const double Rad2Deg = 57.29578;
const double log2(double a, double b);
const double log2(double a, double b) { return log(b) / log(a); }
} // namespace Mathf

using namespace std;

int MD(pair<int, int> a, pair<int, int> b) { // ManhattanDisRance
  return abs(a.first - b.first) + abs(a.second - b.second);
}
int MOD(int a, int b) { return abs(a % b); }
template <typename T1, typename T2> bool Comp(pair<T1, T2> a, pair<T1, T2> b) {
  if (a.first != b.first) {
    return a.first < b.first; // first昇順
  }
  if (a.second != b.second) {
    return a.second > b.second; // second降順
  } else {
    return true;
  }
}
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  incin2(h, w);
  vector<int> b(w);
  vector<vector<int>> a(h, b);

  incin(r);
  Pr(r * r);
  return 0;
}


Fixed submission:
//
//  main.cpp
//  ABC124
//
//  Created by hiroaki on 2019/05/07.
//  Copyright © 2019年 hiroaki. All rights reserved.
//

#include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <tuple>
#include <vector>
// pair sort firstに揃う

#define int long long
#define double long double
#define Rap(n, i) for (int(i) = 0; (i) < (n); (i)++)
#define Pr(n) cout << n << endl;
#define PairV vector<pair<int, int>>
#define F first
#define S second
#define Vector1 vector<int>
#define VectorS vector<string>
#define vector2 vector<vector<int>>
#define index(v, x) find((v).begin(), (v).end(), (x)) - (v).begin()
#define ctoi(c) (int)(c - '0')
#define incin(n)                                                               \
  int(n);                                                                      \
  cin >> (n);
#define incin2(n, m)                                                           \
  int(n), (m);                                                                 \
  cin >> (n) >> (m);
#define stcin(s)                                                               \
  string(s);                                                                   \
  cin >> (s);
#define all(v) (v).begin(), (v).end()
namespace Mathf {
const int INF = 1000000000000;
const double PI = 3.14159274;
const double Rad2Deg = 57.29578;
const double log2(double a, double b);
const double log2(double a, double b) { return log(b) / log(a); }
} // namespace Mathf

using namespace std;

int MD(pair<int, int> a, pair<int, int> b) { // ManhattanDisRance
  return abs(a.first - b.first) + abs(a.second - b.second);
}
int MOD(int a, int b) { return abs(a % b); }
template <typename T1, typename T2> bool Comp(pair<T1, T2> a, pair<T1, T2> b) {
  if (a.first != b.first) {
    return a.first < b.first; // first昇順
  }
  if (a.second != b.second) {
    return a.second > b.second; // second降順
  } else {
    return true;
  }
}
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  incin(r);
  Pr(r * r);
  return 0;
}