oj.uz

Submission #336738

# Submission time Handle Problem Language Result Execution time Memory
336738 2020-12-16T15:47:34 Z amoo_safar Wild Boar (JOI18_wild_boar) C++17
100 / 100
 5963 ms 472696 KB 
// vaziat meshki-ghermeze !
#include <bits/stdc++.h>

#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " : " << x << '\n'

using namespace std;

typedef long long ll;
typedef long double ld;
typedef string str;
typedef pair<ll, ll> pll;

const ll Mod = 1000000007LL;
const int N = 4e3 + 10;
const int K = 1e5 + 10;

const ll Inf = 2242545357980376863LL;
const ll Log = 30;

typedef pair<int, int> pii;

vector<int> G[N], I[N];
int fr[N], to[N], W[N], m = 0;

ll dis[N][N];
int deg[N];
void DJIK(int id){
	memset(dis[id], 31, sizeof dis[id]);
	memset(deg, 0, sizeof deg);
	set<pair<ll, int>> st;
	dis[id][id] = 0;
	
	st.insert({0, id});

	while(!st.empty()){
		int beg = st.begin() -> S; st.erase(st.begin());
		if(deg[to[beg]] >= 2) continue;
		deg[to[beg]] ++;

		for(auto nx : G[to[beg]]){
			if((nx ^ 1) == beg) continue;
			if(dis[id][nx] > dis[id][beg] + W[nx]){
				// cerr << "^^ " << id << ' ' << nx << '\n';
				st.erase({dis[id][nx], nx});
				dis[id][nx] = dis[id][beg] + W[nx];
				st.insert({dis[id][nx], nx});
			}
		}
	}
}

typedef pair<ll, pii> path;

struct node {
	path ans;
	path fa, best_a;
	path fb, best_b;
};
path Get(int u, int v, int fu, int fv){
	path res = {Inf, {-2, -2}};
	for(auto out_u : G[u]){
		if(out_u == fu) continue;
		for(auto in_v : I[v]){
			if(in_v == fv) continue;
			res = min(res, path(dis[out_u][in_v] + W[out_u], {out_u, in_v}));
		}
	}
	return res;
}

node base[N][N];

vector<path> lc, rc;
path Get(int fu, int fv){
	path res = {Inf, {-2, -2}};
	for(auto [ln_l, p_l] : lc){
		if(p_l.F == fu) continue;
		for(auto [ln_r, p_r] : rc){
			if(p_r.S == fv) continue;
			if((p_l.S ^ 1) == p_r.F) continue;
			res = min(res, path(ln_l + ln_r, {p_l.F, p_r.S}));
		}
	}
	return res;
}
node Merge(node& L, node& R){
	lc = {L.ans, L.fa, L.best_a, L.fb, L.best_b};
	rc = {R.ans, R.fa, R.best_a, R.fb, R.best_b};
	node res;
	res.ans = Get(-1, -1);
	// cerr << "!$#@$  " << res.ans.F << '\n';
	int a = res.ans.S.F;
	int b = res.ans.S.S;
	res.fa = Get(a, -1);
	res.best_a = Get(a, res.fa.S.S);

	res.fb = Get(-1, b);
	res.best_b = Get(res.fb.S.F, b);
	return res;
}

node seg[K << 2];

ll A[K];

void Build(int id, int L, int R){
	if(L + 1 == R){
		seg[id] = base[A[L]][A[L + 1]];
		return ;
	}
	int mid = (L + R) >> 1;
	Build(id << 1, L, mid);
	Build(id << 1 | 1, mid, R);
	seg[id] = Merge(seg[id << 1], seg[id << 1 | 1]);
}

void Change(int id, int idx, pii x, int L, int R){
	if(L + 1 == R){
		seg[id] = base[x.F][x.S];
		return ;
	}
	int mid = (L + R) >> 1;
	if(idx < mid){
		Change(id << 1, idx, x, L, mid);
	} else {
		Change(id << 1 | 1, idx, x, mid, R);
	}
	seg[id] = Merge(seg[id << 1], seg[id << 1 | 1]);
}

