oj.uz

Submission #197150

# Submission time Handle Problem Language Result Execution time Memory
197150 2020-01-19T09:53:29 Z arnold518 Toll (BOI17_toll) C++14
100 / 100
 342 ms 69244 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 5e5;
const ll INF = 1e15;

int K, N, M, Q;
vector<pii> adj[MAXN+10];

struct Node
{
	vector<vector<ll>> V;
	Node() { V=vector<vector<ll>>(K, vector<ll>(K, INF)); }
};
Node Z;

Node operator + (const Node &p, const Node &q)
{
	Node ret=Node();
	int i, j, k;
	for(i=0; i<K; i++)
	{
		for(j=0; j<K; j++)
		{
			ll val=INF;
			for(k=0; k<K; k++) val=min(val, p.V[i][k]+q.V[k][j]);
			ret.V[i][j]=val;
		}
	}
	return ret;
}

Node tree[MAXN*4+10];

void init(int node, int tl, int tr)
{
	if(tl==tr)
	{
		int i, j;
		tree[node]=Node();
		for(i=(tl-1)*K; i<tl*K; i++) for(auto nxt : adj[i]) tree[node].V[i%K][nxt.first%K]=nxt.second;
		return;
	}
	int mid=tl+tr>>1;
	init(node*2, tl, mid);
	init(node*2+1, mid+1, tr);
	tree[node]=tree[node*2]+tree[node*2+1];
}

Node query(int node, int tl, int tr, int l, int r)
{
	if(l<=tl && tr<=r) return tree[node];
	if(tr<l || r<tl) return Z;
	int mid=tl+tr>>1;
	return query(node*2, tl, mid, l, r)+query(node*2+1, mid+1, tr, l, r);
}

int main()
{
	int i, j, k;
	scanf("%d%d%d%d", &K, &N, &M, &Q);
	if(N%K) N=N/K*K+K;

	Z=Node();
	for(i=0; i<K; i++) Z.V[i][i]=0;

	for(i=1; i<=M; i++)
	{
		int u, v, w;
		scanf("%d%d%d", &u, &v, &w);
		adj[u].push_back({v, w});
	}
	
	init(1, 1, N/K-1);
	while(Q--)
	{
		int a, b;
		scanf("%d%d", &a, &b);

		if(a/K==b/K) { printf("-1\n"); continue; }

		Node t=query(1, 1, N/K-1, a/K+1, b/K);
		ll ans=t.V[a%K][b%K];
		if(ans>=INF) ans=-1;
		printf("%lld\n", ans);
	}
}

Compilation message

toll.cpp: In function 'void init(int, int, int)':
toll.cpp:43:10: warning: unused variable 'j' [-Wunused-variable]
   int i, j;
          ^
toll.cpp:48:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=tl+tr>>1;
          ~~^~~
toll.cpp: In function 'Node query(int, int, int, int, int)':
toll.cpp:58:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=tl+tr>>1;
          ~~^~~
toll.cpp: In function 'int main()':
toll.cpp:64:9: warning: unused variable 'j' [-Wunused-variable]
  int i, j, k;
         ^
toll.cpp:64:12: warning: unused variable 'k' [-Wunused-variable]
  int i, j, k;
            ^
toll.cpp:65:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d%d", &K, &N, &M, &Q);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
toll.cpp:74:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &u, &v, &w);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~
toll.cpp:82:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &a, &b);
   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 191 ms 66936 KB Output is correct
2 Correct 62 ms 59000 KB Output is correct
3 Correct 63 ms 59000 KB Output is correct
4 Correct 62 ms 59000 KB Output is correct
5 Correct 68 ms 59256 KB Output is correct
6 Correct 66 ms 59128 KB Output is correct
7 Correct 67 ms 59256 KB Output is correct
8 Correct 191 ms 66928 KB Output is correct
9 Correct 193 ms 66936 KB Output is correct
10 Correct 159 ms 65316 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 195 ms 66916 KB Output is correct
2 Correct 75 ms 59000 KB Output is correct
3 Correct 65 ms 59048 KB Output is correct
4 Correct 67 ms 59060 KB Output is correct
5 Correct 73 ms 58972 KB Output is correct
6 Correct 63 ms 59004 KB Output is correct
7 Correct 87 ms 59288 KB Output is correct
8 Correct 93 ms 59228 KB Output is correct
9 Correct 159 ms 66892 KB Output is correct
10 Correct 224 ms 67192 KB Output is correct
11 Correct 193 ms 66936 KB Output is correct
12 Correct 186 ms 66292 KB Output is correct
13 Correct 186 ms 66000 KB Output is correct
14 Correct 140 ms 63972 KB Output is correct
15 Correct 141 ms 64632 KB Output is correct
16 Correct 142 ms 64632 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 59096 KB Output is correct
2 Correct 63 ms 59000 KB Output is correct
3 Correct 63 ms 59000 KB Output is correct
4 Correct 63 ms 59060 KB Output is correct
5 Correct 64 ms 59064 KB Output is correct
6 Correct 66 ms 59256 KB Output is correct
7 Correct 64 ms 59256 KB Output is correct
8 Correct 66 ms 59384 KB Output is correct
9 Correct 66 ms 59176 KB Output is correct
10 Correct 118 ms 66808 KB Output is correct
11 Correct 137 ms 66936 KB Output is correct
12 Correct 157 ms 66980 KB Output is correct
13 Correct 166 ms 67268 KB Output is correct
14 Correct 147 ms 66668 KB Output is correct
15 Correct 118 ms 64608 KB Output is correct
16 Correct 117 ms 64632 KB Output is correct

