제출 #1030623

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1030623		ttamx	Graph (BOI20_graph)	C++17	5 / 100	1 ms	600 KiB

Graph

#include<bits/stdc++.h>

using namespace std;

using db = long double;
using ll = long long;

const db EPS=1e-12;
const db INVPHI=(sqrt(db(5))-1)/2;

int main(){
    cin.tie(nullptr)->sync_with_stdio(false);
    int n,m;
    cin >> n >> m;
    vector<vector<pair<int,int>>> adj(n);
    for(int i=0;i<m;i++){
        int u,v,w;
        cin >> u >> v >> w;
        u--,v--;
        adj[u].emplace_back(v,w);
        adj[v].emplace_back(u,w);
    }
    vector<bool> vis(n);
    vector<ll> a(n),b(n);
    vector<int> comp;
    pair<ll,ll> val;
    bool found=false;
    function<void(int)> dfs=[&](int u){
        comp.emplace_back(u);
        vis[u]=true;
        for(auto [v,w]:adj[u]){
            if(!vis[v]){
                a[v]=-a[u];
                b[v]=w-b[u];
                dfs(v);
            }else{
                if(a[u]+a[v]==0){
                    if(b[u]+b[v]!=w){
                        cout << "NO",exit(0);
                    }
                }else{
                    ll num=w-b[u]-b[v];
                    ll den=a[u]+a[v];
                    if(!found){
                        found=true;
                        val={num,den};
                    }else if(num*val.second!=val.first*den){
                        cout << "NO",exit(0);
                    }
                }
            }
        }
    };
    vector<ll> ans(n);
    for(int i=0;i<n;i++)if(!vis[i]){
        comp.clear();
        found=false;
        a[i]=1,b[i]=0;
        dfs(i);
        auto calc=[&](db x){
            db res=0;
            for(auto u:comp){
                res+=abs(a[u]*x+b[u]*2);
            }
            return res;
        };
        auto answer=[&](ll x){
            for(auto u:comp){
                ans[u]=a[u]*x+b[u]*2;
            }
        };
        if(found){
            answer(val.first*2/val.second);
        }else{
            db m=comp.size();
            db l=-m*2,r=m*2;
            while(r-l>EPS){
                db s=(r-l)*INVPHI;
                db l2=r-s,r2=l+s;
                if(calc(l2)<calc(r2))r=r2;
                else l=l2;
            }
            answer((l+r)/2.0);
        }
    }
    cout << fixed << setprecision(10);
    cout << "YES\n";
    for(auto x:ans)cout << db(x)/2.0 << " ";
}

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