Problem p02618 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
#define Pool(i, m, n) for (ll i = n; i >= m; i--)
#define mod 1000000007ll
#define flagcount __builtin_popcount
#define flag(x) (1 << x)
#define flagadd(bit, x) bit |= flag(x)
#define flagpop(bit, x) bit &= ~flag(x)
#define flagon(bit, i) bit &flag(i)
#define flagoff(bit, i) !(bit & (1 << i))
#define all(v) v.begin(), v.end()
#define low2way(v, x) lower_bound(all(v), x)
#define high2way(v, x) upper_bound(all(v), x)
#define idx_lower(v, x)                                                        \
  (distance(v.begin(), low2way(v, x))) // 配列vでx未満の要素数を返す
#define idx_upper(v, x)                                                        \
  (distance(v.begin(), high2way(v, x))) // 配列vでx以下の要素数を返す
#define idx_lower2(v, x)                                                       \
  (v.size() - idx_lower(v, x)) // 配列vでx以上の要素数を返す
#define idx_upper2(v, x)                                                       \
  (v.size() - idx_upper(v, x)) // 配列vでxより大きい要素の数を返す
#define putout(a) cout << a << endl
#define Gput(a, b) G[a].push_back(b)
#define Sum(v) accumulate(all(v), 0ll)
#define gcd(x, y) __gcd(x, y)
ll ctoi(char c) {
  if (c >= '0' && c <= '9') {
    return c - '0';
  }
  return 0;
}
template <typename T> T lcm(T x, T y) {
  T z = gcd(x, y);
  return x * y / z;
}
template <typename T> bool primejudge(T n) {
  if (n < 2)
    return false;
  else if (n == 2)
    return true;
  else if (n % 2 == 0)
    return false;
  double sqrtn = sqrt(n);
  for (T i = 3; i < sqrtn + 1; i++) {
    if (n % i == 0) {
      return false;
    }
    i++;
  }
  return true;
}
// 場合によって使い分ける
// const ll dx[4]={1,0,-1,0};
// const ll dy[4]={0,1,0,-1};
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
// 2次元配列の宣言
// vector<vector<ll>> field(h, vector<ll>(w));

int main() {
  cout << fixed << setprecision(30);
  ll D;
  cin >> D; //=365
  vec c(26);
  loop(i, 26) cin >> c[i];
  vector<vector<ll>> s(D, vector<ll>(26));
  loop(i, D) { loop(j, 26) cin >> s[i][j]; }
  vec t(D);
  loop(i, D) {
    ll nowans = -10000000;
    ll ans = 1;
    loop(j, 26) {
      if (s[i][j] > nowans)
        ans = j + 1;
      nowans = max(nowans, s[i][j]);
    }
    t[i] = ans;
  }
  /*
  //score計算
  ll score = 0;
  vector<ll> before(26); //直近で何日前に開催したか？
  loop(i, D)
  {
      score += s[i][t[i] - 1];
      before[t[i] - 1] = i + 1; //リセット
      //スコア減点
      loop(j, 26)
      {
          score -= c[j] * ((i + 1) - before[j]);
      }
  }
  */
  ll M;
  M = 300000;
  ll greatscore = -10000000000;
  vec answer(D);
  loop(k, M) {
    ll d, q;
    d = (rand() % D);
    q = (rand() % 26) + 1;
    ll old = t[d];
    t[d] = q;
    ll score = 0;
    vector<ll> before(26); // 直近で何日前に開催したか？
    loop(i, D) {
      score += s[i][t[i] - 1];
      before[t[i] - 1] = i + 1; // リセット
      // スコア減点
      loop(j, 26) { score -= c[j] * ((i + 1) - before[j]); }
    }
    if (greatscore < score) {
      answer = t;
    } else
      t[d] = old;
    greatscore = max(greatscore, score);
  }
  loop(i, D) { putout(answer[i]); }
  return 0;
}


