# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1030560 | sleepntsheep | Graph (BOI20_graph) | C11 | 0 ms | 348 KiB |
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<stdio.h>
#include<stdlib.h>
#define N 100001
#define M 400001
int a(int x){return x<0?-x:x;}
int n,m,head[N],to[M],nxt[M],col[M],ii,vis[N],aa[N],bb[N];
void link(int u,int v,int c){
int i=++ii;
to[i]=v;
col[i]=c;
nxt[i]=head[u];
head[u]=i;
}
void dfs(int u,int a,int b){
if(vis[u]){
if(a==aa[u]&&b!=bb[u])
exit(puts("NO"));
return;
}
vis[u]=1,aa[u]=a,bb[u]=b;
for(int j=head[u];j;j=nxt[j])
dfs(to[j],-a,col[j]-b);
}
int main(){
scanf("%d%d",&n,&m);
for(int u,v,c,i=0;i<m;++i)scanf("%d%d%d",&u,&v,&c),link(u,v,c),link(v,u,c);
dfs(1,1,0);
double min=1e18,argmin=424242;
for(double f=-10000;f<=10000;f+=0.5){
double sum=0;
for(int i=1;i<=n;++i)sum+=a(aa[i]*f+bb[i]);
if(min>sum) min=sum,argmin=f;
}
puts("YES");
for(int i=1;i<=n;++i) printf("%.3f ",aa[i]*argmin+bb[i]);
}
Compilation message (stderr)
# | 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... |