Submission #1299334

#	Time	Username	Problem	Language	Result	Execution time	Memory
1299334		flo	Graph (BOI20_graph)	C++20	0 / 100	2 ms	348 KiB

Graph

#include <bits/stdc++.h>
#define task "testing"
#define ll long long
#define multitest 0
using namespace std;

struct Line {
	int a, b;
};

struct Edge {
	int u, v, w;
	
	bool vis;
}; 

const int N = 1e5, S = 1e8;

Edge e[2*N+5];

Line a[N+5], l[2];

bool ex[N+5], check;

int id[N+5], X[N+5], cur;

vector<int> adj[N+5], val;

void dfs(int v) {
	id[v] = cur;
	
	for (int x = 1; x <= 2; x++) {
		l[x-1] = {-a[v].a, x*S-a[v].b};
	}
	
	for (auto x : adj[v]) {
		if (e[x].vis) continue;
		
		e[x].vis = 1;
		
		int u = e[x].u^e[x].v^v;
		
		if (!id[u]) {
			a[u] = l[e[x].w-1], dfs(u);
		}
		else {
			if (a[v].a*a[u].a == -1) {
				X[cur] = (a[v].b-a[u].b)/(a[u].a-a[v].a);
			}
			else {
				X[cur] = (e[x].w*S-a[v].b-a[u].b)/(2*a[v].a), ex[cur] = 1;
			}
		}
		
		if (check) return;
	}
}

void flo(int ID) {
	int n, m; cin >> n >> m;
	
	for (int x = 1; x <= m; x++) {
		cin >> e[x].u >> e[x].v >> e[x].w;
		
		adj[e[x].u].push_back(x);
		adj[e[x].v].push_back(x);
		
		e[x].vis = 0;
	}
	
	for (int x = 1; x <= n; x++) {
		if (id[x]) continue;
		
		cur++, a[x] = {1, 0}, dfs(x);
		
		if (check) {
			cout << "NO\n";
			
			return;
		}
	}
	
	for (int x = 1; x <= n; x++) {
		if (ex[id[x]]) {	
			a[x].b = a[x].a*X[id[x]]+a[x].b;
		}
		else {
			val.push_back(-a[x].a*a[x].b);
		}
	}
	
	if (!val.empty()) {
		sort(val.begin(), val.end());
		
		int mid = val[val.size()/2];
		
		for (int x = 1; x <= n; x++) {
			if (!ex[id[x]]) {
				a[x].b += a[x].a*mid;
			}
		}
	}
	
	for (int x = 1; x <= m; x++) {
		int s = a[e[x].u].b/100+a[e[x].v].b/100; 
		
		if (abs(s-e[x].w*S/100) > 1) {
			cout << "NO\n";
			
			return;
		}
	}
	
	cout << "YES\n";
	
	for (int x = 1; x <= n; x++) {
		if (a[x].b < 0) {
			a[x].b *= -1;
			
			cout << "-";
		}
		
		cout << a[x].b/S << "." << a[x].b%S << " ";
	}
	
	cout << "\n";
}

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

	if (fopen(task".inp", "r")) {
		freopen(task".inp", "r", stdin);
		freopen(task".out", "w", stdout);
	}

	int TCS = 1, ID = 1;

	if (multitest) {
		cin >> TCS;
	}

	while (TCS--) flo(ID++);

	return 0;
}

Compilation message (stderr)

Graph.cpp: In function 'int main()':
Graph.cpp:134:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  134 |                 freopen(task".inp", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Graph.cpp:135:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  135 |                 freopen(task".out", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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