QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #534758 | #4927. Bounded Spanning Tree | egypt_ioi2024b_04# | Compile Error | / | / | C++20 | 2.2kb | 2024-08-27 16:02:15 | 2024-08-27 16:02:16 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
详细
answer.code: In function ‘int findp(int)’:
answer.code:16:12: error: ‘p’ was not declared in this scope
16 | return p[u] = (p[u] == u ? u : findp(p[u]));
| ^
answer.code: In function ‘bool merge(int, int)’:
answer.code:22:9: error: ‘sz’ was not declared in this scope
22 | if (sz[u] < sz[v])swap(u, v);
| ^~
answer.code:23:5: error: ‘sz’ was not declared in this scope
23 | sz[u] += sz[v];
| ^~
answer.code:24:5: error: ‘p’ was not declared in this scope
24 | p[v] = u;
| ^
answer.code: In function ‘void init()’:
answer.code:30:9: error: ‘p’ was not declared in this scope
30 | p[i] = i;
| ^
answer.code:31:9: error: ‘sz’ was not declared in this scope
31 | sz[i] = 1;
| ^~