This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define pb push_back
#define mp make_pair
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
constexpr int N = (int)(1 << 21);
constexpr int md = (int)2e5 + 111;
constexpr int INF = (int)1e18 + 111;
mt19937 rnd(time(nullptr));
bool used[N];
int val[N];
vector<pair<int,int>> g[N];
bool can = true;
int S = 0;
constexpr int K = 20;
void dfs(int v){
if(!can)
return;
used[v] = 1;
set<int> st[3];
// cerr << "v = " << v << "\n";
for(auto&[to,w] : g[v]){
if(used[to]){
// cerr << "v,to = " << v << " " << to << ", val[to] = " << val[to] << "\n";
st[w].insert(val[to]);
continue;
}
}
if(st[1].size() > 1 || st[2].size() > 1){
can = false;
return;
}
if(!st[1].empty() && !st[2].empty() && *st[2].begin()-*st[1].begin() != 2){
can = false;
return;
}
if(st[1].empty() && st[2].empty()){
val[v] = S;
} else if(!st[1].empty()){
val[v] = K - *st[1].begin();
} else if(!st[2].empty()){
val[v] = 2*K - *st[2].begin();
}
// cerr << "v = " << v << ", val[v] = " << val[v] << "\n";
for(auto&[to,w] : g[v]){
if(!used[to])
dfs(to);
}
return;
}
void solve(){
int n,m;
cin >> n >> m;
for(int i = 0; i < m; i++){
int a,b,c;
cin >> a >> b >> c;
g[a].pb(mp(b,c));
g[b].pb(mp(a,c));
}
vector<int> smallestSum;
int mn = INF;
for(int j = -100; j <= 100; j++){
memset(used,0,sizeof used);
S = j;
can = true;
for(int i = 1; i <= n; i++){
if(!used[i])
dfs(i);
}
if(!can)
continue;
int sum = 0;
for(int i = 1; i <= n; i++){
sum += abs(val[i]);
}
if(sum < mn){
mn = sum;
smallestSum.clear();
for(int i = 1; i <= n; i++){
smallestSum.pb(val[i]);
}
}
// cout << "YES\n";
// for(int i = 1; i <= n; i++)
// cout << val[i]/2.0 << " ";
// return;
}
if(mn == INF){
cout << "NO\n";
return;
}
cout << "YES\n";
for(auto& x : smallestSum)
cout << 1.0*x/K << " ";
cout << "\n";
return;
}
signed main(){
ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
// init();
int tests = 1;
// cin >> tests;
for(int test = 1; test <= tests; test++){
// cerr << "test = " << test << "\n";
solve();
}
return 0;
}
/**
**/
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |