F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

View Compilation Error

0_0_30928104_24061\Main.java:1: ´íÎó: ·Ç·¨×Ö·û: '#'
#include<stdio.h>
^
0_0_30928104_24061\Main.java:1: ´íÎó: ÐèÒªclass, interface»òenum
#include<stdio.h>
        ^
0_0_30928104_24061\Main.java:2: ´íÎó: ·Ç·¨×Ö·û: '#'
#include<string.h>
^
0_0_30928104_24061\Main.java:3: ´íÎó: ·Ç·¨×Ö·û: '#'
#include<algorithm>
^
0_0_30928104_24061\Main.java:4: ´íÎó: ·Ç·¨×Ö·û: '#'
#include<math.h>
^
0_0_30928104_24061\Main.java:6: ´íÎó: ÐèÒªclass, interface»òenum
const int maxn = 50002;
^
0_0_30928104_24061\Main.java:7: ´íÎó: ÐèÒªclass, interface»òenum
int size[maxn];
^
0_0_30928104_24061\Main.java:8: ´íÎó: ÐèÒªclass, interface»òenum
int in[maxn];
^
0_0_30928104_24061\Main.java:9: ´íÎó: ÐèÒªclass, interface»òenum
int out[maxn];
^
0_0_30928104_24061\Main.java:10: ´íÎó: ÐèÒªclass, interface»òenum
int son[maxn];
^
0_0_30928104_24061\Main.java:11: ´íÎó: ÐèÒªclass, interface»òenum
int fa[maxn];
^
0_0_30928104_24061\Main.java:12: ´íÎó: ÐèÒªclass, interface»òenum
int top[maxn];
^
0_0_30928104_24061\Main.java:13: ´íÎó: ÐèÒªclass, interface»òenum
int depth[maxn];
^
0_0_30928104_24061\Main.java:14: ´íÎó: ÐèÒªclass, interface»òenum
int tree[maxn*4];
^
0_0_30928104_24061\Main.java:15: ´íÎó: ÐèÒªclass, interface»òenum
int pp[maxn];
^
0_0_30928104_24061\Main.java:16: ´íÎó: ÐèÒªclass, interface»òenum
int head[maxn];
^
0_0_30928104_24061\Main.java:17: ´íÎó: ÐèÒªclass, interface»òenum
int lazy[maxn*4];
^
0_0_30928104_24061\Main.java:18: ´íÎó: ÐèÒªclass, interface»òenum
int tot;
^
0_0_30928104_24061\Main.java:19: ´íÎó: ÐèÒªclass, interface»òenum
int m,n,r,p;
^
0_0_30928104_24061\Main.java:20: ´íÎó: ÐèÒªclass, interface»òenum
int mod,len;
^
0_0_30928104_24061\Main.java:21: ´íÎó: ÐèÒªclass, interface»òenum
int from,to;
^
0_0_30928104_24061\Main.java:22: ´íÎó: ÐèÒªclass, interface»òenum
struct node
^
0_0_30928104_24061\Main.java:25: ´íÎó: ÐèÒªclass, interface»òenum
    int to;
    ^
0_0_30928104_24061\Main.java:26: ´íÎó: ÐèÒªclass, interface»òenum
}G[maxn*2];
^
0_0_30928104_24061\Main.java:27: ´íÎó: ÐèÒªclass, interface»òenum
void add1(int from, int to)
^
0_0_30928104_24061\Main.java:30: ´íÎó: ÐèÒªclass, interface»òenum
    G[len].nextt=head[from];
    ^
0_0_30928104_24061\Main.java:31: ´íÎó: ÐèÒªclass, interface»òenum
    head[from]=len++;
    ^
0_0_30928104_24061\Main.java:32: ´íÎó: ÐèÒªclass, interface»òenum
}
^
0_0_30928104_24061\Main.java:36: ´íÎó: ÐèÒªclass, interface»òenum
}
^
0_0_30928104_24061\Main.java:40: ´íÎó: ÐèÒªclass, interface»òenum
    tree[2*p]+=(mid-left+1)*lazy[p];
    ^
0_0_30928104_24061\Main.java:41: ´íÎó: ÐèÒªclass, interface»òenum
    tree[2*p+1]+=(right-mid)*(lazy[p]);
    ^
0_0_30928104_24061\Main.java:42: ´íÎó: ÐèÒªclass, interface»òenum
    lazy[2*p]+=lazy[p];
    ^
0_0_30928104_24061\Main.java:43: ´íÎó: ÐèÒªclass, interface»òenum
    lazy[2*p+1]+=lazy[p];
    ^
0_0_30928104_24061\Main.java:44: ´íÎó: ÐèÒªclass, interface»òenum
    lazy[p]=0;
    ^
