Problem p02618 (C++) — buggy submission, verdict: Time Limit Exceeded

// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <locale>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

// typedef
//------------------------------------------
typedef long long LL;
typedef vector<int> VI;
typedef vector<bool> VB;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<LL> VLL;
typedef vector<VI> VVI;
typedef vector<VB> VVB;
typedef vector<VS> VVS;
typedef vector<VLL> VVLL;
typedef vector<VVI> VVVI;
typedef vector<VVLL> VVVLL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<int, string> PIS;
typedef pair<string, int> PSI;
typedef pair<string, string> PSS;
typedef vector<PII> VPII;
typedef vector<PLL> VPLL;
typedef vector<VPII> VVPII;
typedef vector<VPLL> VVPLL;
typedef vector<VS> VVS;
typedef map<int, int> MII;
typedef map<LL, LL> MLL;
typedef map<string, int> MSI;
typedef map<int, string> MIS;

// container util
//------------------------------------------

typedef int pInt[4];
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) int((a).size())
#define EACH(i, arr)                                                           \\
  for (typeof((arr).begin()) i = (arr).begin(); i != (arr).end(); ++i)
#define EXIST(str, e) ((str).find(e) != (str).end())
#define COUNT(arr, v) count((arr).begin(), (arr).end(), v)
#define SEARCH(v, w) search((v).begin(), (v).end(), (w).begin(), (w).end())
#define SORT(c) sort((c).begin(), (c).end())
#define RSORT(c) sort((c).rbegin(), (c).rend())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define ROTATE_LEFT(arr, c)                                                    \\
  rotate((arr).begin(), (arr).begin() + (c), (arr).end())
#define ROTATE_RIGHT(arr, c)                                                   \\
  rotate((arr).rbegin(), (arr).rbegin() + (c), (arr).rend())
#define SUMI(arr) accumulate((arr).begin(), (arr).end(), 0)
#define SUMD(arr) accumulate((arr).begin(), (arr).end(), 0.)
#define SUMLL(arr) accumulate((arr).begin(), (arr).end(), 0LL)
#define MULD(arr)                                                              \\
  accumulate((arr).begin(), (arr).end(), 1., multiplies<double>())
#define UB(arr, n) upper_bound((arr).begin(), (arr).end(), n)
#define LB(arr, n) lower_bound((arr).begin(), (arr).end(), n)
#define PB push_back
#define MP make_pair
#define ft first
#define sd second

// input output
//------------------------------------------
#define GL(s) getline(cin, (s))
#define INIT()                                                                 \\
  std::ios::sync_with_stdio(false);                                            \\
  std::cin.tie(0)
#define OUT(d) std::cout << (d)
#define OUT_L(d) std::cout << (d) << endl
#define FOUT(n, data) std::cout << std::fixed << std::setprecision(n) << (data)
#define FOUT_L(n, data)                                                        \\
  std::cout << std::fixed << std::setprecision(n) << (data) << "\\n"
#define EL() printf("\\n")
#define SHOW_VECTOR(v)                                                         \\
  {                                                                            \\
    std::cerr << #v << "\\t:";                                                  \\
    for (const auto &xxx : v) {                                                \\
      std::cerr << xxx << " ";                                                 \\
    }                                                                          \\
    std::cerr << "\\n";                                                         \\
  }
#define SHOW_MAP(v)                                                            \\
  {                                                                            \\
    std::cerr << #v << endl;                                                   \\
    for (const auto &xxx : v) {                                                \\
      std::cerr << xxx.first << " " << xxx.second << "\\n";                     \\
    }                                                                          \\
  }
#define Yes() printf("Yes\\n")
#define No() printf("No\\n")
#define YES() printf("YES\\n")
#define NO() printf("NO\\n")
#define Yay() printf("Yay!\\n")
#define Nnn() printf(":(\\n")
#define CE(x, y) ((x + y - 1) / (y))

template <typename T1, typename T2>
istream &operator>>(istream &in, pair<T1, T2> &p) {
  in >> p.first >> p.second;
  return in;
}

