답안 #58666 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
58666	2018-07-18T17:39:48 Z	ksun48	Wild Boar (JOI18_wild_boar)	C++14	62 / 100	18000 ms	336320 KB

wild_boar

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;

const LL MAXD = (1LL << 60LL);
int n, m, t, l;
vector<int> a, b;
vector<LL> c;
typedef pair<LL, pair<int,int> > Path;
typedef vector<Path> OptPaths;
int unused = 3000;

Path new_unused(){
	Path x = {MAXD, {unused,unused}};
	//unused ++;
	return x;
}

Path alt_path(pair<int,int> avoid, OptPaths& paths){
	Path f = new_unused();
	for(Path x : paths){
		if(x.second.first != avoid.first && x.second.second != avoid.second){
			if(x.first < f.first){
				f = x;
			}
		}
	}
	return f;
}

Path alt_path2(pair<int,int> avoid, OptPaths& paths){
	Path f = new_unused();
	for(Path x : paths){
		if(x.second.first != avoid.first || x.second.second != avoid.second){
			if(x.first < f.first){
				f = x;
			}
		}
	}
	return f;
}


int np = 0;
OptPaths process(OptPaths cand){
	np++;
	OptPaths edges;

	if(cand.size() == 0) return edges;

	edges.push_back(alt_path({-1, -1}, cand));
	pair<int,int> x = edges[0].second;
	if(edges[0].first >= MAXD) return edges;

	edges.push_back(alt_path2(x, cand));
	pair<int,int> y = edges[1].second;
	if(edges[1].first >= MAXD) return edges;

	if(x.first != y.first && x.second != y.second){
		edges.push_back(alt_path({x.first, y.second}, cand));
		edges.push_back(alt_path({y.first, x.second}, cand));
	} else if(x.first == y.first){
		Path q = alt_path({x.first, -1}, cand);
		edges.push_back(q);
		edges.push_back(alt_path({x.first, q.second.second}, cand));
	} else if(x.second == y.second){
		Path q = alt_path({-1, x.second}, cand);
		edges.push_back(q);
		edges.push_back(alt_path({q.second.first, x.second}, cand));
	}
	sort(edges.begin(), edges.end());
	while(edges.size() > 0 && edges[edges.size() - 1].first >= MAXD) edges.pop_back();
	return edges;
}

OptPaths join(OptPaths a, OptPaths b){
	OptPaths cand;
	for(auto x : a){
		for(auto y : b){
			if(x.second.second != y.second.first){
				cand.push_back({min(x.first + y.first, MAXD), {x.second.first, y.second.second}});
			}
		}
	}
	return cand;
}

OptPaths edge(int id, LL cost){
	OptPaths x;
	x.push_back({cost, {id, id}});
	return x;
}

vector<vector<OptPaths> > cachedpaths;

