oj.uz

Submission #388489

# Submission time Handle Problem Language Result Execution time Memory
388489 2021-04-11T17:26:03 Z Return_0 Toll (BOI17_toll) C++17
100 / 100
 484 ms 51100 KB 
#pragma GCC optimize("Ofast,unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef int ll;
typedef long double ld;
typedef pair <ll, ll> pll;

#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
	const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush();
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< (x) << endl, 0
#define cl const ll
#define fr first
#define sc second
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()

cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353;

template <class A,class B> ostream& operator << (ostream& out,const pair<A,B>&a){return out<<'('<<a.first<<", "<<a.second<<')';}
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
	out<< '['; for (int i = -1; ++i < int(a.size());) out<< a[i] << (i + 1 < int(a.size()) ? ", " : ""); return out<<']'; }
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;

cl N = 5e4 + 3, K = 5, SQ = 230;

ll dis [N][SQ], dist [2][K], t, pos [N], k, n, m, q, ans;
vector <ll> lev [N], vec;
vector <array <ll, 2>> adj [N];

void build (ll L, ll en) {
	ll x = en / k;
	memset(dist[t], 63, sizeof dist[t]);
	dist[t][en % k] = 0;
	for (t ^= 1, x--; L <= x; x--, t ^= 1) {
		memset(dist[t], 63, sizeof dist[t]);
		for (auto &v : lev[x]) for (auto &u : adj[v]) dist[t][v % k] = min(dist[t][v % k], dist[1 - t][u[0] % k] + u[1]);
	}
	t ^= 1;
}

int main ()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

	memset(dis, 63, sizeof dis);
	memset(pos, -1, sizeof pos);

	cin>> k >> n >> m >> q;

	for (ll i = 0; i < n; i++) {
		lev[i / k].push_back(i);
		if (!((i / k) % SQ)) pos[i] = SZ(vec), vec.push_back(i);
	}

	for (ll i = 0, v, u, w; i < m; i++) {
		cin>> v >> u >> w;
		adj[v].push_back({u, w});
	}

	for (ll r = (n - 1) / k; ~r; r--) for (auto v : lev[r]) {
		if (~pos[v]) dis[v][pos[v]] = 0;
		for (auto &u : adj[v]) for (ll i = 0; i < SZ(vec); i++) dis[v][i] = min(dis[v][i], dis[u[0]][i] + u[1]);
	}

	for (ll v, u, x; q--;) {
		cin>> v >> u;
		if ((v / k) >= (u / k)) { cout<< -1 << '\n'; continue; }
		x = ((u / k) / SQ) * SQ;
		if (x < (v / k)) {
			build(v / k, u);
			if (dist[t][v % k] >= inf) cout<< -1 << '\n';
			else cout<< dist[t][v % k] << '\n';
		} else {
			ans = inf;
			build(x, u);
			for (auto &p : lev[x]) ans = min(ans, dis[v][pos[p]] + dist[t][p % k]);
			if (ans >= inf) ans = -1;
			cout<< ans << '\n';
		}
	}

	cerr<< "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";

	return 0;
}
/*
5 14 5 5
0 5 9
5 12 10
0 7 7
7 12 8
4 7 10
0 12
0 5
0 7
7 12
0 13

*/

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 51044 KB Output is correct
2 Correct 21 ms 47772 KB Output is correct
3 Correct 20 ms 47760 KB Output is correct
4 Correct 22 ms 47832 KB Output is correct
5 Correct 23 ms 47920 KB Output is correct
6 Correct 22 ms 47820 KB Output is correct
7 Correct 22 ms 47828 KB Output is correct
8 Correct 115 ms 51012 KB Output is correct
9 Correct 106 ms 50880 KB Output is correct
10 Correct 40 ms 49476 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 184 ms 50228 KB Output is correct
2 Correct 21 ms 47820 KB Output is correct
3 Correct 20 ms 47804 KB Output is correct
4 Correct 23 ms 47804 KB Output is correct
5 Correct 20 ms 47820 KB Output is correct
6 Correct 20 ms 47812 KB Output is correct
7 Correct 41 ms 47940 KB Output is correct
8 Correct 78 ms 47904 KB Output is correct
9 Correct 117 ms 51012 KB Output is correct
10 Correct 301 ms 50904 KB Output is correct
11 Correct 192 ms 50244 KB Output is correct
12 Correct 183 ms 49960 KB Output is correct
13 Correct 252 ms 50884 KB Output is correct
14 Correct 130 ms 49780 KB Output is correct
15 Correct 140 ms 49684 KB Output is correct
16 Correct 138 ms 49472 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 47780 KB Output is correct
2 Correct 20 ms 47788 KB Output is correct
3 Correct 24 ms 47848 KB Output is correct
4 Correct 20 ms 47820 KB Output is correct
5 Correct 20 ms 47756 KB Output is correct
6 Correct 21 ms 47932 KB Output is correct
7 Correct 22 ms 47820 KB Output is correct
8 Correct 24 ms 47856 KB Output is correct
9 Correct 23 ms 47848 KB Output is correct
10 Correct 83 ms 50992 KB Output is correct
11 Correct 104 ms 50172 KB Output is correct
12 Correct 138 ms 50860 KB Output is correct
13 Correct 158 ms 51100 KB Output is correct
14 Correct 122 ms 50448 KB Output is correct
15 Correct 72 ms 49348 KB Output is correct
16 Correct 73 ms 49448 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 47780 KB Output is correct
2 Correct 20 ms 47788 KB Output is correct
3 Correct 24 ms 47848 KB Output is correct
4 Correct 20 ms 47820 KB Output is correct
5 Correct 20 ms 47756 KB Output is correct
6 Correct 21 ms 47932 KB Output is correct
7 Correct 22 ms 47820 KB Output is correct
8 Correct 24 ms 47856 KB Output is correct
9 Correct 23 ms 47848 KB Output is correct
10 Correct 83 ms 50992 KB Output is correct
11 Correct 104 ms 50172 KB Output is correct
12 Correct 138 ms 50860 KB Output is correct
13 Correct 158 ms 51100 KB Output is correct
14 Correct 122 ms 50448 KB Output is correct
15 Correct 72 ms 49348 KB Output is correct
16 Correct 73 ms 49448 KB Output is correct
17 Correct 126 ms 50192 KB Output is correct
18 Correct 20 ms 47864 KB Output is correct
19 Correct 21 ms 47796 KB Output is correct
20 Correct 21 ms 47772 KB Output is correct
21 Correct 21 ms 47880 KB Output is correct
22 Correct 21 ms 47876 KB Output is correct
23 Correct 26 ms 47920 KB Output is correct
24 Correct 37 ms 47928 KB Output is correct
25 Correct 74 ms 47944 KB Output is correct
26 Correct 58 ms 47948 KB Output is correct
27 Correct 88 ms 50988 KB Output is correct
28 Correct 195 ms 50944 KB Output is correct
29 Correct 243 ms 51052 KB Output is correct
30 Correct 160 ms 50480 KB Output is correct

