제출 #1219768

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1219768		thelegendary08	Graph (BOI20_graph)	C++17	0 / 100	2 ms	2632 KiB

Graph

#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define pout(a) cout<<a.first<<' '<<a.second<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
const int mxn = 1e5 + 5;
vpii adj[mxn];

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	in2(n,m);
	f0r(i,m){
		in3(a,b,c); a--; b--;
		adj[a].pb(mp(b,c));
		adj[b].pb(mp(a,c));
	}
	
	vb vis(n);
	vpii val(n);
	vector<double> ans(n);
	bool okk = 1;
	f0r(i,n){
		if(!vis[i]){
			vi thing;
			val[i] = mp(1,0);
			queue<int>q; q.push(i); vis[i] = 1;
			thing.pb(i);
			while(!q.empty()){
				int node = q.front(); q.pop();
				for(auto u : adj[node]){
					if(vis[u.first])continue;
					vis[u.first] = 1;
					if(u.second == 1){
						val[u.first] = mp(-val[node].first, 1-val[node].second);
					}
					else{
						val[u.first] = mp(-val[node].first, 2-val[node].second);
					}
					q.push(u.first);
					thing.pb(u.first);
				}
			}
			bool ok = 1;
			double sus = 4e18;
			
			for(auto u : thing){
				for(auto x : adj[u]){
					double a = u; double b = x.first; double t = x.second;
					pii sum = mp(val[a].first + val[b].first, val[a].second + val[b].second);
					if(sum.first == 0){
						if(sum.second != t){
							ok = 0; break;
						}
					}
					else{
						double idk = (t-sum.second)/sum.first;
						// dout(idk);
						if(sus == 4e18){
							sus = idk;
						}
						else{
							if(idk != sus){
								// dout2(idk, sus);
								ok = 0;
							}
						}
					}
				}
				if(!ok)break;
				
			}
			if(!ok)okk = 0;
			vector<double>cand;
			if(sus == 4e18){
				mii cand;
				pii wow = mp(0,0);
				for(auto u : thing){
					if(val[u].first < 0){
						cand[val[u].second]++;
						wow.second += val[u].second;
					}
					else{
						cand[-val[u].second]++;
						wow.second -= val[u].second;
					} 
					wow.first--;
				}
				
				double mn = 4e18;
				double sussy = -1;
				for(auto cur : cand){
					// dout(cur.first);
					wow.first += 2 * cur.second;
					wow.second -= 2 * cur.first;
					
					double summ = wow.first * cur.first + wow.second;
					if(summ < mn){
						mn = summ;			
						sussy = cur.first;		
					}
					
				}
				for(auto u : thing){
					ans[u] = val[u].first * sussy + val[u].second;
				}
			}
			else{
				for(auto u : thing){
					ans[u] = val[u].first * sus + val[u].second;
				}
			}
			
		}
		if(!okk)break;
	}
	cout<<fixed<<setprecision(16);
	if(okk){
		out("YES");
		vout(ans);
	}
	else{
		out("NO");
	}
}

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