oj.uz

Submission #767665

# Submission time Handle Problem Language Result Execution time Memory
767665 2023-06-27T03:00:34 Z qwerasdfzxcl Wild Boar (JOI18_wild_boar) C++17
100 / 100
 3652 ms 231008 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
constexpr ll INF = 4e18;

vector<pair<int, int>> adj0[6060];
pair<int, int> Edge[2020];
ll dist0[4040][4040], res0[4040];
int visited0[6060], F[2020];
ll (*dist)[4040];

vector<int> in[2020], out[2020];
int X[100100];
ll dp[100100][4];

struct Node{
	ll W[4][4];
	int S[4], E[4];

	Node(){}

	ll ans(){
		ll ret = INF;
		for (int i=0;i<4;i++){
			for (int j=0;j<4;j++){
				ret = min(ret, W[i][j]);
			}
		}

		return ret==INF?-1:ret;
	}

	Node operator + (const Node &N) const{
		Node ret;
        memset(ret.W[0], 0x3f, sizeof(ll) * 16);
        
        for (int k1=0;k1<4;k1++){
            for (int j=0;j<4;j++){
                ll mn = INF;
                for (int k2=0;k2<4;k2++) if (abs(E[k1])!=abs(N.S[k2])) mn = min(mn, N.W[k2][j]);
                for (int i=0;i<4;i++) ret.W[i][j] = min(ret.W[i][j], W[i][k1] + mn);
            }
            ret.S[k1] = S[k1];
            ret.E[k1] = N.E[k1];
        }
        
		return ret;
	}
};

Node initW(int p);

struct Seg{
	Node tree[400400];
	void init(int i, int l, int r){
		if (l==r){
			tree[i] = initW(l);
			return;
		} 
		
		int m = (l+r)>>1;
		init(i<<1, l, m); init(i<<1|1, m+1, r);
		tree[i] = tree[i<<1] + tree[i<<1|1];
	}

	void update(int i, int l, int r, int p){
		if (r<p || p<l) return;
		if (l==r){
			tree[i] = initW(l);
			return;
		}

		int m = (l+r)>>1;
		update(i<<1, l, m, p); update(i<<1|1, m+1, r, p);
		tree[i] = tree[i<<1] + tree[i<<1|1];
	}

}tree;

void dijkstra(int m, int s, ll (*dist)[4040], ll *res, vector<pair<int, int>> *adj){
	int *visited = visited0 + 2020;
	fill(res-2020, res+2020, INF);
	fill(visited-2020, visited+4040, -1);

	priority_queue<array<ll, 3>, vector<array<ll, 3>>, greater<array<ll, 3>>> pq;
	vector<array<ll, 3>> st;

	res[s] = F[abs(s)];
	pq.push({F[abs(s)], s, 0});

	while(!pq.empty() || !st.empty()){
		array<ll, 3> tmp;
		if (!st.empty()) {tmp = st.back(); st.pop_back();}
		else {tmp = pq.top(); pq.pop();}

		auto [dist, cur, p] = tmp;
		
		if (visited[cur]==-2) continue;
		if (visited[cur]==-1){
			if (cur <= m){
				// printf(" dist[%lld] = %lld\n", cur, res[cur]);
				visited[cur] = -2;
				for (auto &[v, w]:adj[cur]) if (visited[v]!=-2){
					st.push_back({dist, v, cur});
				}
			}

			else{
				visited[cur] = abs(p);
				for (auto &[v, w]:adj[cur]) if (visited[v]!=-2 && abs(v)!=abs(p)){
					res[v] = dist + w;
					pq.push({res[v], v, cur});
				}
			}
		}

		else{
			for (auto &[v, w]:adj[cur]) if (abs(v)==visited[cur] && visited[v]!=-2){
				res[v] = dist + w;
				pq.push({res[v], v, cur});
			}

			visited[cur] = -2;
		}
	}


}

