Skip to content

feat: add c solution to lc problem: No.3559 #5255

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
vremyavnikuda wants to merge 6 commits into
base: main
Choose a base branch
from
Open

feat: add c solution to lc problem: No.3559 #5255

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
6 commits
Select commit Hold shift + click to select a range
8747b77
feat: add c solution to lc problem: No.3753
vremyavnikuda Jun 9, 2026
4f22017
Merge branch 'doocs:main' into main
vremyavnikuda Jun 9, 2026
bfd92e4
Merge branch 'doocs:main' into main
vremyavnikuda Jun 11, 2026
a52b97e
feat: add c solution to lc problem: No.3559
vremyavnikuda Jun 12, 2026
943a1c2
Merge branch 'main' into main
vremyavnikuda Jun 15, 2026
5efff28
Merge branch 'main' into main
vremyavnikuda Jun 16, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
114 changes: 114 additions & 0 deletions solution/3500-3599/3559.Number of Ways to Assign Edge Weights II/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -123,6 +123,120 @@ tags:

```

#### C

```c
#define MOD 1000000007
#define LOG 17
#define UP(k, v) up[(k) * (n + 1) + (v)]

int *assignEdgeWeights(int **edges, int edgesSize, int *edgesColSize,
int **queries, int queriesSize, int *queriesColSize,
int *returnSize) {
int n = edgesSize + 1;
int adjSize, i, j, k, u, v, lca, dist, tmp;
int *deg = calloc(n + 1, sizeof(int));
int *head;
int *adj;
int *depth;
int *up;
int *pow2;
int *stack;
int top;
int *ans;

for (i = 0; i < edgesSize; i++) {
deg[edges[i][0]]++;
deg[edges[i][1]]++;
}

head = malloc((n + 2) * sizeof(int));
head[0] = 0;
for (i = 1; i <= n + 1; i++)
head[i] = head[i - 1] + deg[i - 1];

adj = malloc((adjSize = head[n + 1]) * sizeof(int));
for (i = 0; i <= n; i++)
deg[i] = head[i];
for (i = 0; i < edgesSize; i++) {
u = edges[i][0];
v = edges[i][1];
adj[deg[u]++] = v;
adj[deg[v]++] = u;
}
free(deg);

depth = calloc(n + 2, sizeof(int));
depth[0] = -1;
depth[1] = 0;

up = calloc(LOG * (n + 1), sizeof(int));

pow2 = malloc((n + 1) * sizeof(int));
pow2[0] = 1;
for (i = 1; i <= n; i++)
pow2[i] = (pow2[i - 1] << 1) % MOD;

stack = malloc(n * sizeof(int));
stack[top = 0] = 1;
top++;
while (top) {
u = stack[--top];
for (j = head[u]; j < head[u + 1]; j++) {
v = adj[j];
if (v != UP(0, u)) {
UP(0, v) = u;
depth[v] = depth[u] + 1;
stack[top++] = v;
}
}
}
free(stack);
free(head);
free(adj);

for (k = 1; k < LOG; k++)
for (v = 1; v <= n; v++)
if ((tmp = UP(k - 1, v)) != 0)
UP(k, v) = UP(k - 1, tmp);

ans = malloc(queriesSize * sizeof(int));
for (i = 0; i < queriesSize; i++) {
u = queries[i][0];
v = queries[i][1];
if (u == v) {
ans[i] = 0;
continue;
}
if (depth[u] < depth[v]) {
tmp = u;
u = v;
v = tmp;
}
for (k = LOG - 1; k >= 0; k--)
if (depth[UP(k, u)] >= depth[v])
u = UP(k, u);
if (u != v) {
for (k = LOG - 1; k >= 0; k--)
if (UP(k, u) != UP(k, v)) {
u = UP(k, u);
v = UP(k, v);
}
lca = UP(0, u);
} else {
lca = u;
}
dist = depth[queries[i][0]] + depth[queries[i][1]] - 2 * depth[lca];
ans[i] = pow2[dist - 1];
}
free(depth);
free(up);
free(pow2);
*returnSize = queriesSize;
return ans;
}
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down
114 changes: 114 additions & 0 deletions solution/3500-3599/3559.Number of Ways to Assign Edge Weights II/README_EN.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -120,6 +120,120 @@ tags:

```

#### C

```c
#define MOD 1000000007
#define LOG 17
#define UP(k, v) up[(k) * (n + 1) + (v)]

