Problem p02620 (C++)

Buggy submission (status: Runtime Error):
/*
これを入れて実行
g++ code.cpp
./a.out
 */

#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>

#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

using namespace std;
typedef long long ll;
typedef long double ld;

int dy4[4] = {-1, 0, +1, 0};
int dx4[4] = {0, +1, 0, -1};
int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};

const long long INF = 1LL << 60;
const ll MOD = 1e9 + 7;

bool greaterSecond(const pair<int, int> &f, const pair<int, int> &s) {
  return f.second > s.second;
}

ll gcd(ll a, ll b) {
  if (b == 0)
    return a;
  return gcd(b, a % b);
}

ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }

ll conbinationMemo[100][100];

void cmemoInit() {
  rep(i, 100) {
    rep(j, 100) { conbinationMemo[i][j] = -1; }
  }
}

ll nCr(ll n, ll r) {
  if (conbinationMemo[n][r] != -1)
    return conbinationMemo[n][r];
  if (r == 0 || r == n) {
    return 1;
  } else if (r == 1) {
    return n;
  }
  return conbinationMemo[n][r] = (nCr(n - 1, r) + nCr(n - 1, r - 1));
}

ll nPr(ll n, ll r) {
  r = n - r;
  ll ret = 1;
  for (ll i = n; i >= r + 1; i--)
    ret *= i;
  return ret;
}
//-----------------------ここから-----------
ll d;
vector<vector<ll>> s;
vector<ll> c(26);
vector<ll> t;
ll calcScore() {
  ll score = 0;
  vector<ll> last(26, -1);
  rep(i, d) {
    score += s[i][t[i]];
    last[t[i]] = i;
    rep(j, 26) { score -= (i - last[j]) * c[j]; }
  }

  return score;
}

void updateScore(ll &score, pair<ll, ll> q, vector<set<ll>> &st) {
  score -= s[q.first][t[q.first]];
  score += s[q.first][q.second];

  auto itrn = st[t[q.first]].upper_bound(q.first);
  auto itrp = st[t[q.first]].lower_bound(q.first);
  itrp--;
  // cout << score << endl;
  // cout << c[t[q.first]] << " " << c[q.second] << endl;
  // cout << *itrp << " " << q.first << " " << *itrn << endl;

  ll last = (abs(*itrp - q.first) - 1) * c[t[q.first]];
  ll start = c[t[q.first]];
  score += (abs(*itrp - q.first) - 1) * ((last + start) / 2.0);
  last = (abs(*itrn - q.first) - 1) * c[t[q.first]];
  score += (abs(*itrn - q.first) - 1) * ((last + start) / 2.0);

  last = (abs(*itrn - *itrp) - 1) * c[t[q.first]];
  score -= (abs(*itrn - *itrp) - 1) * ((last + start) / 2.0);
  // cout << start << " " << last << endl;
  // cout << (abs(*itrn - *itrp) - 1) * ((last + start) / 2.0) << endl;
  // cout << score << endl;

  st[t[q.first]].erase(q.first);
  st[q.second].insert(q.first);

  itrn = st[q.second].upper_bound(q.first);
  itrp = st[q.second].lower_bound(q.first);
  itrp--;
  last = (abs(*itrp - *itrn) - 1) * c[q.second];
  start = c[q.second];

  score += (abs(*itrp - *itrn) - 1) * ((last + start) / 2.0);
  last = (abs(*itrp - q.first) - 1) * c[q.second];
  score -= (abs(*itrp - q.first) - 1) * ((last + start) / 2.0);
  last = (abs(*itrn - q.first) - 1) * c[q.second];
  score -= (abs(*itrn - q.first) - 1) * ((last + start) / 2.0);

  t[q.first] = q.second;
}
int main(void) {

  cin >> d;
  s.resize(d, vector<ll>(26));

  rep(i, 26) cin >> c[i];
  rep(i, d) {
    rep(j, 26) { cin >> s[i][j]; }
  }

  t.resize(d);
  rep(i, d) {
    cin >> t[i];
    t[i]--;
  }

  ll score = calcScore();
  ll m;
  cin >> m;
  vector<pair<ll, ll>> q(m);
  rep(i, m) {
    cin >> q[i].first >> q[i].second;
    q[i].first--;
    q[i].second--;
  }

  vector<set<ll>> st(26);
  rep(i, d) { st[t[i]].insert(i); }

  rep(i, 26) {
    st[i].insert(-1);
    st[i].insert(d);
  }

  // cout << score << endl;

  rep(i, d) {
    updateScore(score, q[i], st);
    cout << score << endl;
  }
}