Subtask #5
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 118 ms 51044 KB Output is correct
2 Correct 21 ms 47772 KB Output is correct
3 Correct 20 ms 47760 KB Output is correct
4 Correct 22 ms 47832 KB Output is correct
5 Correct 23 ms 47920 KB Output is correct
6 Correct 22 ms 47820 KB Output is correct
7 Correct 22 ms 47828 KB Output is correct
8 Correct 115 ms 51012 KB Output is correct
9 Correct 106 ms 50880 KB Output is correct
10 Correct 40 ms 49476 KB Output is correct
11 Correct 184 ms 50228 KB Output is correct
12 Correct 21 ms 47820 KB Output is correct
13 Correct 20 ms 47804 KB Output is correct
14 Correct 23 ms 47804 KB Output is correct
15 Correct 20 ms 47820 KB Output is correct
16 Correct 20 ms 47812 KB Output is correct
17 Correct 41 ms 47940 KB Output is correct
18 Correct 78 ms 47904 KB Output is correct
19 Correct 117 ms 51012 KB Output is correct
20 Correct 301 ms 50904 KB Output is correct
21 Correct 192 ms 50244 KB Output is correct
22 Correct 183 ms 49960 KB Output is correct
23 Correct 252 ms 50884 KB Output is correct
24 Correct 130 ms 49780 KB Output is correct
25 Correct 140 ms 49684 KB Output is correct
26 Correct 138 ms 49472 KB Output is correct
27 Correct 20 ms 47780 KB Output is correct
28 Correct 20 ms 47788 KB Output is correct
29 Correct 24 ms 47848 KB Output is correct
30 Correct 20 ms 47820 KB Output is correct
31 Correct 20 ms 47756 KB Output is correct
32 Correct 21 ms 47932 KB Output is correct
33 Correct 22 ms 47820 KB Output is correct
34 Correct 24 ms 47856 KB Output is correct
35 Correct 23 ms 47848 KB Output is correct
36 Correct 83 ms 50992 KB Output is correct
37 Correct 104 ms 50172 KB Output is correct
38 Correct 138 ms 50860 KB Output is correct
39 Correct 158 ms 51100 KB Output is correct
40 Correct 122 ms 50448 KB Output is correct
41 Correct 72 ms 49348 KB Output is correct
42 Correct 73 ms 49448 KB Output is correct
43 Correct 126 ms 50192 KB Output is correct
44 Correct 20 ms 47864 KB Output is correct
45 Correct 21 ms 47796 KB Output is correct
46 Correct 21 ms 47772 KB Output is correct
47 Correct 21 ms 47880 KB Output is correct
48 Correct 21 ms 47876 KB Output is correct
49 Correct 26 ms 47920 KB Output is correct
50 Correct 37 ms 47928 KB Output is correct
51 Correct 74 ms 47944 KB Output is correct
52 Correct 58 ms 47948 KB Output is correct
53 Correct 88 ms 50988 KB Output is correct
54 Correct 195 ms 50944 KB Output is correct
55 Correct 243 ms 51052 KB Output is correct
56 Correct 160 ms 50480 KB Output is correct
57 Correct 484 ms 51036 KB Output is correct
58 Correct 109 ms 51020 KB Output is correct
59 Correct 195 ms 50204 KB Output is correct