template <typename T> istream &operator>>(istream &in, vector<T> &v) {
  for (auto &x : v)
    in >> x;
  return in;
}

template <typename T1, typename T2>
ostream &operator<<(ostream &out, const std::pair<T1, T2> &p) {
  out << "[" << p.first << ", " << p.second << "]"
      << "\\n";
  return out;
}

template <class T1, class T2> inline bool chmin(T1 &a, T2 b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}

template <class T1, class T2> inline bool chmax(T1 &a, T2 b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}

// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define FORLL(i, a, b) for (LL i = LL(a); i < LL(b); ++i)
#define RFORLL(i, a, b) for (LL i = LL(b) - 1; i >= LL(a); --i)
#define REPLL(i, n) for (LL i = 0; i < LL(n); ++i)
#define RREPLL(i, n) for (LL i = LL(n) - 1; i >= 0; --i)
#define FOREACH(x, arr) for (auto &(x) : (arr))

// Option + Control + K  Terminal
// Command + Control + K    Run
// Command + b   EOF

//------------------------------------------
//------------------------------------------

constexpr int types = 26;

LL calc_score(VLL &c, VVLL &s, VLL &t) {
  LL score = 0;
  VLL prev(types, -1);

  // i日目
  for (int i = 0; i < t.size(); i++) {
    score += s[i][t[i]];
    prev[t[i]] = i;
    for (int j = 0; j < types; j++) {
      score -= c[j] * (i - prev[j]);
    }
  }
  return score;
}

// k日間のみ
LL calc_score(VLL &c, VVLL &s, VLL &t, int k) {
  LL score = 0;
  VLL prev(types, -1);

  // i日目
  for (int i = 0; i < k; i++) {
    score += s[i][t[i]];
    prev[t[i]] = i;
    for (int j = 0; j < types; j++) {
      score -= c[j] * (i - prev[j]);
    }
  }
  return score;
}

constexpr double TIME_LIMIT = 2000;
constexpr int INF = 1e9;

std::mt19937 mt{std::random_device{}()};

int main() {

  auto start = chrono::system_clock::now();

  LL D;
  cin >> D;

  uniform_int_distribution<int> types_dist(0, types - 1);
  uniform_int_distribution<int> days_dist(0, D - 1);
  uniform_int_distribution<int> inf_dist(0, INF - 1);
  //    uniform_int_distribution<int> select_days_dist(1, max<LL>(1, min<LL>(D,
  //    3)));

  // タイプiのコンテストを開かないと出る不満
  VLL c(types);
  cin >> c;

  // s[i][j]
  // i日目にタイプjのコンテストを開く利得
  VVLL s(D, VLL(types));
  cin >> s;

  VLL t;

  // 初期解の生成
  for (int i = 0; i < D; i++) {
    LL ans = LLONG_MIN;
    LL good_type = -1;
    for (int j = 0; j < types; j++) {
      auto ct = t;
      ct.push_back(j);
      LL score = calc_score(c, s, ct);
      if (score > ans) {
        ans = score;
        good_type = j;
      }
    }
    t.push_back(good_type);
  }

  // 探索

  double start_temp = 100;
  double end_temp = 5;

  while (true) {
    auto now = chrono::system_clock::now();
    double elapsed =
        std::chrono::duration_cast<std::chrono::milliseconds>(now - start)
            .count();
    if (elapsed >= 1920)
      break;

    double temp = start_temp + (end_temp - start_temp) * (elapsed) / TIME_LIMIT;

    auto nt = t;
    { nt[days_dist(mt)] = types_dist(mt); }

    LL prev_score = calc_score(c, s, t);
    LL new_score = calc_score(c, s, nt);

    double prev = exp((new_score - prev_score) / temp);
    //        cout << temp << " " << prev << endl;

    if (prev > (inf_dist(mt) % INF) / (double)INF) {
      t = nt;
    }
  }

  for (auto x : t)
    cout << x + 1 << "\\n";
  //    for (auto x: t) printf("%lld\\n", x + 1);
  //    cout << improve_cnt << endl;
}


Error: TLE

Fixed submission:

// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <locale>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

