Submission #1237050

#	Time	Username	Problem	Language	Result	Execution time	Memory
1237050		i_love_mriti	Cheap flights (LMIO18_pigus_skrydziai)	C++20	12 / 100	130 ms	3264 KiB

pigus_skrydziai

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

#define ll long long

const int mxN = 210;

set<pair<ll, ll>> adj[mxN];
ll c[mxN], vis[mxN][mxN];

int main(){
	ll n, m, u, v, w, ans = 0;
	cin >> n >> m;

	memset(vis, -1, sizeof(vis));

	for(int i = 1; i <= m; ++i){
		cin >> u >> v >> w;
		adj[u].insert({v, w});
		adj[v].insert({u, w});
		vis[u][v] = w;
		vis[v][u] = w;
		c[u] += w;
		c[v] += w;
		ans = max({ans, c[u], c[v]});
	}

	for(int i = 1; i <= n; ++i){
		for(auto j : adj[i]){
			for(auto k : adj[j.first]){
				if(vis[i][k.first] != -1){
					ans = max(ans, j.second + k.second + vis[i][k.first]);
				}
			}
		}
	}

	cout << ans << "\n";


	return 0;
}

• Subtask 1: 12 / 12
• Subtask 2: 0 / 25
• Subtask 3: 0 / 16
• Subtask 4: 0 / 47