oj.uz

Submission #58539

# Submission time Handle Problem Language Result Execution time Memory
58539 2018-07-18T06:03:53 Z ksun48 Wild Boar (JOI18_wild_boar) C++14
47 / 100
 18000 ms 47868 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) continue;
		if(x.second.second == avoid.second) continue;
		return x;
	}
	return new_unused();
}

OptPaths process(OptPaths cand){
	sort(cand.begin(), cand.end());
	OptPaths edges;
	if(cand.size() == 0) return edges;
	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());
	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_paths(int s){
	// start bellman-ford at s
	vector<OptPaths> sssp(n);
	vector<vector<int> > adj(n); // to, id, cost
	for(int i = 0; i < m; i++){
		if(a[i] == s){
			sssp[b[i]] = edge(i, c[i]);
		} else if(b[i] == s){
			sssp[a[i]] = edge(i, c[i]);
		} else {
			adj[a[i]].push_back(i);
			adj[b[i]].push_back(i);
		}
	}
	int vis[n][4];
	for(int i = 0; i < n; i++){
		for(int j = 0; j < 4; j++){
			vis[i][j] = 0;
		}
	}
	set<pair<LL,pair<int,int> > > stuff;
	for(int i = 0; i < n; i++){
		for(int idx = 0; idx < sssp[i].size(); idx++){
			stuff.insert({sssp[i][idx].first, {i, idx}});
		}
	}
	while(!stuff.empty()){
		pair<LL,pair<int,int> > v = *stuff.begin();
		if(v.first >= MAXD){
			break;
		}
		stuff.erase(stuff.begin());
		vis[v.second.first][v.second.second] = 1;
		for(auto i : adj[v.second.first]){
			if(b[i] == v.second.first){
				swap(a[i], b[i]);
			}
			OptPaths e = edge(i, c[i]);
			OptPaths x = join(sssp[a[i]], e);
			x.insert(x.end(), sssp[b[i]].begin(), sssp[b[i]].end());
			for(int idx = 0; idx < sssp[b[i]].size(); idx++){
				stuff.erase({sssp[b[i]][idx].first, {b[i], idx}});
			}
			sssp[b[i]] = process(x);
			for(int idx = 0; idx < sssp[b[i]].size(); idx++){
				if(!vis[b[i]][idx]){
					stuff.insert({sssp[b[i]][idx].first, {b[i], idx}});
				}
			}
		}
	}
	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);
	for(int i = 0; i < l; i++){
		cin >> plan[i];
		plan[i]--;
	}
	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--;
	}
	for(int i = 0; i < n; i++){
		compute_paths(i);
		/*for(int j = 0; j < n; j++){
			cout << "paths from " << i << " to " << j << '\n';
			if(i != j){
				OptPaths x = best_paths(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:35:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < cand.size(); i++){
                 ~~^~~~~~~~~~~~~
wild_boar.cpp: In function 'void compute_paths(int)':
wild_boar.cpp:102:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int idx = 0; idx < sssp[i].size(); idx++){
                    ~~~~^~~~~~~~~~~~~~~~
wild_boar.cpp:120:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int idx = 0; idx < sssp[b[i]].size(); idx++){
                     ~~~~^~~~~~~~~~~~~~~~~~~
wild_boar.cpp:124:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int idx = 0; idx < sssp[b[i]].size(); idx++){
                     ~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 488 KB Output is correct
3 Correct 3 ms 488 KB Output is correct
4 Correct 0 ms 488 KB Output is correct
5 Correct 3 ms 552 KB Output is correct
6 Correct 3 ms 552 KB Output is correct
7 Correct 3 ms 704 KB Output is correct
8 Correct 3 ms 704 KB Output is correct
9 Correct 5 ms 704 KB Output is correct
10 Correct 4 ms 704 KB Output is correct
11 Correct 3 ms 704 KB Output is correct
12 Correct 4 ms 704 KB Output is correct
13 Correct 4 ms 704 KB Output is correct
14 Correct 4 ms 704 KB Output is correct
15 Correct 4 ms 704 KB Output is correct
16 Correct 4 ms 704 KB Output is correct
17 Correct 3 ms 704 KB Output is correct
18 Correct 3 ms 704 KB Output is correct
19 Correct 3 ms 704 KB Output is correct
20 Correct 3 ms 704 KB Output is correct
21 Correct 3 ms 704 KB Output is correct
22 Correct 3 ms 704 KB Output is correct
23 Correct 4 ms 704 KB Output is correct
24 Correct 3 ms 704 KB Output is correct
25 Correct 3 ms 720 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 3 ms 488 KB Output is correct
3 Correct 3 ms 488 KB Output is correct
4 Correct 0 ms 488 KB Output is correct
5 Correct 3 ms 552 KB Output is correct
6 Correct 3 ms 552 KB Output is correct
7 Correct 3 ms 704 KB Output is correct
8 Correct 3 ms 704 KB Output is correct
9 Correct 5 ms 704 KB Output is correct
10 Correct 4 ms 704 KB Output is correct
11 Correct 3 ms 704 KB Output is correct
12 Correct 4 ms 704 KB Output is correct
13 Correct 4 ms 704 KB Output is correct
14 Correct 4 ms 704 KB Output is correct
15 Correct 4 ms 704 KB Output is correct
16 Correct 4 ms 704 KB Output is correct
17 Correct 3 ms 704 KB Output is correct
18 Correct 3 ms 704 KB Output is correct
19 Correct 3 ms 704 KB Output is correct
20 Correct 3 ms 704 KB Output is correct
21 Correct 3 ms 704 KB Output is correct
22 Correct 3 ms 704 KB Output is correct
23 Correct 4 ms 704 KB Output is correct
24 Correct 3 ms 704 KB Output is correct
25 Correct 3 ms 720 KB Output is correct
26 Correct 12 ms 720 KB Output is correct
27 Correct 179 ms 1788 KB Output is correct
28 Correct 51 ms 1788 KB Output is correct
29 Correct 603 ms 2328 KB Output is correct
30 Correct 485 ms 2328 KB Output is correct
31 Correct 491 ms 2328 KB Output is correct
32 Correct 617 ms 2328 KB Output is correct
33 Correct 717 ms 3480 KB Output is correct
34 Correct 796 ms 3580 KB Output is correct
35 Correct 829 ms 3608 KB Output is correct
36 Correct 733 ms 3608 KB Output is correct
37 Correct 977 ms 3608 KB Output is correct
38 Correct 867 ms 5252 KB Output is correct
39 Correct 879 ms 5284 KB Output is correct
40 Correct 895 ms 5284 KB Output is correct
41 Correct 1058 ms 5284 KB Output is correct
42 Correct 959 ms 6596 KB Output is correct
43 Correct 1270 ms 7552 KB Output is correct
44 Correct 952 ms 7552 KB Output is correct
45 Correct 454 ms 10364 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 3 ms 488 KB Output is correct
3 Correct 3 ms 488 KB Output is correct
4 Correct 0 ms 488 KB Output is correct
5 Correct 3 ms 552 KB Output is correct
6 Correct 3 ms 552 KB Output is correct
7 Correct 3 ms 704 KB Output is correct
8 Correct 3 ms 704 KB Output is correct
9 Correct 5 ms 704 KB Output is correct
10 Correct 4 ms 704 KB Output is correct
11 Correct 3 ms 704 KB Output is correct
12 Correct 4 ms 704 KB Output is correct
13 Correct 4 ms 704 KB Output is correct
14 Correct 4 ms 704 KB Output is correct
15 Correct 4 ms 704 KB Output is correct
16 Correct 4 ms 704 KB Output is correct
17 Correct 3 ms 704 KB Output is correct
18 Correct 3 ms 704 KB Output is correct
19 Correct 3 ms 704 KB Output is correct
20 Correct 3 ms 704 KB Output is correct
21 Correct 3 ms 704 KB Output is correct
22 Correct 3 ms 704 KB Output is correct
23 Correct 4 ms 704 KB Output is correct
24 Correct 3 ms 704 KB Output is correct
25 Correct 3 ms 720 KB Output is correct
26 Correct 12 ms 720 KB Output is correct
27 Correct 179 ms 1788 KB Output is correct
28 Correct 51 ms 1788 KB Output is correct
29 Correct 603 ms 2328 KB Output is correct
30 Correct 485 ms 2328 KB Output is correct
31 Correct 491 ms 2328 KB Output is correct
32 Correct 617 ms 2328 KB Output is correct
33 Correct 717 ms 3480 KB Output is correct
34 Correct 796 ms 3580 KB Output is correct
35 Correct 829 ms 3608 KB Output is correct
36 Correct 733 ms 3608 KB Output is correct
37 Correct 977 ms 3608 KB Output is correct
38 Correct 867 ms 5252 KB Output is correct
39 Correct 879 ms 5284 KB Output is correct
40 Correct 895 ms 5284 KB Output is correct
41 Correct 1058 ms 5284 KB Output is correct
42 Correct 959 ms 6596 KB Output is correct
43 Correct 1270 ms 7552 KB Output is correct
44 Correct 952 ms 7552 KB Output is correct
45 Correct 454 ms 10364 KB Output is correct
46 Correct 1502 ms 10364 KB Output is correct
47 Correct 16627 ms 27124 KB Output is correct
48 Execution timed out 18008 ms 47868 KB Time limit exceeded
49 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 3 ms 488 KB Output is correct
3 Correct 3 ms 488 KB Output is correct
4 Correct 0 ms 488 KB Output is correct
5 Correct 3 ms 552 KB Output is correct
6 Correct 3 ms 552 KB Output is correct
7 Correct 3 ms 704 KB Output is correct
8 Correct 3 ms 704 KB Output is correct
9 Correct 5 ms 704 KB Output is correct
10 Correct 4 ms 704 KB Output is correct
11 Correct 3 ms 704 KB Output is correct
12 Correct 4 ms 704 KB Output is correct
13 Correct 4 ms 704 KB Output is correct
14 Correct 4 ms 704 KB Output is correct
15 Correct 4 ms 704 KB Output is correct
16 Correct 4 ms 704 KB Output is correct
17 Correct 3 ms 704 KB Output is correct
18 Correct 3 ms 704 KB Output is correct
19 Correct 3 ms 704 KB Output is correct
20 Correct 3 ms 704 KB Output is correct
21 Correct 3 ms 704 KB Output is correct
22 Correct 3 ms 704 KB Output is correct
23 Correct 4 ms 704 KB Output is correct
24 Correct 3 ms 704 KB Output is correct
25 Correct 3 ms 720 KB Output is correct
26 Correct 12 ms 720 KB Output is correct
27 Correct 179 ms 1788 KB Output is correct
28 Correct 51 ms 1788 KB Output is correct
29 Correct 603 ms 2328 KB Output is correct
30 Correct 485 ms 2328 KB Output is correct
31 Correct 491 ms 2328 KB Output is correct
32 Correct 617 ms 2328 KB Output is correct
33 Correct 717 ms 3480 KB Output is correct
34 Correct 796 ms 3580 KB Output is correct
35 Correct 829 ms 3608 KB Output is correct
36 Correct 733 ms 3608 KB Output is correct
37 Correct 977 ms 3608 KB Output is correct
38 Correct 867 ms 5252 KB Output is correct
39 Correct 879 ms 5284 KB Output is correct
40 Correct 895 ms 5284 KB Output is correct
41 Correct 1058 ms 5284 KB Output is correct
42 Correct 959 ms 6596 KB Output is correct
43 Correct 1270 ms 7552 KB Output is correct
44 Correct 952 ms 7552 KB Output is correct
45 Correct 454 ms 10364 KB Output is correct
46 Correct 1502 ms 10364 KB Output is correct
47 Correct 16627 ms 27124 KB Output is correct
48 Execution timed out 18008 ms 47868 KB Time limit exceeded
49 Halted 0 ms 0 KB -