// typedef
//------------------------------------------
typedef long long LL;
typedef vector<int> VI;
typedef vector<bool> VB;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<LL> VLL;
typedef vector<VI> VVI;
typedef vector<VB> VVB;
typedef vector<VS> VVS;
typedef vector<VLL> VVLL;
typedef vector<VVI> VVVI;
typedef vector<VVLL> VVVLL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<int, string> PIS;
typedef pair<string, int> PSI;
typedef pair<string, string> PSS;
typedef vector<PII> VPII;
typedef vector<PLL> VPLL;
typedef vector<VPII> VVPII;
typedef vector<VPLL> VVPLL;
typedef vector<VS> VVS;
typedef map<int, int> MII;
typedef map<LL, LL> MLL;
typedef map<string, int> MSI;
typedef map<int, string> MIS;

// container util
//------------------------------------------

typedef int pInt[4];
#define ALL(a) (a).begin(), (a).end()
#define SZ(a) int((a).size())
#define EACH(i, arr)                                                           \\
  for (typeof((arr).begin()) i = (arr).begin(); i != (arr).end(); ++i)
#define EXIST(str, e) ((str).find(e) != (str).end())
#define COUNT(arr, v) count((arr).begin(), (arr).end(), v)
#define SEARCH(v, w) search((v).begin(), (v).end(), (w).begin(), (w).end())
#define SORT(c) sort((c).begin(), (c).end())
#define RSORT(c) sort((c).rbegin(), (c).rend())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define ROTATE_LEFT(arr, c)                                                    \\
  rotate((arr).begin(), (arr).begin() + (c), (arr).end())
#define ROTATE_RIGHT(arr, c)                                                   \\
  rotate((arr).rbegin(), (arr).rbegin() + (c), (arr).rend())
#define SUMI(arr) accumulate((arr).begin(), (arr).end(), 0)
#define SUMD(arr) accumulate((arr).begin(), (arr).end(), 0.)
#define SUMLL(arr) accumulate((arr).begin(), (arr).end(), 0LL)
#define MULD(arr)                                                              \\
  accumulate((arr).begin(), (arr).end(), 1., multiplies<double>())
#define UB(arr, n) upper_bound((arr).begin(), (arr).end(), n)
#define LB(arr, n) lower_bound((arr).begin(), (arr).end(), n)
#define PB push_back
#define MP make_pair
#define ft first
#define sd second

// input output
//------------------------------------------
#define GL(s) getline(cin, (s))
#define INIT()                                                                 \\
  std::ios::sync_with_stdio(false);                                            \\
  std::cin.tie(0)
#define OUT(d) std::cout << (d)
#define OUT_L(d) std::cout << (d) << endl
#define FOUT(n, data) std::cout << std::fixed << std::setprecision(n) << (data)
#define FOUT_L(n, data)                                                        \\
  std::cout << std::fixed << std::setprecision(n) << (data) << "\\n"
#define EL() printf("\\n")
#define SHOW_VECTOR(v)                                                         \\
  {                                                                            \\
    std::cerr << #v << "\\t:";                                                  \\
    for (const auto &xxx : v) {                                                \\
      std::cerr << xxx << " ";                                                 \\
    }                                                                          \\
    std::cerr << "\\n";                                                         \\
  }
#define SHOW_MAP(v)                                                            \\
  {                                                                            \\
    std::cerr << #v << endl;                                                   \\
    for (const auto &xxx : v) {                                                \\
      std::cerr << xxx.first << " " << xxx.second << "\\n";                     \\
    }                                                                          \\
  }
#define Yes() printf("Yes\\n")
#define No() printf("No\\n")
#define YES() printf("YES\\n")
#define NO() printf("NO\\n")
#define Yay() printf("Yay!\\n")
#define Nnn() printf(":(\\n")
#define CE(x, y) ((x + y - 1) / (y))

template <typename T1, typename T2>
istream &operator>>(istream &in, pair<T1, T2> &p) {
  in >> p.first >> p.second;
  return in;
}

template <typename T> istream &operator>>(istream &in, vector<T> &v) {
  for (auto &x : v)
    in >> x;
  return in;
}

