0_0_20988064_26300.cpp:9:26: error: stray '#' in program
const int maxn = 100000 + 10;
^
0_0_20988064_26300.cpp:10:26: error: stray '#' in program
const int maxm = 200000 + 10;
^
0_0_20988064_26300.cpp:11:29: error: stray '#' in program
const int mod = 1000000000 + 7;
^
0_0_20988064_26300.cpp:44:10: error: stray '#' in program
ecnt++;
^
0_0_20988064_26300.cpp:44:15: error: stray '#' in program
ecnt++;
^
0_0_20988064_26300.cpp:49:32: error: stray '#' in program
for(int i = 1; i < maxn; i++) pow26[i] = (long long)pow26[i-1] * 26 % mod;
^
0_0_20988064_26300.cpp:49:37: error: stray '#' in program
for(int i = 1; i < maxn; i++) pow26[i] = (long long)pow26[i-1] * 26 % mod;
^
0_0_20988064_26300.cpp:63:47: error: stray '#' in program
if(!ch[u][w[e]]) ch[u][w[e]] = sz++; //新增结点
^
0_0_20988064_26300.cpp:63:52: error: stray '#' in program
if(!ch[u][w[e]]) ch[u][w[e]] = sz++; //新增结点
^
0_0_20988064_26300.cpp:65:39: error: stray '#' in program
height[v[e]] = height[x] + 1; //求各结点的高度
^
0_0_20988064_26300.cpp:73:20: error: stray '#' in program
tripRank[x] = ++dfs_clock;
^
0_0_20988064_26300.cpp:73:25: error: stray '#' in program
tripRank[x] = ++dfs_clock;
^
0_0_20988064_26300.cpp:74:30: error: stray '#' in program
for(int c = 0; c < 26; c++) if(ch[x][c]) getTripRank(ch[x][c]);
^
0_0_20988064_26300.cpp:74:35: error: stray '#' in program
for(int c = 0; c < 26; c++) if(ch[x][c]) getTripRank(ch[x][c]);
^
0_0_20988064_26300.cpp:78:38: error: stray '#' in program
for(int i = 1; i <= maxHeight; i++) dep[i].clear(); //初始化dep[]
^
0_0_20988064_26300.cpp:78:43: error: stray '#' in program
for(int i = 1; i <= maxHeight; i++) dep[i].clear(); //初始化dep[]
^
0_0_20988064_26300.cpp:84:14: error: stray '#' in program
in[x] = ++dfs_clock; //编号
^
0_0_20988064_26300.cpp:84:19: error: stray '#' in program
in[x] = ++dfs_clock; //编号
^
0_0_20988064_26300.cpp:89:48: error: stray '#' in program
Hash[v[e]] = ((long long)Hash[x] * 26 + w[e]) % mod; //计算哈希值，这个别放dfs(v[e])下面，因为dfs(v[e])需要用到Hash[v[e]]
^
0_0_20988064_26300.cpp:91:43: error: stray '#' in program
tail[x] = max(tail[x], tail[v[e]]+1);
^
0_0_20988064_26300.cpp:100:38: error: stray '#' in program
for(int i = 1; i <= maxHeight; i++){
^
0_0_20988064_26300.cpp:100:43: error: stray '#' in program
for(int i = 1; i <= maxHeight; i++){
^
0_0_20988064_26300.cpp:102:34: error: stray '#' in program
for(int j = 0; j < sz; j++) a[cnt++] = dep[i][j];
^
0_0_20988064_26300.cpp:102:39: error: stray '#' in program
for(int j = 0; j < sz; j++) a[cnt++] = dep[i][j];
^
0_0_20988064_26300.cpp:102:51: error: stray '#' in program
for(int j = 0; j < sz; j++) a[cnt++] = dep[i][j];
^
0_0_20988064_26300.cpp:102:56: error: stray '#' in program
for(int j = 0; j < sz; j++) a[cnt++] = dep[i][j];
^
0_0_20988064_26300.cpp:103:40: error: stray '#' in program
depBefore[i] = depBefore[i-1] + sz;
^
0_0_20988064_26300.cpp:108:30: error: stray '#' in program
for(int i = 1; i <= N; i++) d[i][0] = a[i];
^
0_0_20988064_26300.cpp:108:35: error: stray '#' in program
for(int i = 1; i <= N; i++) d[i][0] = a[i];
^
0_0_20988064_26300.cpp:109:35: error: stray '#' in program
for(int j = 1; (1<<j) <= N; j++)
^
0_0_20988064_26300.cpp:109:40: error: stray '#' in program
for(int j = 1; (1<<j) <= N; j++)
^
0_0_20988064_26300.cpp:110:27: error: stray '#' in program
for(int i = 1; i + (1 << j) - 1 <= N; i++)
^
0_0_20988064_26300.cpp:110:53: error: stray '#' in program
for(int i = 1; i + (1 << j) - 1 <= N; i++)
^
0_0_20988064_26300.cpp:110:58: error: stray '#' in program
for(int i = 1; i + (1 << j) - 1 <= N; i++)
^
0_0_20988064_26300.cpp:111:43: error: stray '#' in program
if(Rank[d[i][j-1]] > Rank[d[i+(1<<(j-1))][j-1]]) d[i][j] = d[i][j-1]; //根据字典序名次来比较
^
0_0_20988064_26300.cpp:112:32: error: stray '#' in program
else d[i][j] = d[i+(1<<(j-1))][j-1];
^
0_0_20988064_26300.cpp:117:17: error: stray '#' in program
while(1<<(k+1) <= R - L + 1) k++;
^
0_0_20988064_26300.cpp:117:34: error: stray '#' in program
while(1<<(k+1) <= R - L + 1) k++;
^
0_0_20988064_26300.cpp:117:44: error: stray '#' in program
while(1<<(k+1) <= R - L + 1) k++;
^
0_0_20988064_26300.cpp:117:49: error: stray '#' in program
while(1<<(k+1) <= R - L + 1) k++;
^
0_0_20988064_26300.cpp:118:40: error: stray '#' in program
if(Rank[d[L][k]] > Rank[d[R-(1<<k)+1][k]]) return d[L][k];
^
0_0_20988064_26300.cpp:119:28: error: stray '#' in program
else return d[R-(1<<k)+1][k];
^
0_0_20988064_26300.cpp:126:29: error: stray '#' in program
for(int i = 1; i < N; i++){
^
0_0_20988064_26300.cpp:126:34: error: stray '#' in program
for(int i = 1; i < N; i++){
^
0_0_20988064_26300.cpp:140:24: error: stray '#' in program
int h = height[u] + m; //目标结点的深度
^
0_0_20988064_26300.cpp:141:81: error: stray '#' in program
int L = lower_bound(dep[h].begin(), dep[h].end(), u, cmp) - dep[h].begin() + 1 + depBefore[h-1];
^
0_0_20988064_26300.cpp:141:89: error: stray '#' in program
int L = lower_bound(dep[h].begin(), dep[h].end(), u, cmp) - dep[h].begin() + 1 + depBefore[h-1];
^
0_0_20988064_26300.cpp:142:91: error: stray '#' in program
int R = upper_bound(dep[h].begin(), dep[h].end(), maxChild[u], cmp) - dep[h].begin() + depBefore[h-1];
^
0_0_20988064_26300.cpp:163:97: error: stray '#' in program
if(des != -1) printf("%d\n", (int)(Hash[des] - (long long)Hash[u] * pow26[m] % mod + mod) % mod);
^
0_0_20988064_26300.cpp:9:31: error: expected unqualified-id before numeric constant
const int maxn = 100000 + 10;
^
0_0_20988064_26300.cpp:10:31: error: expected unqualified-id before numeric constant
const int maxm = 200000 + 10;
^
0_0_20988064_26300.cpp:11:34: error: expected unqualified-id before numeric constant
const int mod = 1000000000 + 7;
^
0_0_20988064_26300.cpp: In function 'void addEdge(int, int, int)':
0_0_20988064_26300.cpp:44:16: error: lvalue required as unary '&' operand
ecnt++;
^
0_0_20988064_26300.cpp: In function 'void getPow26()':
0_0_20988064_26300.cpp:49:35: error: expected ')' before ';' token
for(int i = 1; i < maxn; i++) pow26[i] = (long long)pow26[i-1] * 26 % mod;
^
0_0_20988064_26300.cpp:49:38: error: lvalue required as unary '&' operand
for(int i = 1; i < maxn; i++) pow26[i] = (long long)pow26[i-1] * 26 % mod;
^
0_0_20988064_26300.cpp:49:41: error: expected primary-expression before ')' token
for(int i = 1; i < maxn; i++) pow26[i] = (long long)pow26[i-1] * 26 % mod;
^
0_0_20988064_26300.cpp: In function 'void bfs()':
0_0_20988064_26300.cpp:63:53: error: lvalue required as unary '&' operand
if(!ch[u][w[e]]) ch[u][w[e]] = sz++; //新增结点
|
