oj.uz

Submission #851157

# Submission time Handle Problem Language Result Execution time Memory
851157 2023-09-18T16:42:37 Z pakapu Cheap flights (LMIO18_pigus_skrydziai) C++17
37 / 100
 3000 ms 31196 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long

int ans = 0;

vector<int> cost;
vector<int> calculated;
vector<vector<pair<int, int>>> g;

int dfs(int u, int depth) {
	if(depth >= 2) {
		return 0;
	}
	if(depth == 1) {
		for(auto v : g[u]) {
			if(!calculated[v.first]) {
				continue;
			}
			//cout << v.first << ' ' << u << '\n';
			//cout << cost[v.first] << ' ' << cost[u] << ' ' << v.second << '\n';
			ans = max(ans, cost[v.first] + cost[u] + v.second);
		}
		return 0;
	}

	int curr = 0;

	for(auto v : g[u]) {
		cost[v.first] = v.second;
		calculated[v.first] = true;
		curr += v.second;
		dfs(v.first, depth + 1);
	}

	return curr;
}


signed main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);

	int n, m;
	cin >> n >> m;

	cost = vector<int>(n);
	calculated = vector<int>(n);
	g = vector<vector<pair<int, int>>>(n);

	for(int i = 0; i < m; i++) {
		int from, to, w;
		cin >> from >> to >> w;
		from--;
		to--;

		g[from].push_back(make_pair(to, w));
		g[to].push_back(make_pair(from, w));
	}

	ans = 0;
	for(int i = 0; i < n; i++) {
		calculated = vector<int>(n);
		int curr = dfs(i, 0);
		ans = max(ans, curr);
	}


	cout << ans << '\n';

	return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 456 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 19 ms 1368 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 456 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 19 ms 1368 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 539 ms 31196 KB Output is correct
23 Correct 2357 ms 25368 KB Output is correct
24 Correct 8 ms 1880 KB Output is correct
25 Correct 3 ms 860 KB Output is correct
26 Correct 3 ms 856 KB Output is correct
27 Correct 3 ms 604 KB Output is correct
28 Correct 183 ms 12972 KB Output is correct
29 Correct 232 ms 5096 KB Output is correct
30 Correct 463 ms 7248 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1811 ms 29264 KB Output is correct
34 Correct 1517 ms 24840 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3018 ms 26044 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 47.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3018 ms 26044 KB Time limit exceeded
2 Halted 0 ms 0 KB -