Problem p02345 (C++) — buggy submission, verdict: Runtime Error

////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
//
// ?????¢
// XCode??§???EOF??\\??????Ctrl+D
// ?\\???Alt+\\
// ans???????§?INT?????????2,147,483,647????¶????????????¨??????????????§long
// long?????£???????????????????????????
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

////////////////////////////////////////
// RMQ (Range Minimum Query)
//??????????????§?????§?????????????????°???????????¨(?????¨????????¨)??§????????£?????????
////////////////////////////////////////

// #define debug
// //*******************************************************************************************************************************************
#ifdef debug
#include <chrono>
#endif

#include <algorithm> // next_permutation
#include <cmath>
#include <cstdio>
#include <cstring> //memcpy
#include <iomanip>
#include <iostream>
#include <list>
#include <numeric> //accumulate
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
// #include <map>
// #include <unordered_map> //hash func.
#include <fstream>  //ifstream, ofstream
#include <iterator> //insert_iterator::inserter

#define NDEBUG // If NDEBUG is defined before #include <cassert>, assert will be
               // ignored. You had better define NDEBUG when u submit the code.
#include <cassert> //assert

using namespace std;

#define dout cout
// If u wanna output to a text file instead of standard output, plz define
// OUTPUTFILE. #define OUTPUTFILE "output.txt"
// //*******************************************************************************************************************************************
#ifdef OUTPUTFILE
#define dout outputfile
ofstream outputfile(OUTPUTFILE);
#define OutputFilePath                                                         \\
  "/Users/Nag/Documents/Prgm/Test/DerivedData/Test/Build/Products/Debug/"      \\
  "output.txt"
#endif

#define din cin
// If u wanna input from a text file instead of standard input, plz define
// INPUTFROMTEXTFILE???. #define INPUTFILE "input.txt"
// //*******************************************************************************************************************************************
#ifdef INPUTFILE
#define din inputfile
ifstream inputfile(INPUTFILE);
#endif

#define scand(A) scanf("%d", &(A))
#define scans(A) scanf("%s", (A))
#define disp(A) dout << #A << " = " << setw(3) << (A) << endl
#define disP(A) dout << setw(3) << (A) << " "
#define rep(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#define dispAll(A, n)                                                          \\
  dout << #A << " = ";                                                         \\
  rep(j, 0, (n)) { disP(A[j]); }                                               \\
  dout << endl
// #define dispAll(A,n) cout << #A << " = "; rep(j, 0, (n)) {cout << setw(3) <<
// A[j] << " ";} cout << endl

#define sign(x) ((x) > 0) - ((x) < 0) // x<0: -1, x=0: 0, x>0: +1
#define p(i) (i) / 2
#define l(i) (i) * 2
#define r(i) (i) * 2 + 1

int dx[] = {
    1, -1, 0, 0, 1,
    1, -1, -1}; //???????????????????????????????¨??????????????????????????????????
int dy[] = {0, 0, -1, 1, -1, 1, 1, -1};

typedef pair<int, int> pii;
typedef vector<int> vi;
typedef long long ll;
typedef unsigned long ull;

const int INF = (1 << 31) - 1;
const ll INF_LL = (ll)9e18 - 1LL; // Be careful for overflow.
const ull INF_ULL = (ull)1e19 - 1ULL;
const int NONE = -1;
const ll MOD =
    (ll)1e9 + 7; //??§???????´???°?????£??¨??¨????????°????????????10???7??????

const int N_MAX = 100010; // num of vertex or element
const int M_MAX = 100010; // num of edge
const int DATA_MAX = 1010;

int N;
int a[N_MAX * 3];

int k;
int pow2k;

int B = 316;  // floor(sqrt(N_MAX))
int b[N_MAX]; // B+1 elements
int tmp[N_MAX];

void initialize() {

  k = 0;
  pow2k = 1;

  while (pow2k < N) {
    pow2k *= 2;
    k++;
  }

  rep(i, 0, 2 * pow2k) { a[i] = INF; }
}

int find(int from, int to) {

#ifdef debug
  dout << "------ find( " << from << ", " << to << ")\\n";
#endif

  assert(from <= to);
  assert(to < N);

  int i = from + pow2k;
  int j = to + pow2k;

  int ans = INF;

  int limit = pow2k;

#ifdef debug
  disp(i);
  disp(j);
  disp(limit);
  disp(ans);
#endif
  while (i < j and limit <= i and j < 2 * limit) {

    if (i == r(p(i)))
      ans = min(ans, a[i]), i = p(i) + 1;
    else
      i = p(i);

    if (j == l(p(j)))
      ans = min(ans, a[j]), j = p(j) - 1;
    else
      j = p(j);

    limit /= 2;

#ifdef debug
    dout << "--- while-loop --- \\n";
    disp(i);
    disp(j);
    disp(limit);
    disp(ans);
#endif
  }

  if (i == j and limit <= i and j < 2 * limit) {
#ifdef debug
    dout << "--- last check --- \\n";
    dout << "check a[" << i << "] = " << a[i] << endl;
#endif
    assert(i == j);
    ans = min(ans, a[i]);
  }

#ifdef debug
  dout << "--- FINAL --- \\n";
  disp(i);
  disp(j);
  disp(limit);
  disp(ans);
#endif
  return ans;
}

