제출 #198457

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
198457		oolimry	Cheap flights (LMIO18_pigus_skrydziai)	C++14	12 / 100	3342 ms	220116 KiB

pigus_skrydziai

#include <bits/stdc++.h>

using namespace std;
typedef pair<int,long long> ii; 
static vector<ii> adj[500005];

map<ii, long long> edges;
int main(){
	//freopen("i.txt","r",stdin);
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int n, m; cin >> n >> m;
	
	for(int b = 0;b < n;b++){
		for(int c = 0;c < n;c++){
			edges[ii(b,c)] = -1238213829038LL;
		}
	}

	for(int i = 0;i < m;i++){
		int u, v; long long w;
		cin >> u >> v >> w; u--; v--;
		adj[u].push_back(ii(v,w));
		adj[v].push_back(ii(u,w));
		edges[ii(u,v)] = w;
		edges[ii(v,u)] = w;
	}
	
	long long ans = 0;
	
	for(int i = 0;i < n;i++){
		long long acc = 0;
		for(ii v : adj[i]) acc += v.second;
		ans = max(ans, acc);
	}
	
	
	for(int a = 0;a < n;a++){
		for(int b = 0;b < n;b++){
			for(int c = 0;c < n;c++){
				ans = max(ans, edges[ii(a,b)] + edges[ii(c,b)] + edges[ii(a,c)]);
			}
		}
	}
	
	
	cout << ans;
}

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