void compute_paths2(int s){
	// start bellman-ford at s
	vector<OptPaths> sssp(n);
	for(int id = 0; id < m; id++){
		if(a[id] != s && b[id] != s) continue;
		if(b[id] == s) swap(a[id], b[id]);
		// all paths starting with edge id

		int st = b[id];
		vector<vector<int> > adj(n);
		for(int i = 0; i < m; i++){
			if(a[i] != s && b[i] != s){
				adj[a[i]].push_back(i);
				adj[b[i]].push_back(i);
			}
		}
		int vis[n][2];
		pair<LL,int> dist[n][2];
		int changed[n];
		for(int i = 0; i < n; i++){
			changed[i] = 0;
			vis[i][0] = vis[i][1] = 0;
			dist[i][0] = {MAXD, -2};
			dist[i][1] = {MAXD, -1};
		}
		dist[st][0] = {c[id], id};
		dist[st][1] = {MAXD, -1};
		changed[st] = 1;

		set<pair<LL,int> > stuff;
		stuff.insert({dist[st][0].first, (st << 1)});
		while(!stuff.empty()){
			pair<LL,int> x = *stuff.begin();
			stuff.erase(stuff.begin());
			int v = x.second >> 1;
			int idx = x.second & 1;
			vis[v][idx] = 1;
			if(!changed[v]) continue;
			changed[v] = 0;
			for(auto i : adj[v]){
				if(b[i] == v){
					swap(a[i], b[i]);
				}
				int w = b[i];
				if(vis[w][0] && vis[w][1]) continue;
				LL d = 0;
				if(dist[v][0].second != i){
					d = min(MAXD, dist[v][0].first + c[i]);
				} else {
					d = min(MAXD, dist[v][1].first + c[i]);
				}
				for(int j = 0; j < 2; j++){
					if(!vis[w][j]){
						stuff.erase({dist[w][j].first, (w << 1) ^ j});
						break;
					}
				}
				if(dist[w][0].second == i){
					if(d < dist[w][0].first){
						changed[w] = 1;
						dist[w][0] = {d, i};
					}
				} else if(dist[w][1].second == i){
					if(d < dist[w][1].first){
						changed[w] = 1;
						dist[w][1] = {d, i};
					}
				} else if(d < dist[w][1].first){
					changed[w] = 1;
					dist[w][1] = {d, i};
				}
				if(dist[w][0] > dist[w][1]) swap(dist[w][0], dist[w][1]);
				for(int j = 0; j < 2; j++){
					if(!vis[w][j]){
						stuff.insert({dist[w][j].first, (w << 1) ^ j});
						break;
					}
				}
			}
		}
		for(int i = 0; i < n; i++){
			if(i == s) continue;
			sssp[i].push_back({dist[i][0].first,{id,dist[i][0].second}});
			sssp[i].push_back({dist[i][1].first,{id,dist[i][1].second}});
		}
	}
	for(int i = 0; i < n; i++){
		if(i == s) continue;
		sssp[i] = process(sssp[i]);
	}
	cachedpaths[s] = sssp;
}


int main(){
	cin.sync_with_stdio(0); cin.tie(0);
	cin >> n >> m >> t >> l;
	cachedpaths.resize(n);
	a.resize(m); b.resize(m); c.resize(m);
	for(int i = 0; i < m; i++){
		cin >> a[i] >> b[i] >> c[i];
		a[i]--; b[i]--;
	}
	vector<int> plan(l);
	vector<int> need(n, 0);
	for(int i = 0; i < l; i++){
		cin >> plan[i];
		plan[i]--;
		need[plan[i]] = 1;
	}
	vector<pair<int,int> > updates(t);
	for(int i = 0; i < t; i++){
		cin >> updates[i].first >> updates[i].second;
		updates[i].first--; updates[i].second--;
		need[updates[i].second] = 1;
	}
	for(int i = 0; i < n; i++){
		compute_paths2(i);
		//cout << "done " << i << endl;
		/*for(int j = 0; j < n; j++){
			cout << "paths from " << i << " to " << j << '\n';
			if(i != j){
				OptPaths x = cachedpaths[i][j];
				for(auto v : x){
					cout << v.second.first << " " << v.second.second << " " << v.first << '\n';
				}
			}
		}*/
	}
	for(int tt = 0; tt < t; tt++){
		plan[updates[tt].first] = updates[tt].second;
		OptPaths route = cachedpaths[plan[0]][plan[1]];
		for(int j = 2; j < l; j++){
			route = process(join(route, cachedpaths[plan[j-1]][plan[j]] ) );
		}
		cout << (route.size() > 0 && route[0].first < MAXD ? route[0].first : -1) << '\n';
	}
}

