提出 #45641336

---

ソースコード 拡げる

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

typedef long long ll;

vector<vector<vector<ll>>> read_input(ll n, ll m) {
	vector<vector<vector<ll>>> v(n);
	for (ll i = 0; i < m; i++) {
		ll a, b, x, y;
		cin >> a >> b >> x >> y;
		a--; b--;
		v[a].push_back({b, x, y});
		v[b].push_back({a, -x, -y});
	}
	return v;
}

void solve () {
	vector<ll> ans;
	ll n, m;
	cin >> n >> m;
	vector<vector<vector<ll>>> v = read_input(n, m);
	vector<vector<ll>> pos(n);
	pos[0].push_back(0);
	pos[0].push_back(0);

	queue<ll> q;
	q.push(0);
	// for (ll i = 0; i < n; i++) {
	while (!q.empty()) {
		ll i = q.front();
		q.pop();
		ll len = v[i].size();
		for (ll j = 0; j < len; j++) {
			ll b = v[i][j][0];
			ll x = v[i][j][1];
			ll y = v[i][j][2];
			if (pos[b].size() < 2) {
				// pos[b] = {pos[i][0] + x, pos[i][1] + y};
				pos[b].push_back(pos[i][0] + x);
				pos[b].push_back(pos[i][1] + y);
				q.push(b);
			} else if (pos[b].size() == 2) {
				if ((pos[b][0] != pos[i][0] + x) || (pos[b][1] != pos[i][1] + y)) {
					pos[b].push_back(0);
				}
			}


		}
	}
	
	for (auto p: pos) {
		if (p.size() == 2) {
			cout << p[0] << " " << p[1] << endl;
		} else {
			cout << "undecidable" << endl;
		}
	}
	
}

int main (void) 
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	solve();
	
	return 0;
}

/* Lorenzo Fiorini */

提出情報

ジャッジ結果