int *assignEdgeWeights(int **edges, int edgesSize, int *edgesColSize,
int **queries, int queriesSize, int *queriesColSize,
int *returnSize) {
int n = edgesSize + 1;
int adjSize, i, j, k, u, v, lca, dist, tmp;
int *deg = calloc(n + 1, sizeof(int));
int *head;
int *adj;
int *depth;
int *up;
int *pow2;
int *stack;
int top;
int *ans;

for (i = 0; i < edgesSize; i++) {
deg[edges[i][0]]++;
deg[edges[i][1]]++;
}

head = malloc((n + 2) * sizeof(int));
head[0] = 0;
for (i = 1; i <= n + 1; i++)
head[i] = head[i - 1] + deg[i - 1];

adj = malloc((adjSize = head[n + 1]) * sizeof(int));
for (i = 0; i <= n; i++)
deg[i] = head[i];
for (i = 0; i < edgesSize; i++) {
u = edges[i][0];
v = edges[i][1];
adj[deg[u]++] = v;
adj[deg[v]++] = u;
}
free(deg);

depth = calloc(n + 2, sizeof(int));
depth[0] = -1;
depth[1] = 0;

up = calloc(LOG * (n + 1), sizeof(int));

pow2 = malloc((n + 1) * sizeof(int));
pow2[0] = 1;
for (i = 1; i <= n; i++)
pow2[i] = (pow2[i - 1] << 1) % MOD;

stack = malloc(n * sizeof(int));
stack[top = 0] = 1;
top++;
while (top) {
u = stack[--top];
for (j = head[u]; j < head[u + 1]; j++) {
v = adj[j];
if (v != UP(0, u)) {
UP(0, v) = u;
depth[v] = depth[u] + 1;
stack[top++] = v;
}
}
}
free(stack);
free(head);
free(adj);

for (k = 1; k < LOG; k++)
for (v = 1; v <= n; v++)
if ((tmp = UP(k - 1, v)) != 0)
UP(k, v) = UP(k - 1, tmp);

ans = malloc(queriesSize * sizeof(int));
for (i = 0; i < queriesSize; i++) {
u = queries[i][0];
v = queries[i][1];
if (u == v) {
ans[i] = 0;
continue;
}
if (depth[u] < depth[v]) {
tmp = u;
u = v;
v = tmp;
}
for (k = LOG - 1; k >= 0; k--)
if (depth[UP(k, u)] >= depth[v])
u = UP(k, u);
if (u != v) {
for (k = LOG - 1; k >= 0; k--)
if (UP(k, u) != UP(k, v)) {
u = UP(k, u);
v = UP(k, v);
}
lca = UP(0, u);
} else {
lca = u;
}
dist = depth[queries[i][0]] + depth[queries[i][1]] - 2 * depth[lca];
ans[i] = pow2[dist - 1];
}
free(depth);
free(up);
free(pow2);
*returnSize = queriesSize;
return ans;
}
```

<!-- tabs:end -->

<!-- solution:end -->
Expand Down
109 changes: 109 additions & 0 deletions solution/3500-3599/3559.Number of Ways to Assign Edge Weights II/Solution.c
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,109 @@
#define MOD 1000000007
#define LOG 17
#define UP(k, v) up[(k) * (n + 1) + (v)]

int* assignEdgeWeights(int** edges, int edgesSize, int* edgesColSize,
int** queries, int queriesSize, int* queriesColSize,
int* returnSize) {
int n = edgesSize + 1;
int adjSize, i, j, k, u, v, lca, dist, tmp;
int* deg = calloc(n + 1, sizeof(int));
int* head;
int* adj;
int* depth;
int* up;
int* pow2;
int* stack;
int top;
int* ans;

for (i = 0; i < edgesSize; i++) {
deg[edges[i][0]]++;
deg[edges[i][1]]++;
}

head = malloc((n + 2) * sizeof(int));
head[0] = 0;
for (i = 1; i <= n + 1; i++)
head[i] = head[i - 1] + deg[i - 1];

adj = malloc((adjSize = head[n + 1]) * sizeof(int));
for (i = 0; i <= n; i++)
deg[i] = head[i];
for (i = 0; i < edgesSize; i++) {
u = edges[i][0];
v = edges[i][1];
adj[deg[u]++] = v;
adj[deg[v]++] = u;
}
free(deg);

depth = calloc(n + 2, sizeof(int));
depth[0] = -1;
depth[1] = 0;

up = calloc(LOG * (n + 1), sizeof(int));

pow2 = malloc((n + 1) * sizeof(int));
pow2[0] = 1;
for (i = 1; i <= n; i++)
pow2[i] = (pow2[i - 1] << 1) % MOD;

stack = malloc(n * sizeof(int));
stack[top = 0] = 1;
top++;
while (top) {
u = stack[--top];
for (j = head[u]; j < head[u + 1]; j++) {
v = adj[j];
if (v != UP(0, u)) {
UP(0, v) = u;
depth[v] = depth[u] + 1;
stack[top++] = v;
}
}
}
free(stack);
free(head);
free(adj);

for (k = 1; k < LOG; k++)
for (v = 1; v <= n; v++)
if ((tmp = UP(k - 1, v)) != 0)
UP(k, v) = UP(k - 1, tmp);

ans = malloc(queriesSize * sizeof(int));
for (i = 0; i < queriesSize; i++) {
u = queries[i][0];
v = queries[i][1];
if (u == v) {
ans[i] = 0;
continue;
}
if (depth[u] < depth[v]) {
tmp = u;
u = v;
v = tmp;
}
for (k = LOG - 1; k >= 0; k--)
if (depth[UP(k, u)] >= depth[v])
u = UP(k, u);
if (u != v) {
for (k = LOG - 1; k >= 0; k--)
if (UP(k, u) != UP(k, v)) {
u = UP(k, u);
v = UP(k, v);
}
lca = UP(0, u);
} else {
lca = u;
}
dist = depth[queries[i][0]] + depth[queries[i][1]] - 2 * depth[lca];
ans[i] = pow2[dist - 1];
}
free(depth);
free(up);
free(pow2);
*returnSize = queriesSize;
return ans;
}
Loading