Fixed submission:
/*
これを入れて実行
g++ code.cpp
./a.out
 */

#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>

#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

using namespace std;
typedef long long ll;
typedef long double ld;

int dy4[4] = {-1, 0, +1, 0};
int dx4[4] = {0, +1, 0, -1};
int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};

const long long INF = 1LL << 60;
const ll MOD = 1e9 + 7;

bool greaterSecond(const pair<int, int> &f, const pair<int, int> &s) {
  return f.second > s.second;
}

ll gcd(ll a, ll b) {
  if (b == 0)
    return a;
  return gcd(b, a % b);
}

ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }

ll conbinationMemo[100][100];

void cmemoInit() {
  rep(i, 100) {
    rep(j, 100) { conbinationMemo[i][j] = -1; }
  }
}

ll nCr(ll n, ll r) {
  if (conbinationMemo[n][r] != -1)
    return conbinationMemo[n][r];
  if (r == 0 || r == n) {
    return 1;
  } else if (r == 1) {
    return n;
  }
  return conbinationMemo[n][r] = (nCr(n - 1, r) + nCr(n - 1, r - 1));
}

ll nPr(ll n, ll r) {
  r = n - r;
  ll ret = 1;
  for (ll i = n; i >= r + 1; i--)
    ret *= i;
  return ret;
}
//-----------------------ここから-----------
ll d;
vector<vector<ll>> s;
vector<ll> c(26);
vector<ll> t;
ll calcScore() {
  ll score = 0;
  vector<ll> last(26, -1);
  rep(i, d) {
    score += s[i][t[i]];
    last[t[i]] = i;
    rep(j, 26) { score -= (i - last[j]) * c[j]; }
  }

  return score;
}

void updateScore(ll &score, pair<ll, ll> q, vector<set<ll>> &st) {
  score -= s[q.first][t[q.first]];
  score += s[q.first][q.second];

  auto itrn = st[t[q.first]].upper_bound(q.first);
  auto itrp = st[t[q.first]].lower_bound(q.first);
  itrp--;
  // cout << score << endl;
  // cout << c[t[q.first]] << " " << c[q.second] << endl;
  // cout << *itrp << " " << q.first << " " << *itrn << endl;

  ll last = (abs(*itrp - q.first) - 1) * c[t[q.first]];
  ll start = c[t[q.first]];
  score += (abs(*itrp - q.first) - 1) * ((last + start) / 2.0);
  last = (abs(*itrn - q.first) - 1) * c[t[q.first]];
  score += (abs(*itrn - q.first) - 1) * ((last + start) / 2.0);

  last = (abs(*itrn - *itrp) - 1) * c[t[q.first]];
  score -= (abs(*itrn - *itrp) - 1) * ((last + start) / 2.0);
  // cout << start << " " << last << endl;
  // cout << (abs(*itrn - *itrp) - 1) * ((last + start) / 2.0) << endl;
  // cout << score << endl;

  st[t[q.first]].erase(q.first);
  st[q.second].insert(q.first);

  itrn = st[q.second].upper_bound(q.first);
  itrp = st[q.second].lower_bound(q.first);
  itrp--;
  last = (abs(*itrp - *itrn) - 1) * c[q.second];
  start = c[q.second];

  score += (abs(*itrp - *itrn) - 1) * ((last + start) / 2.0);
  last = (abs(*itrp - q.first) - 1) * c[q.second];
  score -= (abs(*itrp - q.first) - 1) * ((last + start) / 2.0);
  last = (abs(*itrn - q.first) - 1) * c[q.second];
  score -= (abs(*itrn - q.first) - 1) * ((last + start) / 2.0);

  t[q.first] = q.second;
}
int main(void) {

  cin >> d;
  s.resize(d, vector<ll>(26));

  rep(i, 26) cin >> c[i];
  rep(i, d) {
    rep(j, 26) { cin >> s[i][j]; }
  }

  t.resize(d);
  rep(i, d) {
    cin >> t[i];
    t[i]--;
  }

  ll score = calcScore();
  ll m;
  cin >> m;
  vector<pair<ll, ll>> q(m);
  rep(i, m) {
    cin >> q[i].first >> q[i].second;
    q[i].first--;
    q[i].second--;
  }

  vector<set<ll>> st(26);
  rep(i, d) { st[t[i]].insert(i); }

  rep(i, 26) {
    st[i].insert(-1);
    st[i].insert(d);
  }

  // cout << score << endl;

  rep(i, m) {
    updateScore(score, q[i], st);
    cout << score << endl;
  }
}