# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1030566 | 2024-07-22T06:56:28 Z | sleepntsheep | Graph (BOI20_graph) | C | 1 ms | 344 KB |
#include<stdio.h> #include<stdlib.h> #define N 100001 #define M 400001 double a(double 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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Sum of endpoints for edge (1; 2) differs from the expected value 1. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Sum of endpoints for edge (1; 2) differs from the expected value 1. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Sum of endpoints for edge (1; 2) differs from the expected value 1. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Sum of endpoints for edge (1; 2) differs from the expected value 1. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Sum of endpoints for edge (1; 2) differs from the expected value 1. |
2 | Halted | 0 ms | 0 KB | - |