void update(int i, int x) {
#ifdef debug
  dout << "------ update( i=" << i << ", x=" << x << ")\\n";
#endif

  i = i + pow2k;
  a[i] = x;

  i = p(i);
  while (i > 0) {
    a[i] = min(a[l(i)], a[r(i)]);
    i = p(i);
  }
}

void display() {
#ifdef debug
  dout << "---------------------\\n";
  dout << "i = ";
  rep(i, 0, 2 * pow2k) { disP(i); }
  dout << endl;
  dout << "a = ";
  rep(i, 0, 2 * pow2k) { disP(a[i] == INF ? 999 : a[i]); }
  dout << endl;
  dout << "---------------------\\n";
  dout << endl;
#endif
}

int main() {

  // cin, cout????????????
  // ?????¨??????cin?????????????????¨??¨cin??§???scanf?????????????????¨??¨scanf??§??±?????????????????????
  cin.tie(0);                  // cin??¨cout??????????????????
  ios::sync_with_stdio(false); // iostream??¨stdio??????????????????

  // read input data
  scand(N);
  int Q;
  scand(Q);

  //------------------------------------------------------------------------------------------
#ifdef debug
  // start timer
  auto startTime = chrono::system_clock::now();
#endif
  //------------------------------------------------------------------------------------------

  initialize();
  display();

  int command, x, y;
  rep(i, 0, Q) {
    scanf("%d%d%d", &command, &x, &y);

    if (command) {
      printf("%d\\n", find(x, y));
    } else {
      update(x, y);
    }
    display();
  }

  //------------------------------------------------------------------------------------------
#ifdef debug
  // stop timer
  auto endTime = chrono::system_clock::now();
  auto dur = endTime - startTime;
  auto msec = chrono::duration_cast<chrono::milliseconds>(dur).count();
  dout << fixed << setprecision(4) << (double)msec / 1000 << " sec \\n";
#endif
  //------------------------------------------------------------------------------------------

#ifdef INPUTFILE
  inputfile.close();
#endif

#ifdef OUTPUTFILE
  outputfile.close();
  cout << "\\"" << OutputFilePath << "\\"" << endl;
#endif

  return 0;
}

Error: 0

Fixed submission:

////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
//
// ?????¢
// XCode??§???EOF??\\??????Ctrl+D
// ?\\???Alt+\\
// ans???????§?INT?????????2,147,483,647????¶????????????¨??????????????§long
// long?????£???????????????????????????
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

////////////////////////////////////////
// RMQ (Range Minimum Query)
//??????????????§?????§?????????????????°???????????¨(?????¨????????¨)??§????????£?????????
////////////////////////////////////////

// #define debug
// //*******************************************************************************************************************************************
#ifdef debug
#include <chrono>
#endif

#include <algorithm> // next_permutation
#include <cmath>
#include <cstdio>
#include <cstring> //memcpy
#include <iomanip>
#include <iostream>
#include <list>
#include <numeric> //accumulate
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
// #include <map>
// #include <unordered_map> //hash func.
#include <fstream>  //ifstream, ofstream
#include <iterator> //insert_iterator::inserter

#define NDEBUG // If NDEBUG is defined before #include <cassert>, assert will be
               // ignored. You had better define NDEBUG when u submit the code.
#include <cassert> //assert

using namespace std;

#define dout cout
// If u wanna output to a text file instead of standard output, plz define
// OUTPUTFILE. #define OUTPUTFILE "output.txt"
// //*******************************************************************************************************************************************
#ifdef OUTPUTFILE
#define dout outputfile
ofstream outputfile(OUTPUTFILE);
#define OutputFilePath                                                         \\
  "/Users/Nag/Documents/Prgm/Test/DerivedData/Test/Build/Products/Debug/"      \\
  "output.txt"
#endif

#define din cin
// If u wanna input from a text file instead of standard input, plz define
// INPUTFROMTEXTFILE???. #define INPUTFILE "input.txt"
// //*******************************************************************************************************************************************
#ifdef INPUTFILE
#define din inputfile
ifstream inputfile(INPUTFILE);
#endif

#define scand(A) scanf("%d", &(A))
#define scans(A) scanf("%s", (A))
#define disp(A) dout << #A << " = " << setw(3) << (A) << endl
#define disP(A) dout << setw(3) << (A) << " "
#define rep(i, a, n) for (int(i) = (a); (i) < (n); (i)++)
#define dispAll(A, n)                                                          \\
  dout << #A << " = ";                                                         \\
  rep(j, 0, (n)) { disP(A[j]); }                                               \\
  dout << endl
// #define dispAll(A,n) cout << #A << " = "; rep(j, 0, (n)) {cout << setw(3) <<
// A[j] << " ";} cout << endl