int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int n, _m, T, L;
	cin >> n >> _m >> T >> L;

	for(int i = 0; i < _m; i++){
		int u, v, w;
		cin >> u >> v >> w;
		fr[m] = u, to[m] = v, W[m] = w; G[u].pb(m); I[v].pb(m); m ++;
		fr[m] = v, to[m] = u, W[m] = w; G[v].pb(m); I[u].pb(m); m ++;
	}
	for(int i = 0; i < m; i++) DJIK(i);
	// debug(dis[0][2]);
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= n; j++){
			if(i == j) continue;
			base[i][j].ans = Get(i, j, -1, -1);
			// cerr << "! " << i << " " << j << " -> " << base[i][j].ans.F << '\n';
			int a = base[i][j].ans.S.F;
			int b = base[i][j].ans.S.S;
			base[i][j].fa = Get(i, j, a, -1);
			// cerr << "!!! " << i << " " << j << " -> " << base[i][j].fa.F << '\n';
			
			base[i][j].best_a = Get(i, j, a, base[i][j].fa.S.S);
			
			base[i][j].fb = Get(i, j, -1, b);
			base[i][j].best_b = Get(i, j, base[i][j].fb.S.F, b);		
		}
	}
	for(int i = 1; i <= L; i++)
		cin >> A[i];
	Build(1, 1, L);
	// cerr << "ANS : " << seg[1].ans.F << '\n';

	for(int i = 1; i <= T; i++){
		int idx, nw;
		cin >> idx >> nw;
		A[idx] = nw;
		if(idx)
			Change(1, idx - 1, pii(A[idx - 1], A[idx]), 1, L);
		if(idx < L)
			Change(1, idx, pii(A[idx], A[idx + 1]), 1, L);
		cout << (seg[1].ans.F >= Inf/2 ? -1 : seg[1].ans.F) << '\n';
	}
	return 0;
}
/*
3 3 1 3
1 2 1
2 3 1
1 3 1
1
2
1
3 1

*/

