#275472 (C++11) No.1234 典型RMQ

• 問題: No.1234 典型RMQ
• ユーザー: koba-e964
• 提出日時: 2018-07-28 09:27:54
• 言語: C++11 (gcc 11.4.0)
• 結果: AC
• 実行時間: 203 ms / 2,000 ms
• コード長: 1,814 bytes
• コンパイル時間: 529 ms
• コンパイル使用メモリ: 56,788 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-04-26 10:59:52
• 合計ジャッジ時間: 6,253 ms
• ジャッジサーバーID （参考情報）: judge4 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	180 ms; 5,376 KB
testcase_07	AC	165 ms; 5,376 KB
testcase_08	AC	180 ms; 5,376 KB
testcase_09	AC	171 ms; 5,376 KB
testcase_10	AC	181 ms; 5,376 KB
testcase_11	AC	175 ms; 5,376 KB
testcase_12	AC	173 ms; 5,376 KB
testcase_13	AC	163 ms; 5,376 KB
testcase_14	AC	167 ms; 5,376 KB
testcase_15	AC	170 ms; 5,376 KB
testcase_16	AC	180 ms; 5,376 KB
testcase_17	AC	174 ms; 5,376 KB
testcase_18	AC	161 ms; 5,376 KB
testcase_19	AC	181 ms; 5,376 KB
testcase_20	AC	159 ms; 5,376 KB
testcase_21	AC	166 ms; 5,376 KB
testcase_22	AC	203 ms; 5,376 KB
testcase_23	AC	197 ms; 5,376 KB
testcase_24	AC	195 ms; 5,376 KB
testcase_25	AC	194 ms; 5,376 KB
testcase_26	AC	196 ms; 5,376 KB
testcase_27	AC	2 ms; 5,376 KB
testcase_28	AC	2 ms; 5,376 KB
testcase_29	AC	2 ms; 5,376 KB

ソースコード

#include <cassert>
#include <iostream>

#define REP(i,s,n) for(int i=(int)(s);i<(int)(n);i++)

using namespace std;
typedef long long int ll;

const int B = 317;
const int N = 100489;
const int K = N / B; // 317
ll a[N];
ll delay[B];
ll mi[B];

void update_naive(int l, int r, ll c) {
  REP(i, l, r) {
    a[i] += c;
  }
  int lb = l / K;
  if (lb >= B) return;
  ll m = a[K * lb];
  REP(i, 0, K) {
    m = min(m, a[K * lb + i]);
  }
  mi[lb] = m;
}

int main(void){
  ios::sync_with_stdio(false);
  int n;
  cin >> n;
  assert (1 <= n && n <= 100000);
  REP(i, 0, n) {
    cin >> a[i];
    assert (a[i] >= -1e10 && a[i] <= 1e10);
  }
  REP(i, 0, B) {
    ll m = a[i * K];
    REP(j, 1, K) {
      m = min(m, a[i * K + j]);
    }
    mi[i] = m;
  }
  int q;
  cin >> q;
  assert (1 <= q && q <= 100000);
  REP(i, 0, q) {
    int k, l, r;
    ll c;
    assert (cin >> k >> l >> r >> c);
    assert (k == 1 || k == 2);
    assert (1 <= l && l <= r && r <= n);
    assert (-10000 <= c && c <= 10000);
    l--; // [l,r)
    int l_boundary = (l + K - 1) / K;
    int r_boundary = r / K;
    // [l,r) = [l,K*l_boundary) + [K*l_boundary,K*r_boundary) + [K*r_boundary,r)
    if (k == 1) { // update interval
      if (l_boundary > r_boundary) {
	update_naive(l, r, c);
      } else {
	update_naive(l, K * l_boundary, c);
	REP(i, l_boundary, r_boundary) {
	  delay[i] += c;
	}
	update_naive(K * r_boundary, r, c);
      }
    }
    if (k == 2) {
      ll m = 1e16;
      if (l_boundary > r_boundary) {
	REP(i, l, r) {
	  m = min(m, a[i] + delay[i / K]);
	}
      } else {
	REP(i, l, K * l_boundary) {
	  m = min(m, a[i] + delay[i / K]);
	}
	REP(i, l_boundary, r_boundary) {
	  m = min(m, mi[i] + delay[i]);
	}
	REP(i, K * r_boundary, r) {
	  m = min(m, a[i] + delay[i / K]);
	}
      }
      cout << m << endl;
    }
  }
}