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

#include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
// #include <stdio.h>
// #include <stack>
// #include <queue>
// #include <cstdio>
#include <cmath>
#include <fstream>
#include <iterator>
#include <map>
// #include <list>
#include <iomanip>
// #include <stdlib.h>
// #include <cctype>

using namespace std;

#define IOS ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define prec std::cout << std::fixed << std::setprecision(15);
#define endl "\\n"
#define MOD 1000000007
#define Int int64_t
#define PI 3.14159265358979
// #define rep(i, n) for (int i = 0; i < int(n); i++)
#define ssort(z) sort(z.begin(), z.end())
#define rsort(z) sort(z.rbegin(), z.rend())
#define eerase(z) z.erase(unique(z.begin(), z.end()), z.end())
#define ccnt(z, w) count(z.begin(), z.end(), w)
#define rep(i, a, n) for (Int(i) = (a); (i) < (n); (i)++)
#define repq(i, a, n) for (Int(i) = (a); (i) <= (n); (i)++)
const int MAX_N = 1000000;
const Int MAX_N_Int = 1000000000000;

template <typename T>
void printV(const std::vector<T> &v, const char *const separator = " ") {
  if (!v.empty()) {
    std::copy(v.begin(), --v.end(),
              std::ostream_iterator<T>(std::cout, separator));
    std::cout << v.back() << "\\n";
  }
}

int D;
string str, s, u;
vector<int> c(26);
vector<int> t(366);
vector<vector<int>> ss(366, vector<int>(26));
// vector<vector<int>> last(365, vector<int>(26));
vector<int> last(26);
int satisfaction = 0;
int init_score;

int init() {
  vector<int> c_copy(26);
  c_copy = c;
  rsort(c_copy);
  for (int i = 0; i < D; ++i) {
    t[i] = 1;
  }

  return 0;
}

int score() {
  for (int d = 0; d < D; ++d) {
    int i = t[d] - 1;
    satisfaction += ss[d][i];

    last[i] = d + 1;
    for (int cc = 0; cc < 26; ++cc) {
      satisfaction -= c[cc] * ((d + 1) - last[cc]);
    }
    // cout<<satisfaction<<endl;
  }

  return satisfaction;
}

int loop() {
  int old_score = init_score;
  int new_score = 0;
  for (int d = 0; d < D; ++d) {
    int now = t[d];
    t[d]++;
    new_score = score();
    if (new_score <= old_score) {
      t[d] = now;
      continue;
    } else {
      old_score = new_score;
    }
    // cout<<d<<" "<<new_score<<endl;
  }

  return 0;
}

int main() {
  IOS;
  prec;

  cin >> D;
  rep(i, 0, 26) cin >> c[i];
  for (int y = 0; y < D; ++y) {
    for (int x = 0; x < 26; ++x) {
      cin >> ss[y][x];
    }
  }
  // rep(i,0,D)cin>>t[i];
  // cout<<score();
  init();
  init_score = score();
  loop();
  for (int j = 0; j < D; ++j) {
    cout << t[j] + 1 << endl;
  }
  // cout<<satisfaction;

  cout << endl;
  return 0;
}


Error: WA

Fixed submission:

#include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
// #include <stdio.h>
// #include <stack>
// #include <queue>
// #include <cstdio>
#include <cmath>
#include <fstream>
#include <iterator>
#include <map>
// #include <list>
#include <iomanip>
// #include <stdlib.h>
// #include <cctype>

using namespace std;

#define IOS ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define prec std::cout << std::fixed << std::setprecision(15);
#define endl "\\n"
#define MOD 1000000007
#define Int int64_t
#define PI 3.14159265358979
// #define rep(i, n) for (int i = 0; i < int(n); i++)
#define ssort(z) sort(z.begin(), z.end())
#define rsort(z) sort(z.rbegin(), z.rend())
#define eerase(z) z.erase(unique(z.begin(), z.end()), z.end())
#define ccnt(z, w) count(z.begin(), z.end(), w)
#define rep(i, a, n) for (Int(i) = (a); (i) < (n); (i)++)
#define repq(i, a, n) for (Int(i) = (a); (i) <= (n); (i)++)
const int MAX_N = 1000000;
const Int MAX_N_Int = 1000000000000;

template <typename T>
void printV(const std::vector<T> &v, const char *const separator = " ") {
  if (!v.empty()) {
    std::copy(v.begin(), --v.end(),
              std::ostream_iterator<T>(std::cout, separator));
    std::cout << v.back() << "\\n";
  }
}

int D;
string str, s, u;
vector<int> c(26);
vector<int> t(365);
vector<vector<int>> ss(365, vector<int>(26));
// vector<vector<int>> last(365, vector<int>(26));
vector<int> last(26);
int satisfaction = 0;
int init_score;

int init() {
  vector<int> c_copy(26);
  c_copy = c;
  rsort(c_copy);
  for (int i = 0; i < D; ++i) {
    t[i] = i + 1;
  }

  return 0;
}

int score() {
  for (int d = 0; d < D; ++d) {
    int i = t[d] - 1;
    satisfaction += ss[d][i];

    last[i] = d + 1;
    for (int cc = 0; cc < 26; ++cc) {
      satisfaction -= c[cc] * ((d + 1) - last[cc]);
    }
    // cout<<satisfaction<<endl;
  }

  return satisfaction;
}

int loop() {
  int old_score = init_score;
  int new_score = 0;
  for (int d = 0; d < D; ++d) {
    int now = t[d];
    t[d]++;
    new_score = score();
    if (new_score <= old_score) {
      t[d] = now;
      continue;
    } else {
      old_score = new_score;
    }
    // cout<<d<<" "<<new_score<<endl;
  }

  return 0;
}

int main() {
  IOS;
  prec;

  cin >> D;
  rep(i, 0, 26) cin >> c[i];
  for (int y = 0; y < D; ++y) {
    for (int x = 0; x < 26; ++x) {
      cin >> ss[y][x];
    }
  }
  // rep(i,0,D)cin>>t[i];
  // cout<<score();
  init();
  init_score = score();
  loop();
  for (int j = 0; j < D; ++j) {
    cout << t[j] + 1 << endl;
  }
  // cout<<satisfaction;

  cout << endl;
  return 0;
}