Subtask #1
12.0 / 12.0

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

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 876 KB Output is correct
2 Correct 2 ms 1260 KB Output is correct
3 Correct 1 ms 1260 KB Output is correct
4 Correct 1 ms 1260 KB Output is correct
5 Correct 1 ms 1260 KB Output is correct
6 Correct 1 ms 1260 KB Output is correct
7 Correct 1 ms 1260 KB Output is correct
8 Correct 1 ms 1260 KB Output is correct
9 Correct 1 ms 1260 KB Output is correct
10 Correct 1 ms 1260 KB Output is correct
11 Correct 1 ms 1260 KB Output is correct
12 Correct 1 ms 1260 KB Output is correct
13 Correct 1 ms 1260 KB Output is correct
14 Correct 1 ms 1268 KB Output is correct
15 Correct 1 ms 1388 KB Output is correct
16 Correct 1 ms 1260 KB Output is correct
17 Correct 1 ms 1260 KB Output is correct
18 Correct 1 ms 1260 KB Output is correct
19 Correct 1 ms 1260 KB Output is correct
20 Correct 1 ms 1260 KB Output is correct
21 Correct 1 ms 1260 KB Output is correct
22 Correct 1 ms 1260 KB Output is correct
23 Correct 1 ms 1260 KB Output is correct
24 Correct 1 ms 1260 KB Output is correct
25 Correct 1 ms 1260 KB Output is correct
26 Correct 4 ms 3180 KB Output is correct
27 Correct 55 ms 29676 KB Output is correct
28 Correct 52 ms 29676 KB Output is correct
29 Correct 164 ms 42348 KB Output is correct
30 Correct 156 ms 42220 KB Output is correct
31 Correct 157 ms 42220 KB Output is correct
32 Correct 154 ms 42220 KB Output is correct
33 Correct 170 ms 43500 KB Output is correct
34 Correct 165 ms 43500 KB Output is correct
35 Correct 142 ms 43372 KB Output is correct
36 Correct 152 ms 43372 KB Output is correct
37 Correct 169 ms 43628 KB Output is correct
38 Correct 164 ms 45164 KB Output is correct
39 Correct 155 ms 45036 KB Output is correct
40 Correct 168 ms 45292 KB Output is correct
41 Correct 165 ms 45164 KB Output is correct
42 Correct 138 ms 46188 KB Output is correct
43 Correct 159 ms 47212 KB Output is correct
44 Correct 158 ms 47212 KB Output is correct
45 Correct 100 ms 49516 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 876 KB Output is correct
2 Correct 2 ms 1260 KB Output is correct
3 Correct 1 ms 1260 KB Output is correct
4 Correct 1 ms 1260 KB Output is correct
5 Correct 1 ms 1260 KB Output is correct
6 Correct 1 ms 1260 KB Output is correct
7 Correct 1 ms 1260 KB Output is correct
8 Correct 1 ms 1260 KB Output is correct
9 Correct 1 ms 1260 KB Output is correct
10 Correct 1 ms 1260 KB Output is correct
11 Correct 1 ms 1260 KB Output is correct
12 Correct 1 ms 1260 KB Output is correct
13 Correct 1 ms 1260 KB Output is correct
14 Correct 1 ms 1268 KB Output is correct
15 Correct 1 ms 1388 KB Output is correct
16 Correct 1 ms 1260 KB Output is correct
17 Correct 1 ms 1260 KB Output is correct
18 Correct 1 ms 1260 KB Output is correct
19 Correct 1 ms 1260 KB Output is correct
20 Correct 1 ms 1260 KB Output is correct
21 Correct 1 ms 1260 KB Output is correct
22 Correct 1 ms 1260 KB Output is correct
23 Correct 1 ms 1260 KB Output is correct
24 Correct 1 ms 1260 KB Output is correct
25 Correct 1 ms 1260 KB Output is correct
26 Correct 4 ms 3180 KB Output is correct
27 Correct 55 ms 29676 KB Output is correct
28 Correct 52 ms 29676 KB Output is correct
29 Correct 164 ms 42348 KB Output is correct
30 Correct 156 ms 42220 KB Output is correct
31 Correct 157 ms 42220 KB Output is correct
32 Correct 154 ms 42220 KB Output is correct
33 Correct 170 ms 43500 KB Output is correct
34 Correct 165 ms 43500 KB Output is correct
35 Correct 142 ms 43372 KB Output is correct
36 Correct 152 ms 43372 KB Output is correct
37 Correct 169 ms 43628 KB Output is correct
38 Correct 164 ms 45164 KB Output is correct
39 Correct 155 ms 45036 KB Output is correct
40 Correct 168 ms 45292 KB Output is correct
41 Correct 165 ms 45164 KB Output is correct
42 Correct 138 ms 46188 KB Output is correct
43 Correct 159 ms 47212 KB Output is correct
44 Correct 158 ms 47212 KB Output is correct
45 Correct 100 ms 49516 KB Output is correct
46 Correct 280 ms 36204 KB Output is correct
47 Correct 4330 ms 169996 KB Output is correct
48 Correct 4287 ms 201668 KB Output is correct
49 Correct 4336 ms 230780 KB Output is correct
50 Correct 4376 ms 230688 KB Output is correct
51 Correct 4266 ms 230764 KB Output is correct
52 Correct 4650 ms 230856 KB Output is correct
53 Correct 4549 ms 230860 KB Output is correct
54 Correct 4529 ms 230928 KB Output is correct
55 Correct 4585 ms 231144 KB Output is correct
56 Correct 4591 ms 247788 KB Output is correct
57 Correct 4604 ms 266352 KB Output is correct
58 Correct 4538 ms 286260 KB Output is correct
59 Correct 4502 ms 307956 KB Output is correct
60 Correct 4341 ms 330728 KB Output is correct
61 Correct 4296 ms 355732 KB Output is correct
62 Correct 4125 ms 381752 KB Output is correct
63 Correct 3972 ms 409492 KB Output is correct
64 Correct 1297 ms 469824 KB Output is correct
65 Correct 1290 ms 469996 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 876 KB Output is correct
2 Correct 2 ms 1260 KB Output is correct
3 Correct 1 ms 1260 KB Output is correct
4 Correct 1 ms 1260 KB Output is correct
5 Correct 1 ms 1260 KB Output is correct
6 Correct 1 ms 1260 KB Output is correct
7 Correct 1 ms 1260 KB Output is correct
8 Correct 1 ms 1260 KB Output is correct
9 Correct 1 ms 1260 KB Output is correct
10 Correct 1 ms 1260 KB Output is correct
11 Correct 1 ms 1260 KB Output is correct
12 Correct 1 ms 1260 KB Output is correct
13 Correct 1 ms 1260 KB Output is correct
14 Correct 1 ms 1268 KB Output is correct
15 Correct 1 ms 1388 KB Output is correct
16 Correct 1 ms 1260 KB Output is correct
17 Correct 1 ms 1260 KB Output is correct
18 Correct 1 ms 1260 KB Output is correct
19 Correct 1 ms 1260 KB Output is correct
20 Correct 1 ms 1260 KB Output is correct
21 Correct 1 ms 1260 KB Output is correct
22 Correct 1 ms 1260 KB Output is correct
23 Correct 1 ms 1260 KB Output is correct
24 Correct 1 ms 1260 KB Output is correct
25 Correct 1 ms 1260 KB Output is correct
26 Correct 4 ms 3180 KB Output is correct
27 Correct 55 ms 29676 KB Output is correct
28 Correct 52 ms 29676 KB Output is correct
29 Correct 164 ms 42348 KB Output is correct
30 Correct 156 ms 42220 KB Output is correct
31 Correct 157 ms 42220 KB Output is correct
32 Correct 154 ms 42220 KB Output is correct
33 Correct 170 ms 43500 KB Output is correct
34 Correct 165 ms 43500 KB Output is correct
35 Correct 142 ms 43372 KB Output is correct
36 Correct 152 ms 43372 KB Output is correct
37 Correct 169 ms 43628 KB Output is correct
38 Correct 164 ms 45164 KB Output is correct
39 Correct 155 ms 45036 KB Output is correct
40 Correct 168 ms 45292 KB Output is correct
41 Correct 165 ms 45164 KB Output is correct
42 Correct 138 ms 46188 KB Output is correct
43 Correct 159 ms 47212 KB Output is correct
44 Correct 158 ms 47212 KB Output is correct
45 Correct 100 ms 49516 KB Output is correct
46 Correct 280 ms 36204 KB Output is correct
47 Correct 4330 ms 169996 KB Output is correct
48 Correct 4287 ms 201668 KB Output is correct
49 Correct 4336 ms 230780 KB Output is correct
50 Correct 4376 ms 230688 KB Output is correct
51 Correct 4266 ms 230764 KB Output is correct
52 Correct 4650 ms 230856 KB Output is correct
53 Correct 4549 ms 230860 KB Output is correct
54 Correct 4529 ms 230928 KB Output is correct
55 Correct 4585 ms 231144 KB Output is correct
56 Correct 4591 ms 247788 KB Output is correct
57 Correct 4604 ms 266352 KB Output is correct
58 Correct 4538 ms 286260 KB Output is correct
59 Correct 4502 ms 307956 KB Output is correct
60 Correct 4341 ms 330728 KB Output is correct
61 Correct 4296 ms 355732 KB Output is correct
62 Correct 4125 ms 381752 KB Output is correct
63 Correct 3972 ms 409492 KB Output is correct
64 Correct 1297 ms 469824 KB Output is correct
65 Correct 1290 ms 469996 KB Output is correct
66 Correct 76 ms 24732 KB Output is correct
67 Correct 690 ms 147424 KB Output is correct
68 Correct 1419 ms 448108 KB Output is correct
69 Correct 1778 ms 449260 KB Output is correct
70 Correct 2252 ms 471436 KB Output is correct
71 Correct 5849 ms 171976 KB Output is correct
72 Correct 5778 ms 203824 KB Output is correct
73 Correct 5952 ms 233544 KB Output is correct
74 Correct 5963 ms 233452 KB Output is correct
75 Correct 5896 ms 233452 KB Output is correct
76 Correct 5711 ms 233324 KB Output is correct
77 Correct 5806 ms 233012 KB Output is correct
78 Correct 5612 ms 232812 KB Output is correct
79 Correct 5922 ms 268968 KB Output is correct
80 Correct 5825 ms 288748 KB Output is correct
81 Correct 5795 ms 310188 KB Output is correct
82 Correct 5751 ms 333400 KB Output is correct
83 Correct 5626 ms 357772 KB Output is correct
84 Correct 5275 ms 412248 KB Output is correct
85 Correct 2713 ms 472696 KB Output is correct