oj.uz

Submission #58658

# Submission time Handle Problem Language Result Execution time Memory
58658 2018-07-18T16:48:42 Z ksun48 Wild Boar (JOI18_wild_boar) C++14
47 / 100
 18000 ms 110208 KB 
#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){
	for(Path x : paths){
		if(x.second.first != avoid.first && x.second.second != avoid.second) return x;
	}
	return new_unused();
}

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

	if(cand.size() == 0) return edges;
	sort(cand.begin(), cand.end());

	pair<int,int> x = cand[0].second;
	edges.push_back(cand[0]);
	pair<int,int> y;
	for(int i = 0; i < cand.size(); i++){
		if(cand[i].second == x) continue;
		y = cand[i].second;
		edges.push_back(cand[i]);
		break;
	}
	if(edges.size() == 1){
		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];
		for(int i = 0; i < n; i++){
			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};

		set<pair<LL,pair<int,int> > > stuff;
		for(int i = 0; i < n; i++){
			if(i != s){
				stuff.insert({dist[i][0].first, {i, 0}});
				stuff.insert({dist[i][1].first, {i, 1}});
			}
		}
		while(!stuff.empty()){
			pair<LL,pair<int,int> > x = *stuff.begin();
			stuff.erase(stuff.begin());
			int v = x.second.first;
			int idx = x.second.second;
			vis[v][idx] = 1;
			for(auto i : adj[v]){
				if(b[i] == v){
					swap(a[i], b[i]);
				}
				int w = b[i];
				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,j}});
					}
				}
				if(dist[w][0].second == i){
					dist[w][0].first = min(dist[w][0].first, d);
				} else if(dist[w][1].second == i){
					dist[w][1].first = min(dist[w][1].first, d);
				} else if(d < dist[w][1].first){
					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,j}});
					}
				}
			}
		}
		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';
	}
}

Compilation message