0_0_30928104_24061\Main.java:45: ´íÎó: ÐèÒªclass, interface»òenum
}
^
0_0_30928104_24061\Main.java:49: ´íÎó: ÐèÒªclass, interface»òenum
    if(left==right)
    ^
0_0_30928104_24061\Main.java:52: ´íÎó: ÐèÒªclass, interface»òenum
        return ;
        ^
0_0_30928104_24061\Main.java:53: ´íÎó: ÐèÒªclass, interface»òenum
    }
    ^
0_0_30928104_24061\Main.java:55: ´íÎó: ÐèÒªclass, interface»òenum
    build(2*p,left,mid);
    ^
0_0_30928104_24061\Main.java:56: ´íÎó: ÐèÒªclass, interface»òenum
    build(2*p+1,mid+1,right);
    ^
0_0_30928104_24061\Main.java:57: ´íÎó: ÐèÒªclass, interface»òenum
    up(p);
    ^
0_0_30928104_24061\Main.java:58: ´íÎó: ÐèÒªclass, interface»òenum
}
^
0_0_30928104_24061\Main.java:63: ´íÎó: ÐèÒªclass, interface»òenum
    down(p,left,right);
    ^
0_0_30928104_24061\Main.java:64: ´íÎó: ÐèÒªclass, interface»òenum
    int mid=(left+right)/2;
    ^
0_0_30928104_24061\Main.java:65: ´íÎó: ÐèÒªclass, interface»òenum
    int ans=0;
    ^
0_0_30928104_24061\Main.java:66: ´íÎó: ÐèÒªclass, interface»òenum
    if(l<=mid)
    ^
0_0_30928104_24061\Main.java:68: ´íÎó: ÐèÒªclass, interface»òenum
    if(r>mid)
    ^
0_0_30928104_24061\Main.java:70: ´íÎó: ÐèÒªclass, interface»òenum
    return ans;
    ^
0_0_30928104_24061\Main.java:71: ´íÎó: ÐèÒªclass, interface»òenum
}
^
0_0_30928104_24061\Main.java:77: ´íÎó: ÐèÒªclass, interface»òenum
        lazy[p]+=num;
        ^
0_0_30928104_24061\Main.java:78: ´íÎó: ÐèÒªclass, interface»òenum
        return ;
        ^
0_0_30928104_24061\Main.java:79: ´íÎó: ÐèÒªclass, interface»òenum
    }
    ^
0_0_30928104_24061\Main.java:81: ´íÎó: ÐèÒªclass, interface»òenum
    int mid=(left+right)/2;
    ^
0_0_30928104_24061\Main.java:82: ´íÎó: ÐèÒªclass, interface»òenum
    if(l<=mid)
    ^
0_0_30928104_24061\Main.java:84: ´íÎó: ÐèÒªclass, interface»òenum
    if(r>mid)
    ^
0_0_30928104_24061\Main.java:86: ´íÎó: ÐèÒªclass, interface»òenum
    up(p);
    ^
0_0_30928104_24061\Main.java:87: ´íÎó: ÐèÒªclass, interface»òenum
}
^
0_0_30928104_24061\Main.java:91: ´íÎó: ÐèÒªclass, interface»òenum
    depth[s]=de;
    ^
0_0_30928104_24061\Main.java:92: ´íÎó: ÐèÒªclass, interface»òenum
    size[s]=1;
    ^
0_0_30928104_24061\Main.java:93: ´íÎó: ÐèÒªclass, interface»òenum
    for(int i=head[s]; i!=-1; i=G[i].nextt)
    ^
0_0_30928104_24061\Main.java:93: ´íÎó: ÐèÒªclass, interface»òenum
    for(int i=head[s]; i!=-1; i=G[i].nextt)
                       ^
0_0_30928104_24061\Main.java:93: ´íÎó: ÐèÒªclass, interface»òenum
    for(int i=head[s]; i!=-1; i=G[i].nextt)
                              ^
0_0_30928104_24061\Main.java:96: ´íÎó: ÐèÒªclass, interface»òenum
        if(fa[s]==ppp)
        ^
0_0_30928104_24061\Main.java:98: ´íÎó: ÐèÒªclass, interface»òenum
        DFS1(ppp,s,de+1);
        ^
0_0_30928104_24061\Main.java:99: ´íÎó: ÐèÒªclass, interface»òenum
        size[s]+=size[ppp];
        ^
0_0_30928104_24061\Main.java:100: ´íÎó: ÐèÒªclass, interface»òenum
        if(size[son[s]]<size[ppp])
        ^
0_0_30928104_24061\Main.java:102: ´íÎó: ÐèÒªclass, interface»òenum
    }
    ^