Subtask #4
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 59096 KB Output is correct
2 Correct 63 ms 59000 KB Output is correct
3 Correct 63 ms 59000 KB Output is correct
4 Correct 63 ms 59060 KB Output is correct
5 Correct 64 ms 59064 KB Output is correct
6 Correct 66 ms 59256 KB Output is correct
7 Correct 64 ms 59256 KB Output is correct
8 Correct 66 ms 59384 KB Output is correct
9 Correct 66 ms 59176 KB Output is correct
10 Correct 118 ms 66808 KB Output is correct
11 Correct 137 ms 66936 KB Output is correct
12 Correct 157 ms 66980 KB Output is correct
13 Correct 166 ms 67268 KB Output is correct
14 Correct 147 ms 66668 KB Output is correct
15 Correct 118 ms 64608 KB Output is correct
16 Correct 117 ms 64632 KB Output is correct
17 Correct 166 ms 66948 KB Output is correct
18 Correct 63 ms 59000 KB Output is correct
19 Correct 72 ms 59000 KB Output is correct
20 Correct 63 ms 59128 KB Output is correct
21 Correct 63 ms 59120 KB Output is correct
22 Correct 62 ms 59024 KB Output is correct
23 Correct 75 ms 59128 KB Output is correct
24 Correct 78 ms 59256 KB Output is correct
25 Correct 96 ms 59208 KB Output is correct
26 Correct 86 ms 59384 KB Output is correct
27 Correct 143 ms 67064 KB Output is correct
28 Correct 196 ms 67064 KB Output is correct
29 Correct 206 ms 67296 KB Output is correct
30 Correct 181 ms 66780 KB Output is correct

Subtask #5
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 191 ms 66936 KB Output is correct
2 Correct 62 ms 59000 KB Output is correct
3 Correct 63 ms 59000 KB Output is correct
4 Correct 62 ms 59000 KB Output is correct
5 Correct 68 ms 59256 KB Output is correct
6 Correct 66 ms 59128 KB Output is correct
7 Correct 67 ms 59256 KB Output is correct
8 Correct 191 ms 66928 KB Output is correct
9 Correct 193 ms 66936 KB Output is correct
10 Correct 159 ms 65316 KB Output is correct
11 Correct 195 ms 66916 KB Output is correct
12 Correct 75 ms 59000 KB Output is correct
13 Correct 65 ms 59048 KB Output is correct
14 Correct 67 ms 59060 KB Output is correct
15 Correct 73 ms 58972 KB Output is correct
16 Correct 63 ms 59004 KB Output is correct
17 Correct 87 ms 59288 KB Output is correct
18 Correct 93 ms 59228 KB Output is correct
19 Correct 159 ms 66892 KB Output is correct
20 Correct 224 ms 67192 KB Output is correct
21 Correct 193 ms 66936 KB Output is correct
22 Correct 186 ms 66292 KB Output is correct
23 Correct 186 ms 66000 KB Output is correct
24 Correct 140 ms 63972 KB Output is correct
25 Correct 141 ms 64632 KB Output is correct
26 Correct 142 ms 64632 KB Output is correct
27 Correct 63 ms 59096 KB Output is correct
28 Correct 63 ms 59000 KB Output is correct
29 Correct 63 ms 59000 KB Output is correct
30 Correct 63 ms 59060 KB Output is correct
31 Correct 64 ms 59064 KB Output is correct
32 Correct 66 ms 59256 KB Output is correct
33 Correct 64 ms 59256 KB Output is correct
34 Correct 66 ms 59384 KB Output is correct
35 Correct 66 ms 59176 KB Output is correct
36 Correct 118 ms 66808 KB Output is correct
37 Correct 137 ms 66936 KB Output is correct
38 Correct 157 ms 66980 KB Output is correct
39 Correct 166 ms 67268 KB Output is correct
40 Correct 147 ms 66668 KB Output is correct
41 Correct 118 ms 64608 KB Output is correct
42 Correct 117 ms 64632 KB Output is correct
43 Correct 166 ms 66948 KB Output is correct
44 Correct 63 ms 59000 KB Output is correct
45 Correct 72 ms 59000 KB Output is correct
46 Correct 63 ms 59128 KB Output is correct
47 Correct 63 ms 59120 KB Output is correct
48 Correct 62 ms 59024 KB Output is correct
49 Correct 75 ms 59128 KB Output is correct
50 Correct 78 ms 59256 KB Output is correct
51 Correct 96 ms 59208 KB Output is correct
52 Correct 86 ms 59384 KB Output is correct
53 Correct 143 ms 67064 KB Output is correct
54 Correct 196 ms 67064 KB Output is correct
55 Correct 206 ms 67296 KB Output is correct
56 Correct 181 ms 66780 KB Output is correct
57 Correct 342 ms 69244 KB Output is correct
58 Correct 196 ms 66860 KB Output is correct
59 Correct 241 ms 66936 KB Output is correct