Subtask #1
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	376 KB	Output is correct
3	Correct	2 ms	416 KB	Output is correct
4	Correct	3 ms	468 KB	Output is correct
5	Correct	4 ms	676 KB	Output is correct
6	Correct	3 ms	676 KB	Output is correct
7	Correct	3 ms	676 KB	Output is correct
8	Correct	3 ms	676 KB	Output is correct
9	Correct	3 ms	676 KB	Output is correct
10	Correct	3 ms	692 KB	Output is correct
11	Correct	2 ms	692 KB	Output is correct
12	Correct	4 ms	692 KB	Output is correct
13	Correct	3 ms	764 KB	Output is correct
14	Correct	1 ms	764 KB	Output is correct
15	Correct	2 ms	764 KB	Output is correct
16	Correct	3 ms	764 KB	Output is correct
17	Correct	3 ms	808 KB	Output is correct
18	Correct	3 ms	808 KB	Output is correct
19	Correct	2 ms	808 KB	Output is correct
20	Correct	2 ms	808 KB	Output is correct
21	Correct	3 ms	808 KB	Output is correct
22	Correct	3 ms	808 KB	Output is correct
23	Correct	3 ms	808 KB	Output is correct
24	Correct	2 ms	808 KB	Output is correct
25	Correct	3 ms	808 KB	Output is correct

Subtask #2
35.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	376 KB	Output is correct
3	Correct	2 ms	416 KB	Output is correct
4	Correct	3 ms	468 KB	Output is correct
5	Correct	4 ms	676 KB	Output is correct
6	Correct	3 ms	676 KB	Output is correct
7	Correct	3 ms	676 KB	Output is correct
8	Correct	3 ms	676 KB	Output is correct
9	Correct	3 ms	676 KB	Output is correct
10	Correct	3 ms	692 KB	Output is correct
11	Correct	2 ms	692 KB	Output is correct
12	Correct	4 ms	692 KB	Output is correct
13	Correct	3 ms	764 KB	Output is correct
14	Correct	1 ms	764 KB	Output is correct
15	Correct	2 ms	764 KB	Output is correct
16	Correct	3 ms	764 KB	Output is correct
17	Correct	3 ms	808 KB	Output is correct
18	Correct	3 ms	808 KB	Output is correct
19	Correct	2 ms	808 KB	Output is correct
20	Correct	2 ms	808 KB	Output is correct
21	Correct	3 ms	808 KB	Output is correct
22	Correct	3 ms	808 KB	Output is correct
23	Correct	3 ms	808 KB	Output is correct
24	Correct	2 ms	808 KB	Output is correct
25	Correct	3 ms	808 KB	Output is correct
26	Correct	7 ms	808 KB	Output is correct
27	Correct	88 ms	1728 KB	Output is correct
28	Correct	65 ms	1728 KB	Output is correct
29	Correct	267 ms	2236 KB	Output is correct
30	Correct	254 ms	2236 KB	Output is correct
31	Correct	237 ms	2236 KB	Output is correct
32	Correct	241 ms	2396 KB	Output is correct
33	Correct	298 ms	3960 KB	Output is correct
34	Correct	312 ms	4300 KB	Output is correct
35	Correct	205 ms	4496 KB	Output is correct
36	Correct	220 ms	4832 KB	Output is correct
37	Correct	286 ms	5028 KB	Output is correct
38	Correct	294 ms	7148 KB	Output is correct
39	Correct	269 ms	7260 KB	Output is correct
40	Correct	291 ms	7696 KB	Output is correct
41	Correct	288 ms	7784 KB	Output is correct
42	Correct	324 ms	8944 KB	Output is correct
43	Correct	332 ms	10036 KB	Output is correct
44	Correct	361 ms	10036 KB	Output is correct
45	Correct	294 ms	10040 KB	Output is correct