wild_boar.cpp: In function 'OptPaths process(OptPaths)':
wild_boar.cpp:37:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < cand.size(); i++){
                 ~~^~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 492 KB Output is correct
3 Correct 3 ms 492 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 3 ms 492 KB Output is correct
6 Correct 2 ms 644 KB Output is correct
7 Correct 3 ms 644 KB Output is correct
8 Correct 3 ms 692 KB Output is correct
9 Correct 3 ms 692 KB Output is correct
10 Correct 3 ms 692 KB Output is correct
11 Correct 4 ms 692 KB Output is correct
12 Correct 2 ms 692 KB Output is correct
13 Correct 2 ms 692 KB Output is correct
14 Correct 3 ms 692 KB Output is correct
15 Correct 3 ms 692 KB Output is correct
16 Correct 3 ms 692 KB Output is correct
17 Correct 3 ms 692 KB Output is correct
18 Correct 3 ms 692 KB Output is correct
19 Correct 2 ms 692 KB Output is correct
20 Correct 4 ms 692 KB Output is correct
21 Correct 3 ms 692 KB Output is correct
22 Correct 3 ms 692 KB Output is correct
23 Correct 2 ms 692 KB Output is correct
24 Correct 2 ms 692 KB Output is correct
25 Correct 2 ms 732 KB Output is correct
26 Correct 8 ms 732 KB Output is correct
27 Correct 85 ms 1644 KB Output is correct
28 Correct 64 ms 1644 KB Output is correct
29 Correct 394 ms 2248 KB Output is correct
30 Correct 412 ms 2344 KB Output is correct
31 Correct 327 ms 2660 KB Output is correct
32 Correct 331 ms 2704 KB Output is correct
33 Correct 436 ms 4312 KB Output is correct
34 Correct 566 ms 4524 KB Output is correct
35 Correct 476 ms 4852 KB Output is correct
36 Correct 395 ms 5012 KB Output is correct
37 Correct 601 ms 5448 KB Output is correct
38 Correct 521 ms 7532 KB Output is correct
39 Correct 455 ms 7620 KB Output is correct
40 Correct 492 ms 8096 KB Output is correct
41 Correct 455 ms 8404 KB Output is correct
42 Correct 438 ms 9968 KB Output is correct
43 Correct 471 ms 11192 KB Output is correct
44 Correct 531 ms 11708 KB Output is correct
45 Correct 436 ms 11936 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 492 KB Output is correct
3 Correct 3 ms 492 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 3 ms 492 KB Output is correct
6 Correct 2 ms 644 KB Output is correct
7 Correct 3 ms 644 KB Output is correct
8 Correct 3 ms 692 KB Output is correct
9 Correct 3 ms 692 KB Output is correct
10 Correct 3 ms 692 KB Output is correct
11 Correct 4 ms 692 KB Output is correct
12 Correct 2 ms 692 KB Output is correct
13 Correct 2 ms 692 KB Output is correct
14 Correct 3 ms 692 KB Output is correct
15 Correct 3 ms 692 KB Output is correct
16 Correct 3 ms 692 KB Output is correct
17 Correct 3 ms 692 KB Output is correct
18 Correct 3 ms 692 KB Output is correct
19 Correct 2 ms 692 KB Output is correct
20 Correct 4 ms 692 KB Output is correct
21 Correct 3 ms 692 KB Output is correct
22 Correct 3 ms 692 KB Output is correct
23 Correct 2 ms 692 KB Output is correct
24 Correct 2 ms 692 KB Output is correct
25 Correct 2 ms 732 KB Output is correct
26 Correct 8 ms 732 KB Output is correct
27 Correct 85 ms 1644 KB Output is correct
28 Correct 64 ms 1644 KB Output is correct
29 Correct 394 ms 2248 KB Output is correct
30 Correct 412 ms 2344 KB Output is correct
31 Correct 327 ms 2660 KB Output is correct
32 Correct 331 ms 2704 KB Output is correct
33 Correct 436 ms 4312 KB Output is correct
34 Correct 566 ms 4524 KB Output is correct
35 Correct 476 ms 4852 KB Output is correct
36 Correct 395 ms 5012 KB Output is correct
37 Correct 601 ms 5448 KB Output is correct
38 Correct 521 ms 7532 KB Output is correct
39 Correct 455 ms 7620 KB Output is correct
40 Correct 492 ms 8096 KB Output is correct
41 Correct 455 ms 8404 KB Output is correct
42 Correct 438 ms 9968 KB Output is correct
43 Correct 471 ms 11192 KB Output is correct
44 Correct 531 ms 11708 KB Output is correct
45 Correct 436 ms 11936 KB Output is correct
46 Correct 881 ms 11936 KB Output is correct
47 Correct 13259 ms 31592 KB Output is correct
48 Correct 14356 ms 68768 KB Output is correct
49 Correct 16239 ms 108420 KB Output is correct
50 Correct 17377 ms 108552 KB Output is correct
51 Correct 16866 ms 108740 KB Output is correct
52 Correct 17996 ms 109280 KB Output is correct
53 Correct 17803 ms 109836 KB Output is correct
54 Execution timed out 18064 ms 110208 KB Time limit exceeded
55 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 492 KB Output is correct
3 Correct 3 ms 492 KB Output is correct
4 Correct 3 ms 492 KB Output is correct
5 Correct 3 ms 492 KB Output is correct
6 Correct 2 ms 644 KB Output is correct
7 Correct 3 ms 644 KB Output is correct
8 Correct 3 ms 692 KB Output is correct
9 Correct 3 ms 692 KB Output is correct
10 Correct 3 ms 692 KB Output is correct
11 Correct 4 ms 692 KB Output is correct
12 Correct 2 ms 692 KB Output is correct
13 Correct 2 ms 692 KB Output is correct
14 Correct 3 ms 692 KB Output is correct
15 Correct 3 ms 692 KB Output is correct
16 Correct 3 ms 692 KB Output is correct
17 Correct 3 ms 692 KB Output is correct
18 Correct 3 ms 692 KB Output is correct
19 Correct 2 ms 692 KB Output is correct
20 Correct 4 ms 692 KB Output is correct
21 Correct 3 ms 692 KB Output is correct
22 Correct 3 ms 692 KB Output is correct
23 Correct 2 ms 692 KB Output is correct
24 Correct 2 ms 692 KB Output is correct
25 Correct 2 ms 732 KB Output is correct
26 Correct 8 ms 732 KB Output is correct
27 Correct 85 ms 1644 KB Output is correct
28 Correct 64 ms 1644 KB Output is correct
29 Correct 394 ms 2248 KB Output is correct
30 Correct 412 ms 2344 KB Output is correct
31 Correct 327 ms 2660 KB Output is correct
32 Correct 331 ms 2704 KB Output is correct
33 Correct 436 ms 4312 KB Output is correct
34 Correct 566 ms 4524 KB Output is correct
35 Correct 476 ms 4852 KB Output is correct
36 Correct 395 ms 5012 KB Output is correct
37 Correct 601 ms 5448 KB Output is correct
38 Correct 521 ms 7532 KB Output is correct
39 Correct 455 ms 7620 KB Output is correct
40 Correct 492 ms 8096 KB Output is correct
41 Correct 455 ms 8404 KB Output is correct
42 Correct 438 ms 9968 KB Output is correct
43 Correct 471 ms 11192 KB Output is correct
44 Correct 531 ms 11708 KB Output is correct
45 Correct 436 ms 11936 KB Output is correct
46 Correct 881 ms 11936 KB Output is correct
47 Correct 13259 ms 31592 KB Output is correct
48 Correct 14356 ms 68768 KB Output is correct
49 Correct 16239 ms 108420 KB Output is correct
50 Correct 17377 ms 108552 KB Output is correct
51 Correct 16866 ms 108740 KB Output is correct
52 Correct 17996 ms 109280 KB Output is correct
53 Correct 17803 ms 109836 KB Output is correct
54 Execution timed out 18064 ms 110208 KB Time limit exceeded
55 Halted 0 ms 0 KB -