結果
問題 |
No.3093 Safe Infection
|
ユーザー |
👑 |
提出日時 | 2025-03-09 14:04:41 |
言語 | C (gcc 13.3.0) |
結果 |
AC
|
実行時間 | 96 ms / 2,000 ms |
コード長 | 3,611 bytes |
コンパイル時間 | 593 ms |
コンパイル使用メモリ | 29,688 KB |
実行使用メモリ | 19,072 KB |
最終ジャッジ日時 | 2025-03-09 14:04:47 |
合計ジャッジ時間 | 6,599 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 70 |
コンパイルメッセージ
main.c: In function ‘main’: main.c:134:9: warning: ignoring return value of ‘scanf’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 134 | scanf("%d %d %d", &N, &M, &K); | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.c:135:34: warning: ignoring return value of ‘scanf’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 135 | for (i = 1; i <= N; i++) scanf("%d", &(A[i])); | ^~~~~~~~~~~~~~~~~~~~ main.c:137:17: warning: ignoring return value of ‘scanf’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 137 | scanf("%d %d", &u, &w); | ^~~~~~~~~~~~~~~~~~~~~~
ソースコード
#include <stdio.h> #include <stdlib.h> typedef struct Edge { struct Edge *next; int v; } edge; typedef struct { int key, id; } data; void merge_sort(int n, data x[]) { static data y[100001] = {}; if (n <= 1) return; merge_sort(n / 2, &(x[0])); merge_sort((n + 1) / 2, &(x[n/2])); int i, p, q; for (i = 0, p = 0, q = n / 2; i < n; i++) { if (p >= n / 2) y[i] = x[q++]; else if (q >= n) y[i] = x[p++]; else y[i] = (x[p].key < x[q].key)? x[p++]: x[q++]; } for (i = 0; i < n; i++) x[i] = y[i]; } typedef struct { data *obj; int size, max_size; } min_heap; void init_min_heap(min_heap* h, int s) { h->max_size = s; h->size = 0; h->obj = (data*)malloc(sizeof(data) * (h->max_size + 1)); } void push(min_heap* h, data x) { int i = ++(h->size), j = i >> 1; data tmp; if (h->size > h->max_size) { h->max_size <<= 1; h->obj = (data*)realloc(h->obj, sizeof(data) * (h->max_size + 1)); } h->obj[i] = x; while (j > 0) { if (h->obj[i].key < h->obj[j].key) { tmp = h->obj[j]; h->obj[j] = h->obj[i]; h->obj[i] = tmp; i = j; j >>= 1; } else break; } } data pop(min_heap* h) { int i = 1, j = 2; data output = h->obj[1], tmp; h->obj[1] = h->obj[(h->size)--]; while (j <= h->size) { if (j < h->size && h->obj[j^1].key < h->obj[j].key) j ^= 1; if (h->obj[j].key < h->obj[i].key) { tmp = h->obj[j]; h->obj[j] = h->obj[i]; h->obj[i] = tmp; i = j; j <<= 1; } else break; } return output; } void merge_min_heap(min_heap* h, min_heap* hh) { int i; if (h->size >= hh->size) { for (i = 1; i <= hh->size; i++) push(h, hh->obj[i]); free(hh->obj); } else { for (i = 1; i <= h->size; i++) push(hh, h->obj[i]); free(h->obj); *h = *hh; } } typedef struct { int *par, *size; } UF_forest; void UF_init(UF_forest *F, int n) { int i; F->par = (int*)malloc(sizeof(int) * (n + 1)); F->size = (int*)malloc(sizeof(int) * (n + 1)); for (i = 1; i <= n; i++) { F->par[i] = i; F->size[i] = 1; } } int UF_root(UF_forest *F, int v) { if (F->par[v] == v) return v; else { F->par[v] = UF_root(F, F->par[v]); return F->par[v]; } } void UF_merge(UF_forest *F, int u, int v) { u = UF_root(F, u); v = UF_root(F, v); if (u == v) return; else if (F->size[u] > F->size[v]) { F->par[v] = u; F->size[u] += F->size[v]; } else { F->par[u] = v; F->size[v] += F->size[u]; } } int main() { int i, N, M, K, A[100001], u, w; edge *adj[100001] = {}, e[200001], *p, *pp; scanf("%d %d %d", &N, &M, &K); for (i = 1; i <= N; i++) scanf("%d", &(A[i])); for (i = 0; i < M; i++) { scanf("%d %d", &u, &w); e[i*2].v = w; e[i*2].next = adj[u]; adj[u] = &(e[i*2]); e[i*2+1].v = u; e[i*2+1].next = adj[w]; adj[w] = &(e[i*2+1]); } data d[100001]; for (i = 1; i <= N; i++) { d[i-1].key = A[i]; d[i-1].id = i; } merge_sort(N, d); min_heap h[100001]; data dd; for (u = 1; u <= N; u++) { init_min_heap(&(h[u]), 10); for (p = adj[u]; p != NULL; p = p->next) { dd.key = A[p->v]; dd.id = p->v; push(&(h[u]), dd); } } int x; UF_forest F; UF_init(&F, N); for (i = 0; i < N; i++) { u = UF_root(&F, d[i].id); while (h[u].size > 0) { dd = pop(&(h[u])); w = UF_root(&F, dd.id); if (w != u && A[w] >= A[u] && A[w] <= A[u] + K) { UF_merge(&F, u, w); x = UF_root(&F, u); if (x == w) { u ^= w; w ^= u; u ^= w; } if (A[u] < A[w]) A[u] = A[w]; merge_min_heap(&(h[u]), &(h[w])); break; } } } for (u = 1; u <= N; u++) if (UF_root(&F, u) == u && A[u] != d[N-1].key) break; if (u > N) printf("Yes\n"); else printf("No\n"); fflush(stdout); return 0; }