fork download
  1. //#pragma GCC optimize("O3", "unroll-loops")
  2. //#pragma GCC target("avx2", "bmi", "bmi2", "lzcnt", "popcnt")
  3.  
  4. #include <bits/stdc++.h>
  5. #define ldb long double
  6. //#define double ldb
  7. #define db double
  8. #define unomap unordered_map
  9. #define unoset unordered_set
  10. #define endl '\n'
  11. #define str string
  12. #define strstr stringstream
  13. #define sz(a) (int)a.size()
  14. #define ll long long
  15. //#define int ll
  16. #define pii pair <int, int>
  17. #define pll pair <ll, ll>
  18. #define Unique(a) a.resize(unique(all(a)) - a.begin())
  19. #define ull unsigned ll
  20. #define fir first
  21. #define sec second
  22. #define idc cin.ignore()
  23. #define lb lower_bound
  24. #define ub upper_bound
  25. #define all(s) s.begin(), s.end()
  26. #define rev reverse
  27. #define gcd __gcd
  28. #define pushb push_back
  29. #define popb pop_back
  30. #define pushf push_front
  31. #define popf pop_front
  32. #define mul2x(a, x) a << x
  33. #define div2x(a, x) a >> x
  34. #define lcm(a, b) (a / __gcd(a, b) * b)
  35. #define log_base(x, base) log(x) / log(base)
  36. #define debug cerr << "No errors!"; exit(0);
  37. #define forw(i, a, b) for (int i = a; i <= b; ++i)
  38. #define forw2(i, a, b) for (ll i = a; i <= b; ++i)
  39. #define fors(i, a, b) for (int i = a; i >= b; --i)
  40. #define fors2(i, a, b) for (ll i = a; i >= b; --i)
  41. #define pqueue priority_queue
  42. #define sqrt sqrtl
  43. #define i128 __int128
  44. #define popcount __builtin_popcountll
  45. #define BIT(x, i) (((x) >> (i)) & 1)
  46. #define MASK(x) ((1LL) << (x))
  47. #define want_digit(x) cout << fixed << setprecision(x);
  48. #define excuting_time 1000.0 * clock() / CLOCKS_PER_SEC
  49. #define mapa make_pair
  50. using namespace std;
  51. const int MOD = 1e9 + 7; // 998244353
  52. const int inf = 1e9;
  53. const ll INF = 1e18;
  54. const int N = 1e5;
  55. const int T = 1e2;
  56.  
  57. mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
  58. ll random(const ll &L, const ll &R) {
  59. return uniform_int_distribution<ll> (L, R) (rng);
  60. }
  61.  
  62. template <class X, class Y>
  63. bool minimize(X &x, const Y &y) {
  64. return x > y ? x = y, true : false;
  65. }
  66.  
  67. int n, k, t, c[T + 5][T + 5], a[N + 5];
  68. ll dp[N + 5][T + 5], mn[N + 5], f[N + 5][T + 5];
  69.  
  70. ll get(int l, int r, int type) {
  71. if (l > r) swap(l, r);
  72. return f[r][type] - f[l - 1][type];
  73. }
  74.  
  75. void solve() {
  76. cin >> n >> t >> k;
  77. forw (i, 1, t) forw (j, 1, t) {
  78. cin >> c[i][j];
  79. }
  80. forw (i, 1, n) cin >> a[i];
  81.  
  82. forw (mid, 1, t) forw (i, 1, t) forw (j, 1, t) {
  83. minimize(c[i][j], c[i][mid] + c[mid][j]);
  84. }
  85.  
  86. forw (i, 1, n) forw (j, 1, t) {
  87. f[i][j] = f[i - 1][j] + c[a[i]][j];
  88. }
  89.  
  90. forw (i, k, n) {
  91. mn[i] = INF;
  92. forw (j, 1, t) {
  93. if (i < k * 2) {
  94. dp[i][j] = f[i][j];
  95. }
  96. else dp[i][j] = get(i, i - k + 1, j) + mn[i - k];
  97. minimize(mn[i], dp[i][j]);
  98. }
  99. }
  100.  
  101. /*
  102.   forw (j, 1, t) {
  103.   forw (i, 1, n) cout << dp[i][j] << ' ';
  104.   cout << endl;
  105.   }
  106.   */
  107.  
  108. cout << mn[n] << endl;
  109. }
  110.  
  111. signed main() {
  112. ios::sync_with_stdio(false), cin.tie(nullptr);
  113. srand(time(NULL));
  114. #define name "test"
  115. if (fopen(name".INP", "r")) {
  116. freopen(name".INP", "r", stdin);
  117. freopen(name".OUT", "w", stdout);
  118. }
  119. bool testCase = false;
  120. int numTest = 1;
  121. // cin >> numTest;
  122. forw (i, 1, numTest) {
  123. if (testCase) cout << "Case " << i << ": ";
  124. solve();
  125. }
  126. return 0;
  127. }
  128.  
Success #stdin #stdout 0s 5760KB
stdin
Standard input is empty
stdout
1000000000000000000