Fixed submission:
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
#define Pool(i, m, n) for (ll i = n; i >= m; i--)
#define mod 1000000007ll
#define flagcount __builtin_popcount
#define flag(x) (1 << x)
#define flagadd(bit, x) bit |= flag(x)
#define flagpop(bit, x) bit &= ~flag(x)
#define flagon(bit, i) bit &flag(i)
#define flagoff(bit, i) !(bit & (1 << i))
#define all(v) v.begin(), v.end()
#define low2way(v, x) lower_bound(all(v), x)
#define high2way(v, x) upper_bound(all(v), x)
#define idx_lower(v, x)                                                        \
  (distance(v.begin(), low2way(v, x))) // 配列vでx未満の要素数を返す
#define idx_upper(v, x)                                                        \
  (distance(v.begin(), high2way(v, x))) // 配列vでx以下の要素数を返す
#define idx_lower2(v, x)                                                       \
  (v.size() - idx_lower(v, x)) // 配列vでx以上の要素数を返す
#define idx_upper2(v, x)                                                       \
  (v.size() - idx_upper(v, x)) // 配列vでxより大きい要素の数を返す
#define putout(a) cout << a << endl
#define Gput(a, b) G[a].push_back(b)
#define Sum(v) accumulate(all(v), 0ll)
#define gcd(x, y) __gcd(x, y)
ll ctoi(char c) {
  if (c >= '0' && c <= '9') {
    return c - '0';
  }
  return 0;
}
template <typename T> T lcm(T x, T y) {
  T z = gcd(x, y);
  return x * y / z;
}
template <typename T> bool primejudge(T n) {
  if (n < 2)
    return false;
  else if (n == 2)
    return true;
  else if (n % 2 == 0)
    return false;
  double sqrtn = sqrt(n);
  for (T i = 3; i < sqrtn + 1; i++) {
    if (n % i == 0) {
      return false;
    }
    i++;
  }
  return true;
}
// 場合によって使い分ける
// const ll dx[4]={1,0,-1,0};
// const ll dy[4]={0,1,0,-1};
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
// 2次元配列の宣言
// vector<vector<ll>> field(h, vector<ll>(w));

int main() {
  cout << fixed << setprecision(30);
  ll D;
  cin >> D; //=365
  vec c(26);
  loop(i, 26) cin >> c[i];
  vector<vector<ll>> s(D, vector<ll>(26));
  loop(i, D) { loop(j, 26) cin >> s[i][j]; }
  vec t(D);
  loop(i, D) {
    ll nowans = -10000000;
    ll ans = 1;
    loop(j, 26) {
      if (s[i][j] > nowans)
        ans = j + 1;
      nowans = max(nowans, s[i][j]);
    }
    t[i] = ans;
  }
  /*
  //score計算
  ll score = 0;
  vector<ll> before(26); //直近で何日前に開催したか？
  loop(i, D)
  {
      score += s[i][t[i] - 1];
      before[t[i] - 1] = i + 1; //リセット
      //スコア減点
      loop(j, 26)
      {
          score -= c[j] * ((i + 1) - before[j]);
      }
  }
  */
  ll M;
  M = 200000;
  ll greatscore = -10000000000;
  vec answer(D);
  loop(k, M) {
    ll d, q;
    d = (rand() % D);
    q = (rand() % 26) + 1;
    ll old = t[d];
    t[d] = q;
    ll score = 0;
    vector<ll> before(26); // 直近で何日前に開催したか？
    loop(i, D) {
      score += s[i][t[i] - 1];
      before[t[i] - 1] = i + 1; // リセット
      // スコア減点
      loop(j, 26) { score -= c[j] * ((i + 1) - before[j]); }
    }
    if (greatscore < score) {
      answer = t;
    } else
      t[d] = old;
    greatscore = max(greatscore, score);
  }
  loop(i, D) { putout(answer[i]); }
  return 0;
}