Submission #859333

#	Time	Username	Problem	Language	Result	Execution time	Memory
859333		maks007	Graph (BOI20_graph)	C++14	5 / 100	1085 ms	448 KiB

Graph

#include "bits/stdc++.h"
 
using namespace std;
 
#define int long long
 
signed main () {
	ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int n, m;
	cin >> n >> m;
	vector <pair <int, double>> g[n];
	vector <double> node(n, (double)1e9), ans(n);
	double mn = 1e9;
	function<void(int)> dfs=[&](int v) {
		node[v] = 0;
		for(auto [i, j] : g[v]) {
			if(!node[i]) continue;
			dfs(i);
		}
	};
	function<void(int)> rec=[&](int i) {
		// cout << i << " ";
		if(i==n) {
			for(int j = 0; j < n; j ++) {
				for(auto [k, w] : g[j]) {
					if(node[k] + node[j] == w) continue;
					return;
				}
			}
			double sum = 0.0;
			for(auto i : node) sum += fabs(i);
			// cout << mn << " ";
			if(sum < mn) {
				ans = node;
			
				mn = min(mn, sum);
			}
			return;
		}
		for(double val = -2; val < 3; val += 0.25) {
			node[i] = val;
			rec(i+1);
			node[i] = 1e9;
		}
	};
	for(int i = 0; i < m; i ++) {
		int u, v;
		cin >> u >> v;
		u --, v --;
		int w;
		cin >> w;
		g[u].push_back({v, w});
		g[v].push_back({u, w});
	}
	int cnt = 0;
	for(int i = 0; i < n; i ++) {
		if(!node[i]) continue;
		cnt ++;
		dfs(i);
	}
	assert(cnt <= 3);
	for(auto &j : node) j = 1e9;
	rec(0);
	if(mn == 1e9) {
		cout << "NO\n";
		return 0;
	}
	cout << "YES" << "\n";
	for(auto i : ans) cout << fixed << setprecision(6) << i << " ";
	return 0;
}

Compilation message (stderr)

Graph.cpp: In lambda function:
Graph.cpp:17:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   17 |   for(auto [i, j] : g[v]) {
      |            ^
Graph.cpp: In lambda function:
Graph.cpp:26:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   26 |     for(auto [k, w] : g[j]) {
      |              ^

• Subtask 1: 5 / 5
• Subtask 2: 0 / 12
• Subtask 3: 0 / 17
• Subtask 4: 0 / 24
• Subtask 5: 0 / 42