map<int, Node> mp[2020];
Node initW(int p){
	vector<ll> W;
	vector<int> S, E;
	if (mp[X[p]].find(X[p+1])!=mp[X[p]].end()){
		return mp[X[p]][X[p+1]];
	}

	W.push_back(INF);
	S.push_back(-1);
	E.push_back(-1);

	for (auto &s1:out[X[p]]){
		for (auto &e1:in[X[p+1]]){
			if (W.back() > dist[s1][e1]){
				W.back() = dist[s1][e1];
				S.back() = s1;
				E.back() = e1;
			}
		}
	}

	W.push_back(INF);
	S.push_back(-1);
	E.push_back(-1);

	for (auto &s2:out[X[p]]) if (s2!=S[0]){
		for (auto &e2:in[X[p+1]]) if (e2!=E[0]){
			if (W.back() > dist[s2][e2]){
				W.back() = dist[s2][e2];
				S.back() = s2;
				E.back() = e2;
			}
		}
	}

	W.push_back(INF);
	S.push_back(-1);
	E.push_back(-1);

	for (auto &s3:out[X[p]]) if (s3!=S[0]){
		for (auto &e3:in[X[p+1]]) if (e3!=E[1]){
			if (W.back() > dist[s3][e3]){
				W.back() = dist[s3][e3];
				S.back() = s3;
				E.back() = e3;
			}
		}
	}

	W.push_back(INF);
	S.push_back(-1);
	E.push_back(-1);

	for (auto &s4:out[X[p]]) if (s4!=S[1]){
		for (auto &e4:in[X[p+1]]) if (e4!=E[0]){
			if (W.back() > dist[s4][e4]){
				W.back() = dist[s4][e4];
				S.back() = s4;
				E.back() = e4;
			}
		}
	}

	Node ret;
	for (int i=0;i<4;i++){
		for (int j=0;j<4;j++){
			if (i!=j) ret.W[i][j] = INF;
			else ret.W[i][j] = W[i];
		}

		ret.S[i] = S[i];
		ret.E[i] = E[i];
	}
	mp[X[p]][X[p+1]] = ret;
	return ret;
}

int main(){
	int n, m, q, l;
	scanf("%d %d %d %d", &n, &m, &q, &l);

	vector<pair<int, int>> *adj = adj0 + m;
	for (int i=1;i<=m;i++){
		int x, y, z;
		scanf("%d %d %d", &x, &y, &z);
		Edge[i] = {x, y}; F[i] = z;

		adj[i].emplace_back(y+m, 0);
		adj[-i].emplace_back(x+m, 0);

		adj[x+m].emplace_back(i, z);
		adj[y+m].emplace_back(-i, z);

		out[x].push_back(i);
		out[y].push_back(-i);

		in[x].push_back(-i);
		in[y].push_back(i);
	}

	dist = (ll (*)[4040])(&(dist0[2020][2020]));
	ll *res = res0 + 2020;

	for (int i=1;i<=m;i++){
		dijkstra(m, i, dist, res, adj);
		for (int j=-m;j<=m;j++) dist[i][j] = res[j];
		
		dijkstra(m, -i, dist, res, adj);
		for (int j=-m;j<=m;j++) dist[-i][j] = res[j];
	}

	for (int i=1;i<=l;i++) scanf("%d", X+i);

	tree.init(1, 1, l-1);
	while(q--){
		int pp, qq;
		scanf("%d %d", &pp, &qq);
		X[pp] = qq;
		if (pp > 1) tree.update(1, 1, l-1, pp-1);
		if (pp < l) tree.update(1, 1, l-1, pp);

		printf("%lld\n", tree.tree[1].ans());
	}
}

Compilation message

wild_boar.cpp: In function 'int main()':
wild_boar.cpp:211:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  211 |  scanf("%d %d %d %d", &n, &m, &q, &l);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
wild_boar.cpp:216:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  216 |   scanf("%d %d %d", &x, &y, &z);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
wild_boar.cpp:243:30: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  243 |  for (int i=1;i<=l;i++) scanf("%d", X+i);
      |                         ~~~~~^~~~~~~~~~~