#define sign(x) ((x) > 0) - ((x) < 0) // x<0: -1, x=0: 0, x>0: +1
#define p(i) (i) / 2
#define l(i) (i) * 2
#define r(i) (i) * 2 + 1

int dx[] = {
    1, -1, 0, 0, 1,
    1, -1, -1}; //???????????????????????????????¨??????????????????????????????????
int dy[] = {0, 0, -1, 1, -1, 1, 1, -1};

typedef pair<int, int> pii;
typedef vector<int> vi;
typedef long long ll;
typedef unsigned long ull;

const int INF = (1 << 31) - 1;
const ll INF_LL = (ll)9e18 - 1LL; // Be careful for overflow.
const ull INF_ULL = (ull)1e19 - 1ULL;
const int NONE = -1;
const ll MOD =
    (ll)1e9 + 7; //??§???????´???°?????£??¨??¨????????°????????????10???7??????

const int N_MAX = 100010; // num of vertex or element
const int M_MAX = 100010; // num of edge
const int DATA_MAX = 1010;

int N;
int a[N_MAX * 2];

int k;
int pow2k;

int B = 316;  // floor(sqrt(N_MAX))
int b[N_MAX]; // B+1 elements
int tmp[N_MAX];

void initialize() {

  k = 0;
  pow2k = 1;

  while (pow2k < N) {
    pow2k *= 2;
    k++;
  }

  rep(i, 0, 2 * pow2k) { a[i] = INF; }
}

int find(int from, int to) {

#ifdef debug
  dout << "------ find( " << from << ", " << to << ")\\n";
#endif

  assert(from <= to);
  assert(to < N);

  int i = from + pow2k;
  int j = to + pow2k;

  int ans = INF;

  int limit = pow2k;

#ifdef debug
  disp(i);
  disp(j);
  disp(limit);
  disp(ans);
#endif
  while (i < j and limit <= i and j < 2 * limit) {

    if (i == r(p(i)))
      ans = min(ans, a[i]), i = p(i) + 1;
    else
      i = p(i);

    if (j == l(p(j)))
      ans = min(ans, a[j]), j = p(j) - 1;
    else
      j = p(j);

    limit /= 2;

#ifdef debug
    dout << "--- while-loop --- \\n";
    disp(i);
    disp(j);
    disp(limit);
    disp(ans);
#endif
  }

  if (i == j and limit <= i and j < 2 * limit) {
#ifdef debug
    dout << "--- last check --- \\n";
    dout << "check a[" << i << "] = " << a[i] << endl;
#endif
    assert(i == j);
    ans = min(ans, a[i]);
  }

#ifdef debug
  dout << "--- FINAL --- \\n";
  disp(i);
  disp(j);
  disp(limit);
  disp(ans);
#endif
  return ans;
}

void update(int i, int x) {
#ifdef debug
  dout << "------ update( i=" << i << ", x=" << x << ")\\n";
#endif

  i = i + pow2k;
  a[i] = x;

  i = p(i);
  while (i > 0) {
    a[i] = min(a[l(i)], a[r(i)]);
    i = p(i);
  }
}

void display() {
#ifdef debug
  dout << "---------------------\\n";
  dout << "i = ";
  rep(i, 0, 2 * pow2k) { disP(i); }
  dout << endl;
  dout << "a = ";
  rep(i, 0, 2 * pow2k) { disP(a[i] == INF ? 999 : a[i]); }
  dout << endl;
  dout << "---------------------\\n";
  dout << endl;
#endif
}

int main() {

  // cin, cout????????????
  // ?????¨??????cin?????????????????¨??¨cin??§???scanf?????????????????¨??¨scanf??§??±?????????????????????
  cin.tie(0);                  // cin??¨cout??????????????????
  ios::sync_with_stdio(false); // iostream??¨stdio??????????????????

  // read input data
  scand(N);
  int Q;
  scand(Q);

  //------------------------------------------------------------------------------------------
#ifdef debug
  // start timer
  auto startTime = chrono::system_clock::now();
#endif
  //------------------------------------------------------------------------------------------

  initialize();
  display();

  int command, x, y;
  rep(i, 0, Q) {
    scanf("%d%d%d", &command, &x, &y);

    if (command) {
      printf("%d\\n", find(x, y));
    } else {
      update(x, y);
    }
    display();
  }

  //------------------------------------------------------------------------------------------
#ifdef debug
  // stop timer
  auto endTime = chrono::system_clock::now();
  auto dur = endTime - startTime;
  auto msec = chrono::duration_cast<chrono::milliseconds>(dur).count();
  dout << fixed << setprecision(4) << (double)msec / 1000 << " sec \\n";
#endif
  //------------------------------------------------------------------------------------------

#ifdef INPUTFILE
  inputfile.close();
#endif

#ifdef OUTPUTFILE
  outputfile.close();
  cout << "\\"" << OutputFilePath << "\\"" << endl;
#endif

  return 0;
}