#864571 (C) No.2301 Namorientation

• 問題: No.2301 Namorientation
• ユーザー: 👑 ygussany
• 提出日時: 2023-04-29 16:03:53
• 言語: C (gcc 12.3.0)
• 結果: AC
• 実行時間: 101 ms / 3,000 ms
• コード長: 1,104 bytes
• コンパイル時間: 159 ms
• コンパイル使用メモリ: 31,232 KB
• 実行使用メモリ: 12,800 KB
• 最終ジャッジ日時: 2024-04-29 09:15:12
• 合計ジャッジ時間: 10,291 ms
• ジャッジサーバーID （参考情報）: judge1 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	4 ms; 5,632 KB
testcase_01	AC	4 ms; 5,632 KB
testcase_02	AC	4 ms; 5,760 KB
testcase_03	AC	4 ms; 5,760 KB
testcase_04	AC	4 ms; 5,504 KB
testcase_05	AC	4 ms; 5,760 KB
testcase_06	AC	4 ms; 5,632 KB
testcase_07	AC	4 ms; 5,504 KB
testcase_08	AC	3 ms; 5,760 KB
testcase_09	AC	4 ms; 5,632 KB
testcase_10	AC	3 ms; 5,504 KB
testcase_11	AC	4 ms; 5,632 KB
testcase_12	AC	45 ms; 9,856 KB
testcase_13	AC	41 ms; 9,472 KB
testcase_14	AC	98 ms; 12,800 KB
testcase_15	AC	51 ms; 10,368 KB
testcase_16	AC	73 ms; 11,648 KB
testcase_17	AC	47 ms; 9,984 KB
testcase_18	AC	85 ms; 11,904 KB
testcase_19	AC	38 ms; 9,216 KB
testcase_20	AC	72 ms; 11,648 KB
testcase_21	AC	53 ms; 10,368 KB
testcase_22	AC	56 ms; 12,800 KB
testcase_23	AC	56 ms; 12,544 KB
testcase_24	AC	48 ms; 11,264 KB
testcase_25	AC	39 ms; 11,008 KB
testcase_26	AC	50 ms; 12,544 KB
testcase_27	AC	101 ms; 12,672 KB
testcase_28	AC	95 ms; 12,672 KB
testcase_29	AC	96 ms; 12,672 KB
testcase_30	AC	90 ms; 12,544 KB
testcase_31	AC	90 ms; 12,800 KB

ソースコード

#include <stdio.h>

typedef struct Edge {
	struct Edge *next;
	int v, id;
} edge;

int main()
{
	int i, N, u, w, deg[200001] = {};
	edge *adj[200001] = {}, e[400001], *p;
	scanf("%d", &N);
	for (i = 0; i < N; i++) {
		scanf("%d %d", &u, &w);
		e[i*2].v = w;
		e[i*2+1].v = u;
		e[i*2].id = i * 2;
		e[i*2+1].id = i * 2 + 1;
		e[i*2].next = adj[u];
		e[i*2+1].next = adj[w];
		adj[u] = &(e[i*2]);
		adj[w] = &(e[i*2+1]);
		deg[u]++;
		deg[w]++;
	}
	
	int ans[200001] = {}, q[200001], head = 0, tail = 0, x = 1, flag[200001] = {};
	for (u = 1; u <= N; u++) if (deg[u] == 1) q[tail++] = u;
	while (tail < N) {
		for (; head < tail; head++) {
			u = q[head];
			flag[u] = 1;
			for (p = adj[u]; p != NULL; p = p->next) if (ans[p->id / 2] == 0) break;
			if (p->id % 2 == 0) ans[p->id / 2] = 1;
			else ans[p->id / 2] = -1;
			w = p->v;
			if (flag[w] == 0) {
				deg[w]--;
				if (deg[w] == 1) q[tail++] = w;
			}
		}
		for (; x <= N && flag[x] != 0; x++);
		if (x <= N) q[tail++] = x;
	}
	
	for (i = 0; i < N; i++) {
		if (ans[i] == 1) printf("->\n");
		else printf("<-\n");
	}
	fflush(stdout);
	return 0;
}