0_0_30928104_24061\Main.java:107: ´íÎó: ÐèÒªclass, interface»òenum
    in[point]=++tot;
    ^
0_0_30928104_24061\Main.java:108: ´íÎó: ÐèÒªclass, interface»òenum
    out[tot]=pp[point];
    ^
0_0_30928104_24061\Main.java:109: ´íÎó: ÐèÒªclass, interface»òenum
    if(!son[point])
    ^
0_0_30928104_24061\Main.java:111: ´íÎó: ÐèÒªclass, interface»òenum
    DFS2(son[point],grandfather);
    ^
0_0_30928104_24061\Main.java:112: ´íÎó: ÐèÒªclass, interface»òenum
    for(int i=head[point]; i!=-1; i=G[i].nextt)
    ^
0_0_30928104_24061\Main.java:112: ´íÎó: ÐèÒªclass, interface»òenum
    for(int i=head[point]; i!=-1; i=G[i].nextt)
                           ^
0_0_30928104_24061\Main.java:112: ´íÎó: ÐèÒªclass, interface»òenum
    for(int i=head[point]; i!=-1; i=G[i].nextt)
                                  ^
0_0_30928104_24061\Main.java:115: ´íÎó: ÐèÒªclass, interface»òenum
        if(t!=son[point]&&t!=fa[point])
        ^
0_0_30928104_24061\Main.java:117: ´íÎó: ÐèÒªclass, interface»òenum
    }
    ^
0_0_30928104_24061\Main.java:122: ´íÎó: ÐèÒªclass, interface»òenum
    ans+=query(1,1,n,in[y],in[x]);
    ^
0_0_30928104_24061\Main.java:123: ´íÎó: ÐèÒªclass, interface»òenum
    return ans;
    ^
0_0_30928104_24061\Main.java:124: ´íÎó: ÐèÒªclass, interface»òenum
}
^
0_0_30928104_24061\Main.java:131: ´íÎó: ÐèÒªclass, interface»òenum
        add(1,1,n,in[top[x]],in[x],num);
        ^
0_0_30928104_24061\Main.java:132: ´íÎó: ÐèÒªclass, interface»òenum
        x=fa[top[x]];
        ^
0_0_30928104_24061\Main.java:133: ´íÎó: ÐèÒªclass, interface»òenum
    }
    ^
0_0_30928104_24061\Main.java:136: ´íÎó: ÐèÒªclass, interface»òenum
    add(1,1,n,in[y],in[x],num);
    ^
0_0_30928104_24061\Main.java:137: ´íÎó: ÐèÒªclass, interface»òenum
}
^
0_0_30928104_24061\Main.java:143: ´íÎó: ÐèÒªclass, interface»òenum
        memset(head,-1,sizeof(head));
        ^
0_0_30928104_24061\Main.java:144: ´íÎó: ÐèÒªclass, interface»òenum
        memset(size,0,sizeof(size));
        ^
0_0_30928104_24061\Main.java:145: ´íÎó: ÐèÒªclass, interface»òenum
        for(int i=1; i<=n; i++)
        ^
0_0_30928104_24061\Main.java:145: ´íÎó: ÐèÒªclass, interface»òenum
        for(int i=1; i<=n; i++)
                     ^
0_0_30928104_24061\Main.java:145: ´íÎó: ÐèÒªclass, interface»òenum
        for(int i=1; i<=n; i++)
                           ^
0_0_30928104_24061\Main.java:147: ´íÎó: ÐèÒªclass, interface»òenum
        len=0;
        ^
0_0_30928104_24061\Main.java:148: ´íÎó: ÐèÒªclass, interface»òenum
        for(int i=1; i<=m; i++)
        ^
0_0_30928104_24061\Main.java:148: ´íÎó: ÐèÒªclass, interface»òenum
        for(int i=1; i<=m; i++)
                     ^
0_0_30928104_24061\Main.java:148: ´íÎó: ÐèÒªclass, interface»òenum
        for(int i=1; i<=m; i++)
                           ^
0_0_30928104_24061\Main.java:151: ´íÎó: ÐèÒªclass, interface»òenum
            add1(from,to);
            ^
0_0_30928104_24061\Main.java:152: ´íÎó: ÐèÒªclass, interface»òenum
            add1(to,from);
            ^
0_0_30928104_24061\Main.java:153: ´íÎó: ÐèÒªclass, interface»òenum
        }
        ^
0_0_30928104_24061\Main.java:155: ´íÎó: ÐèÒªclass, interface»òenum
        DFS2(1,1);
        ^
0_0_30928104_24061\Main.java:156: ´íÎ


Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-11-26 02:22:33, Gzip enabled