oj.uz

Submission #824689

# Submission time Handle Problem Language Result Execution time Memory
824689 2023-08-14T08:49:55 Z arush_agu Toll (BOI17_toll) C++17
100 / 100
 1079 ms 6940 KB 
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#ifdef DEBUG
#include <time.h>
#endif

#define all(a) (a).begin(), (a).end()
#define rev(a) (a).rbegin(), (a).rend()
#define F first
#define S second
int recur_depth = 0;
#ifdef DEBUG
#define dbg(x)                                                                 \
  {                                                                            \
    ++recur_depth;                                                             \
    auto x_ = x;                                                               \
    --recur_depth;                                                             \
    cerr << string(recur_depth, '\t') << "\e[91m" << __func__ << ":"           \
         << __LINE__ << "\t" << #x << " = " << x_ << "\e[39m" << endl;         \
  }
#else
#define dbg(x)
#endif

using namespace std;
using namespace __gnu_pbds;

typedef pair<int, int> ii;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> llll;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pair<int, int>> vii;
typedef vector<vii> vvii;

typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pair<ll, ll>> vll;
typedef vector<vll> vvll;

typedef vector<bool> vb;

template <class type1>
using ordered_set = tree<type1, null_type, less<type1>, rb_tree_tag,
                         tree_order_statistics_node_update>;

template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
  return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T_container, typename T = typename enable_if<
                                    !is_same<T_container, string>::value,
                                    typename T_container::value_type>::type>
ostream &operator<<(ostream &os, const T_container &v) {
  os << '{';
  string sep;
  for (const T &x : v)
    os << sep << x, sep = ", ";
  return os << '}';
}

const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1e18;
const ld EPS = 1e-9;

const int MAX_N = 5e4 + 10;
const int MAX_K = 6;

int k, n, m, o;
ll dist[MAX_N][MAX_K];
int block[MAX_N], mod[MAX_N];
ll dp[MAX_N];

void solve() {
  cin >> k >> n >> m >> o;
  for (int i = 0; i <= n; i++)
    for (int j = 0; j <= k; j++)
      dist[i][j] = INF;
  for (int i = 0; i < m; i++) {
    int u, v;
    ll t;
    cin >> u >> v >> t;
    dist[u][v % k] = t;
  }

  for (int i = 0; i <= n; i++)
    block[i] = i / k, mod[i] = i % k;

  while (o--) {
    int a, b;
    cin >> a >> b;

    if (block[a] >= block[b]) {
      cout << "-1\n";
      continue;
    }

    for (int i = 0; i <= n; i++)
      dp[i] = INF;
    dp[b] = 0;
    int idx = b - mod[b];
    int final_idx = a - mod[a];
    for (idx -= k; idx >= final_idx; idx -= k) {
      for (int i = idx; i < idx + k; i++) {
        for (int j = 0; j < k; j++)
          dp[i] =
              min(dp[i], (idx + k + j <= n ? dp[idx + k + j] : 0) + dist[i][j]);
      }
    }

    if (dp[a] >= INF)
      cout << "-1\n";
    else
      cout << dp[a] << '\n';
  }
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);

  clock_t start = clock();

  int test_cases = 1;
  // cin >> test_cases;

  while (test_cases--)
    solve();

#ifdef DEBUG
  cerr << fixed << setprecision(10)
       << "\nTime Taken: " << (double)(clock() - start) / CLOCKS_PER_SEC
       << "s\n";
#endif
  return 0;
}

Compilation message

toll.cpp: In function 'int main()':
toll.cpp:148:11: warning: unused variable 'start' [-Wunused-variable]
  148 |   clock_t start = clock();
      |           ^~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 757 ms 4552 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 772 ms 4492 KB Output is correct
9 Correct 755 ms 4348 KB Output is correct
10 Correct 765 ms 3588 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 912 ms 5176 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 23 ms 500 KB Output is correct
8 Correct 27 ms 524 KB Output is correct
9 Correct 1059 ms 4352 KB Output is correct
10 Correct 1079 ms 5888 KB Output is correct
11 Correct 871 ms 5168 KB Output is correct
12 Correct 986 ms 4872 KB Output is correct
13 Correct 283 ms 4624 KB Output is correct
14 Correct 201 ms 3672 KB Output is correct
15 Correct 273 ms 3424 KB Output is correct
16 Correct 274 ms 3444 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 19 ms 4268 KB Output is correct
11 Correct 24 ms 4968 KB Output is correct
12 Correct 31 ms 5616 KB Output is correct
13 Correct 36 ms 5736 KB Output is correct
14 Correct 29 ms 5204 KB Output is correct
15 Correct 21 ms 3400 KB Output is correct
16 Correct 20 ms 3412 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 19 ms 4268 KB Output is correct
11 Correct 24 ms 4968 KB Output is correct
12 Correct 31 ms 5616 KB Output is correct
13 Correct 36 ms 5736 KB Output is correct
14 Correct 29 ms 5204 KB Output is correct
15 Correct 21 ms 3400 KB Output is correct
16 Correct 20 ms 3412 KB Output is correct
17 Correct 204 ms 5024 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 5 ms 452 KB Output is correct
24 Correct 5 ms 480 KB Output is correct
25 Correct 8 ms 504 KB Output is correct
26 Correct 7 ms 468 KB Output is correct
27 Correct 228 ms 4296 KB Output is correct
28 Correct 240 ms 5788 KB Output is correct
29 Correct 236 ms 5908 KB Output is correct
30 Correct 235 ms 5216 KB Output is correct

Subtask #5
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 757 ms 4552 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 772 ms 4492 KB Output is correct
9 Correct 755 ms 4348 KB Output is correct
10 Correct 765 ms 3588 KB Output is correct
11 Correct 912 ms 5176 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 23 ms 500 KB Output is correct
18 Correct 27 ms 524 KB Output is correct
19 Correct 1059 ms 4352 KB Output is correct
20 Correct 1079 ms 5888 KB Output is correct
21 Correct 871 ms 5168 KB Output is correct
22 Correct 986 ms 4872 KB Output is correct
23 Correct 283 ms 4624 KB Output is correct
24 Correct 201 ms 3672 KB Output is correct
25 Correct 273 ms 3424 KB Output is correct
26 Correct 274 ms 3444 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 0 ms 340 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 19 ms 4268 KB Output is correct
37 Correct 24 ms 4968 KB Output is correct
38 Correct 31 ms 5616 KB Output is correct
39 Correct 36 ms 5736 KB Output is correct
40 Correct 29 ms 5204 KB Output is correct
41 Correct 21 ms 3400 KB Output is correct
42 Correct 20 ms 3412 KB Output is correct
43 Correct 204 ms 5024 KB Output is correct
44 Correct 0 ms 340 KB Output is correct
45 Correct 0 ms 340 KB Output is correct
46 Correct 0 ms 340 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 0 ms 340 KB Output is correct
49 Correct 5 ms 452 KB Output is correct
50 Correct 5 ms 480 KB Output is correct
51 Correct 8 ms 504 KB Output is correct
52 Correct 7 ms 468 KB Output is correct
53 Correct 228 ms 4296 KB Output is correct
54 Correct 240 ms 5788 KB Output is correct
55 Correct 236 ms 5908 KB Output is correct
56 Correct 235 ms 5216 KB Output is correct
57 Correct 907 ms 6940 KB Output is correct
58 Correct 746 ms 4388 KB Output is correct
59 Correct 638 ms 5324 KB Output is correct