Subtask #3
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	376 KB	Output is correct
3	Correct	2 ms	416 KB	Output is correct
4	Correct	3 ms	468 KB	Output is correct
5	Correct	4 ms	676 KB	Output is correct
6	Correct	3 ms	676 KB	Output is correct
7	Correct	3 ms	676 KB	Output is correct
8	Correct	3 ms	676 KB	Output is correct
9	Correct	3 ms	676 KB	Output is correct
10	Correct	3 ms	692 KB	Output is correct
11	Correct	2 ms	692 KB	Output is correct
12	Correct	4 ms	692 KB	Output is correct
13	Correct	3 ms	764 KB	Output is correct
14	Correct	1 ms	764 KB	Output is correct
15	Correct	2 ms	764 KB	Output is correct
16	Correct	3 ms	764 KB	Output is correct
17	Correct	3 ms	808 KB	Output is correct
18	Correct	3 ms	808 KB	Output is correct
19	Correct	2 ms	808 KB	Output is correct
20	Correct	2 ms	808 KB	Output is correct
21	Correct	3 ms	808 KB	Output is correct
22	Correct	3 ms	808 KB	Output is correct
23	Correct	3 ms	808 KB	Output is correct
24	Correct	2 ms	808 KB	Output is correct
25	Correct	3 ms	808 KB	Output is correct
26	Correct	7 ms	808 KB	Output is correct
27	Correct	88 ms	1728 KB	Output is correct
28	Correct	65 ms	1728 KB	Output is correct
29	Correct	267 ms	2236 KB	Output is correct
30	Correct	254 ms	2236 KB	Output is correct
31	Correct	237 ms	2236 KB	Output is correct
32	Correct	241 ms	2396 KB	Output is correct
33	Correct	298 ms	3960 KB	Output is correct
34	Correct	312 ms	4300 KB	Output is correct
35	Correct	205 ms	4496 KB	Output is correct
36	Correct	220 ms	4832 KB	Output is correct
37	Correct	286 ms	5028 KB	Output is correct
38	Correct	294 ms	7148 KB	Output is correct
39	Correct	269 ms	7260 KB	Output is correct
40	Correct	291 ms	7696 KB	Output is correct
41	Correct	288 ms	7784 KB	Output is correct
42	Correct	324 ms	8944 KB	Output is correct
43	Correct	332 ms	10036 KB	Output is correct
44	Correct	361 ms	10036 KB	Output is correct
45	Correct	294 ms	10040 KB	Output is correct
46	Correct	514 ms	10040 KB	Output is correct
47	Correct	5645 ms	29284 KB	Output is correct
48	Correct	6348 ms	66412 KB	Output is correct
49	Correct	7860 ms	105664 KB	Output is correct
50	Correct	7930 ms	105664 KB	Output is correct
51	Correct	7201 ms	105752 KB	Output is correct
52	Correct	9099 ms	105860 KB	Output is correct
53	Correct	10075 ms	105924 KB	Output is correct
54	Correct	9559 ms	105924 KB	Output is correct
55	Correct	9439 ms	106100 KB	Output is correct
56	Correct	9451 ms	128240 KB	Output is correct
57	Correct	10276 ms	151828 KB	Output is correct
58	Correct	10160 ms	177752 KB	Output is correct
59	Correct	11249 ms	205632 KB	Output is correct
60	Correct	12337 ms	235608 KB	Output is correct
61	Correct	12442 ms	267180 KB	Output is correct
62	Correct	12735 ms	300632 KB	Output is correct
63	Correct	13439 ms	336320 KB	Output is correct
64	Correct	10182 ms	336320 KB	Output is correct
65	Correct	10001 ms	336320 KB	Output is correct