template <typename T1, typename T2>
ostream &operator<<(ostream &out, const std::pair<T1, T2> &p) {
  out << "[" << p.first << ", " << p.second << "]"
      << "\\n";
  return out;
}

template <class T1, class T2> inline bool chmin(T1 &a, T2 b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}

template <class T1, class T2> inline bool chmax(T1 &a, T2 b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}

// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define FORLL(i, a, b) for (LL i = LL(a); i < LL(b); ++i)
#define RFORLL(i, a, b) for (LL i = LL(b) - 1; i >= LL(a); --i)
#define REPLL(i, n) for (LL i = 0; i < LL(n); ++i)
#define RREPLL(i, n) for (LL i = LL(n) - 1; i >= 0; --i)
#define FOREACH(x, arr) for (auto &(x) : (arr))

// Option + Control + K  Terminal
// Command + Control + K    Run
// Command + b   EOF

//------------------------------------------
//------------------------------------------

constexpr int types = 26;

LL calc_score(VLL &c, VVLL &s, VLL &t) {
  LL score = 0;
  VLL prev(types, -1);

  // i日目
  for (int i = 0; i < t.size(); i++) {
    score += s[i][t[i]];
    prev[t[i]] = i;
    for (int j = 0; j < types; j++) {
      score -= c[j] * (i - prev[j]);
    }
  }
  return score;
}

// k日間のみ
LL calc_score(VLL &c, VVLL &s, VLL &t, int k) {
  LL score = 0;
  VLL prev(types, -1);

  // i日目
  for (int i = 0; i < k; i++) {
    score += s[i][t[i]];
    prev[t[i]] = i;
    for (int j = 0; j < types; j++) {
      score -= c[j] * (i - prev[j]);
    }
  }
  return score;
}

constexpr double TIME_LIMIT = 2000;
constexpr int INF = 1e9;

std::mt19937 mt{std::random_device{}()};

int main() {

  LL D;
  scanf("%lld", &D);

  uniform_int_distribution<int> types_dist(0, types - 1);
  uniform_int_distribution<int> days_dist(0, D - 1);
  uniform_int_distribution<int> inf_dist(0, INF - 1);
  //    uniform_int_distribution<int> select_days_dist(1, max<LL>(1, min<LL>(D,
  //    3)));

  // タイプiのコンテストを開かないと出る不満
  VLL c(types);
  for (int i = 0; i < types; i++)
    scanf("%lld", &c[i]);

  // s[i][j]
  // i日目にタイプjのコンテストを開く利得
  VVLL s(D, VLL(types));
  REP(i, D) {
    REP(j, types) { scanf("%lld", &s[i][j]); }
  }

  VLL t;

  // 初期解の生成
  for (int i = 0; i < D; i++) {
    LL ans = LLONG_MIN;
    LL good_type = -1;
    for (int j = 0; j < types; j++) {
      auto ct = t;
      ct.push_back(j);
      LL score = calc_score(c, s, ct);
      if (score > ans) {
        ans = score;
        good_type = j;
      }
    }
    t.push_back(good_type);
  }

  // 探索
  auto start = chrono::system_clock::now();
  double start_temp = 100;
  double end_temp = 5;

  LL improve_cnt = 0;
  while (true) {
    auto now = chrono::system_clock::now();
    double elapsed =
        std::chrono::duration_cast<std::chrono::milliseconds>(now - start)
            .count();
    if (elapsed >= 1960)
      break;

    double temp = start_temp + (end_temp - start_temp) * (elapsed) / TIME_LIMIT;

    auto nt = t;
    { nt[days_dist(mt)] = types_dist(mt); }

    LL prev_score = calc_score(c, s, t);
    LL new_score = calc_score(c, s, nt);

    double prev = exp((new_score - prev_score) / temp);
    //        cout << temp << " " << prev << endl;

    if (prev > (inf_dist(mt) % INF) / (double)INF) {
      t = nt;
      //            improve_cnt++;
    }
  }

  for (auto x : t)
    printf("%lld\\n", x + 1);
  //    cout << improve_cnt << endl;
}