oj.uz

답안 #1030619

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1030619 2024-07-22T07:41:16 Z sleepntsheep Graph (BOI20_graph) C
0 / 100
 1 ms 2396 KB 
#include<stdio.h>
#include<stdlib.h>
int C(const void*a,const void*b){
    double x=*(const double*)a-*(const double*)b;
    return x<0?-1:(x>0?1:0);
}
#define N 100002
#define M 400001
double a(double x){return x<0?-x:x;}
int n,m,head[N],fr[M],to[M],nxt[M],col[M],ii,vis[N],aa[N],bb[N],grp[N],got[N],eo[N<<1];
double *eh[N<<1];
void push(int i,double j){
    int o=eo[i]++;
    if(!o)eh[i]=(double*)malloc(2*sizeof**eh);
    else if(!(o&o-1))eh[i]=(double*)realloc(eh[i],2*o*sizeof**eh);
    eh[i][o]=j;
}
double xx[N];

void link(int u,int v,int c){
    int i=++ii;
    to[i]=v;
    fr[i]=u;
    col[i]=c;
    nxt[i]=head[u];
    head[u]=i;
}

void dfs(int u,int a,int b,int cp){
    if(vis[u]){
        if(a==aa[u]&&b!=bb[u]) exit(puts("NO")*0);
        return;
    }
    grp[u]=cp;
    push(cp+N,u);
    push(cp,1.0f*b/a);
    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,cp);
}

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);
    for(int i=1;i<=n;++i)
        if(!vis[i])
            dfs(i,1,0,i);

    for(int j=1;j<ii;++j){
        double a1=aa[fr[j]]+aa[to[j]],b1=bb[fr[j]]+bb[to[j]];
        if(a1==0&&b1!=col[j])exit(puts("NO")*0);
    }

    for(int i=1;i<=n;++i){
        if(got[grp[i]])continue;
        double l=-1e5,r=1e5;
        int sz=eo[grp[i]+N];
        qsort(eh[grp[i]],eo[grp[i]],sizeof**eh,C);
        xx[grp[i]]=eh[grp[i]][(eo[grp[i]]+1)/2];
        got[grp[i]]=1;
    }

    puts("YES");
    for(int i=1;i<=n;++i) printf("%.3f ",aa[i]*xx[grp[i]]+bb[i]);
}

Compilation message

Graph.c: In function 'push':
Graph.c:15:18: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   15 |     else if(!(o&o-1))eh[i]=(double*)realloc(eh[i],2*o*sizeof**eh);
      |                 ~^~
Graph.c: In function 'main':
Graph.c:57:13: warning: unused variable 'sz' [-Wunused-variable]
   57 |         int sz=eo[grp[i]+N];
      |             ^~
Graph.c:56:23: warning: unused variable 'r' [-Wunused-variable]
   56 |         double l=-1e5,r=1e5;
      |                       ^
Graph.c:56:16: warning: unused variable 'l' [-Wunused-variable]
   56 |         double l=-1e5,r=1e5;
      |                ^
Graph.c:43:5: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |     scanf("%d%d",&n,&m);
      |     ^~~~~~~~~~~~~~~~~~~
Graph.c:44:31: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |     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);
      |                               ^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2396 KB Sum of endpoints for edge (1; 2) differs from the expected value 1.
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2396 KB Sum of endpoints for edge (1; 2) differs from the expected value 1.
2 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2396 KB Sum of endpoints for edge (1; 2) differs from the expected value 1.
2 Halted 0 ms 0 KB -

Subtask #4
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2396 KB Sum of endpoints for edge (1; 2) differs from the expected value 1.
2 Halted 0 ms 0 KB -

Subtask #5
0 / 42.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 2396 KB Sum of endpoints for edge (1; 2) differs from the expected value 1.
2 Halted 0 ms 0 KB -