Subtask #4
0 / 38.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	376 KB	Output is correct
3	Correct	2 ms	416 KB	Output is correct
4	Correct	3 ms	468 KB	Output is correct
5	Correct	4 ms	676 KB	Output is correct
6	Correct	3 ms	676 KB	Output is correct
7	Correct	3 ms	676 KB	Output is correct
8	Correct	3 ms	676 KB	Output is correct
9	Correct	3 ms	676 KB	Output is correct
10	Correct	3 ms	692 KB	Output is correct
11	Correct	2 ms	692 KB	Output is correct
12	Correct	4 ms	692 KB	Output is correct
13	Correct	3 ms	764 KB	Output is correct
14	Correct	1 ms	764 KB	Output is correct
15	Correct	2 ms	764 KB	Output is correct
16	Correct	3 ms	764 KB	Output is correct
17	Correct	3 ms	808 KB	Output is correct
18	Correct	3 ms	808 KB	Output is correct
19	Correct	2 ms	808 KB	Output is correct
20	Correct	2 ms	808 KB	Output is correct
21	Correct	3 ms	808 KB	Output is correct
22	Correct	3 ms	808 KB	Output is correct
23	Correct	3 ms	808 KB	Output is correct
24	Correct	2 ms	808 KB	Output is correct
25	Correct	3 ms	808 KB	Output is correct
26	Correct	7 ms	808 KB	Output is correct
27	Correct	88 ms	1728 KB	Output is correct
28	Correct	65 ms	1728 KB	Output is correct
29	Correct	267 ms	2236 KB	Output is correct
30	Correct	254 ms	2236 KB	Output is correct
31	Correct	237 ms	2236 KB	Output is correct
32	Correct	241 ms	2396 KB	Output is correct
33	Correct	298 ms	3960 KB	Output is correct
34	Correct	312 ms	4300 KB	Output is correct
35	Correct	205 ms	4496 KB	Output is correct
36	Correct	220 ms	4832 KB	Output is correct
37	Correct	286 ms	5028 KB	Output is correct
38	Correct	294 ms	7148 KB	Output is correct
39	Correct	269 ms	7260 KB	Output is correct
40	Correct	291 ms	7696 KB	Output is correct
41	Correct	288 ms	7784 KB	Output is correct
42	Correct	324 ms	8944 KB	Output is correct
43	Correct	332 ms	10036 KB	Output is correct
44	Correct	361 ms	10036 KB	Output is correct
45	Correct	294 ms	10040 KB	Output is correct
46	Correct	514 ms	10040 KB	Output is correct
47	Correct	5645 ms	29284 KB	Output is correct
48	Correct	6348 ms	66412 KB	Output is correct
49	Correct	7860 ms	105664 KB	Output is correct
50	Correct	7930 ms	105664 KB	Output is correct
51	Correct	7201 ms	105752 KB	Output is correct
52	Correct	9099 ms	105860 KB	Output is correct
53	Correct	10075 ms	105924 KB	Output is correct
54	Correct	9559 ms	105924 KB	Output is correct
55	Correct	9439 ms	106100 KB	Output is correct
56	Correct	9451 ms	128240 KB	Output is correct
57	Correct	10276 ms	151828 KB	Output is correct
58	Correct	10160 ms	177752 KB	Output is correct
59	Correct	11249 ms	205632 KB	Output is correct
60	Correct	12337 ms	235608 KB	Output is correct
61	Correct	12442 ms	267180 KB	Output is correct
62	Correct	12735 ms	300632 KB	Output is correct
63	Correct	13439 ms	336320 KB	Output is correct
64	Correct	10182 ms	336320 KB	Output is correct
65	Correct	10001 ms	336320 KB	Output is correct
66	Correct	8693 ms	336320 KB	Output is correct
67	Correct	3984 ms	336320 KB	Output is correct
68	Correct	8670 ms	336320 KB	Output is correct
69	Correct	12855 ms	336320 KB	Output is correct
70	Execution timed out	18079 ms	336320 KB	Time limit exceeded
71	Halted	0 ms	0 KB	-

답안 #58666

Compilation message

Subtask #1 12.0 / 12.0

Subtask #2 35.0 / 35.0

Subtask #3 15.0 / 15.0

Subtask #4 0 / 38.0

Subtask #1
12.0 / 12.0

Subtask #2
35.0 / 35.0

Subtask #3
15.0 / 15.0

Subtask #4
0 / 38.0