Submission #442735

#	Time	Username	Problem	Language	Result	Execution time	Memory
442735		dutch	Graph (BOI20_graph)	C++17	100 / 100	203 ms	27160 KiB

Graph

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

const int MAXN = 1e5;
double EPS = 1e-8;

vector<pair<int, bool>> g[MAXN];
int n, m, c[MAXN];
double x = 1e18, r[MAXN];
bool s[MAXN], vis[MAXN], ok = 1;
vector<int> comp;

void dfs(int u){
	vis[u] = 1; comp.push_back(u);
	for(auto &[v, w] : g[u]){
		if(!vis[v]){
			s[v] = !s[u];
			c[v] = (2 - (int)w) - c[u];
			dfs(v);
		}else if(s[u] == s[v])
			x = ((2 - (int)w) - c[u] - c[v]) / (s[u] ? -2.0 : 2.0);
	}
}

signed main(){
	cin.tie(0)->sync_with_stdio(0);
	cin >> n >> m;
	while(m--){
		int u, v, w; cin >> u >> v >> w;
		--u, --v;
		g[u].emplace_back(v, w&1);
		g[v].emplace_back(u, w&1);
	}
	for(int z=0; z<n && ok; ++z){
		if(vis[z]) continue;
		comp.clear(), x = 1e18, dfs(z);
		if(x > 1e17){
			vector<int> v;
			for(int i : comp) v.push_back(s[i] ? c[i] : -c[i]);
			sort(v.begin(), v.end());
			x = v[(int)v.size()/2];
		}
		for(int i : comp) r[i] = (c[i] + (s[i] ? -x : x));
	}
	for(int u=0; u<n; ++u)
		for(auto &[v, w] : g[u])
			ok = ok && abs((2 - (int)w) - r[u] - r[v]) < EPS;

	if(!ok) cout << "NO\n";
	else{
		cout << "YES\n";
		cout << setprecision(1) << fixed;
		for(int i=0; i<n; ++i) cout << r[i] << ' ';
	}
}

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