wild_boar.cpp:248:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  248 |   scanf("%d %d", &pp, &qq);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 1 ms 780 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 1 ms 776 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 1 ms 724 KB Output is correct
11 Correct 1 ms 776 KB Output is correct
12 Correct 1 ms 724 KB Output is correct
13 Correct 1 ms 724 KB Output is correct
14 Correct 1 ms 724 KB Output is correct
15 Correct 1 ms 724 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 1 ms 776 KB Output is correct
18 Correct 1 ms 724 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 1 ms 724 KB Output is correct
21 Correct 1 ms 728 KB Output is correct
22 Correct 1 ms 724 KB Output is correct
23 Correct 1 ms 776 KB Output is correct
24 Correct 1 ms 724 KB Output is correct
25 Correct 1 ms 724 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 1 ms 780 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 1 ms 776 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 1 ms 724 KB Output is correct
11 Correct 1 ms 776 KB Output is correct
12 Correct 1 ms 724 KB Output is correct
13 Correct 1 ms 724 KB Output is correct
14 Correct 1 ms 724 KB Output is correct
15 Correct 1 ms 724 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 1 ms 776 KB Output is correct
18 Correct 1 ms 724 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 1 ms 724 KB Output is correct
21 Correct 1 ms 728 KB Output is correct
22 Correct 1 ms 724 KB Output is correct
23 Correct 1 ms 776 KB Output is correct
24 Correct 1 ms 724 KB Output is correct
25 Correct 1 ms 724 KB Output is correct
26 Correct 2 ms 1108 KB Output is correct
27 Correct 55 ms 45512 KB Output is correct
28 Correct 56 ms 45496 KB Output is correct
29 Correct 107 ms 49680 KB Output is correct
30 Correct 85 ms 47568 KB Output is correct
31 Correct 80 ms 47616 KB Output is correct
32 Correct 87 ms 47648 KB Output is correct
33 Correct 123 ms 52180 KB Output is correct
34 Correct 121 ms 52140 KB Output is correct
35 Correct 77 ms 47548 KB Output is correct
36 Correct 80 ms 47564 KB Output is correct
37 Correct 124 ms 52208 KB Output is correct
38 Correct 133 ms 55140 KB Output is correct
39 Correct 77 ms 47608 KB Output is correct
40 Correct 131 ms 55216 KB Output is correct
41 Correct 155 ms 55172 KB Output is correct
42 Correct 76 ms 47556 KB Output is correct
43 Correct 137 ms 57912 KB Output is correct
44 Correct 141 ms 57904 KB Output is correct
45 Correct 133 ms 60048 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 1 ms 780 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 1 ms 776 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 1 ms 724 KB Output is correct
11 Correct 1 ms 776 KB Output is correct
12 Correct 1 ms 724 KB Output is correct
13 Correct 1 ms 724 KB Output is correct
14 Correct 1 ms 724 KB Output is correct
15 Correct 1 ms 724 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 1 ms 776 KB Output is correct
18 Correct 1 ms 724 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 1 ms 724 KB Output is correct
21 Correct 1 ms 728 KB Output is correct
22 Correct 1 ms 724 KB Output is correct
23 Correct 1 ms 776 KB Output is correct
24 Correct 1 ms 724 KB Output is correct
25 Correct 1 ms 724 KB Output is correct
26 Correct 2 ms 1108 KB Output is correct
27 Correct 55 ms 45512 KB Output is correct
28 Correct 56 ms 45496 KB Output is correct
29 Correct 107 ms 49680 KB Output is correct
30 Correct 85 ms 47568 KB Output is correct
31 Correct 80 ms 47616 KB Output is correct
32 Correct 87 ms 47648 KB Output is correct
33 Correct 123 ms 52180 KB Output is correct
34 Correct 121 ms 52140 KB Output is correct
35 Correct 77 ms 47548 KB Output is correct
36 Correct 80 ms 47564 KB Output is correct
37 Correct 124 ms 52208 KB Output is correct
38 Correct 133 ms 55140 KB Output is correct
39 Correct 77 ms 47608 KB Output is correct
40 Correct 131 ms 55216 KB Output is correct
41 Correct 155 ms 55172 KB Output is correct
42 Correct 76 ms 47556 KB Output is correct
43 Correct 137 ms 57912 KB Output is correct
44 Correct 141 ms 57904 KB Output is correct
45 Correct 133 ms 60048 KB Output is correct
46 Correct 136 ms 12744 KB Output is correct
47 Correct 2333 ms 169248 KB Output is correct
48 Correct 2295 ms 169284 KB Output is correct
49 Correct 2320 ms 169096 KB Output is correct
50 Correct 2335 ms 169096 KB Output is correct
51 Correct 2315 ms 169212 KB Output is correct
52 Correct 2526 ms 188664 KB Output is correct
53 Correct 2468 ms 188628 KB Output is correct
54 Correct 2475 ms 188632 KB Output is correct
55 Correct 2452 ms 188624 KB Output is correct
56 Correct 2447 ms 188748 KB Output is correct
57 Correct 2443 ms 189080 KB Output is correct
58 Correct 2460 ms 189040 KB Output is correct
59 Correct 2420 ms 189192 KB Output is correct
60 Correct 2347 ms 189308 KB Output is correct
61 Correct 2336 ms 189308 KB Output is correct
62 Correct 2212 ms 189320 KB Output is correct
63 Correct 2260 ms 189428 KB Output is correct
64 Correct 711 ms 189600 KB Output is correct
65 Correct 713 ms 189580 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 768 KB Output is correct
2 Correct 1 ms 780 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 1 ms 776 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 724 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 1 ms 724 KB Output is correct
11 Correct 1 ms 776 KB Output is correct
12 Correct 1 ms 724 KB Output is correct
13 Correct 1 ms 724 KB Output is correct
14 Correct 1 ms 724 KB Output is correct
15 Correct 1 ms 724 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 1 ms 776 KB Output is correct
18 Correct 1 ms 724 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 1 ms 724 KB Output is correct
21 Correct 1 ms 728 KB Output is correct
22 Correct 1 ms 724 KB Output is correct
23 Correct 1 ms 776 KB Output is correct
24 Correct 1 ms 724 KB Output is correct
25 Correct 1 ms 724 KB Output is correct
26 Correct 2 ms 1108 KB Output is correct
27 Correct 55 ms 45512 KB Output is correct
28 Correct 56 ms 45496 KB Output is correct
29 Correct 107 ms 49680 KB Output is correct
30 Correct 85 ms 47568 KB Output is correct
31 Correct 80 ms 47616 KB Output is correct
32 Correct 87 ms 47648 KB Output is correct
33 Correct 123 ms 52180 KB Output is correct
34 Correct 121 ms 52140 KB Output is correct
35 Correct 77 ms 47548 KB Output is correct
36 Correct 80 ms 47564 KB Output is correct
37 Correct 124 ms 52208 KB Output is correct
38 Correct 133 ms 55140 KB Output is correct
39 Correct 77 ms 47608 KB Output is correct
40 Correct 131 ms 55216 KB Output is correct
41 Correct 155 ms 55172 KB Output is correct
42 Correct 76 ms 47556 KB Output is correct
43 Correct 137 ms 57912 KB Output is correct
44 Correct 141 ms 57904 KB Output is correct
45 Correct 133 ms 60048 KB Output is correct
46 Correct 136 ms 12744 KB Output is correct
47 Correct 2333 ms 169248 KB Output is correct
48 Correct 2295 ms 169284 KB Output is correct
49 Correct 2320 ms 169096 KB Output is correct
50 Correct 2335 ms 169096 KB Output is correct
51 Correct 2315 ms 169212 KB Output is correct
52 Correct 2526 ms 188664 KB Output is correct
53 Correct 2468 ms 188628 KB Output is correct
54 Correct 2475 ms 188632 KB Output is correct
55 Correct 2452 ms 188624 KB Output is correct
56 Correct 2447 ms 188748 KB Output is correct
57 Correct 2443 ms 189080 KB Output is correct
58 Correct 2460 ms 189040 KB Output is correct
59 Correct 2420 ms 189192 KB Output is correct
60 Correct 2347 ms 189308 KB Output is correct
61 Correct 2336 ms 189308 KB Output is correct
62 Correct 2212 ms 189320 KB Output is correct
63 Correct 2260 ms 189428 KB Output is correct
64 Correct 711 ms 189600 KB Output is correct
65 Correct 713 ms 189580 KB Output is correct
66 Correct 47 ms 42748 KB Output is correct
67 Correct 602 ms 77708 KB Output is correct
68 Correct 510 ms 127564 KB Output is correct
69 Correct 994 ms 168024 KB Output is correct
70 Correct 1681 ms 229588 KB Output is correct
71 Correct 3030 ms 171300 KB Output is correct
72 Correct 2955 ms 171404 KB Output is correct
73 Correct 3562 ms 224620 KB Output is correct
74 Correct 3652 ms 224640 KB Output is correct
75 Correct 3643 ms 224540 KB Output is correct
76 Correct 3011 ms 171384 KB Output is correct
77 Correct 2917 ms 171488 KB Output is correct
78 Correct 2905 ms 171368 KB Output is correct
79 Correct 3559 ms 226912 KB Output is correct
80 Correct 3527 ms 227812 KB Output is correct
81 Correct 2900 ms 171448 KB Output is correct
82 Correct 3434 ms 228996 KB Output is correct
83 Correct 2784 ms 171400 KB Output is correct
84 Correct 3156 ms 230308 KB Output is correct
85 Correct 1672 ms 231008 KB Output is correct