結果

問題 No.1612 I hate Construct a Palindrome
ユーザー 👑 ygussanyygussany
提出日時 2021-06-19 22:22:00
言語 C
(gcc 12.3.0)
結果
WA  
実行時間 -
コード長 2,904 bytes
コンパイル時間 1,312 ms
コンパイル使用メモリ 31,132 KB
実行使用メモリ 11,952 KB
最終ジャッジ日時 2023-09-24 14:33:12
合計ジャッジ時間 6,333 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,280 KB
testcase_01 AC 2 ms
5,028 KB
testcase_02 AC 61 ms
9,544 KB
testcase_03 AC 2 ms
6,332 KB
testcase_04 AC 2 ms
4,652 KB
testcase_05 AC 61 ms
9,672 KB
testcase_06 AC 46 ms
9,976 KB
testcase_07 WA -
testcase_08 AC 45 ms
9,632 KB
testcase_09 AC 43 ms
8,768 KB
testcase_10 AC 43 ms
8,748 KB
testcase_11 AC 44 ms
9,408 KB
testcase_12 AC 48 ms
9,556 KB
testcase_13 AC 48 ms
9,396 KB
testcase_14 AC 49 ms
8,868 KB
testcase_15 AC 96 ms
11,952 KB
testcase_16 AC 95 ms
11,864 KB
testcase_17 AC 102 ms
11,692 KB
testcase_18 AC 2 ms
4,804 KB
testcase_19 AC 2 ms
4,736 KB
testcase_20 AC 2 ms
4,784 KB
testcase_21 AC 3 ms
4,932 KB
testcase_22 AC 2 ms
4,836 KB
testcase_23 AC 3 ms
4,680 KB
testcase_24 AC 2 ms
4,644 KB
testcase_25 AC 2 ms
4,768 KB
testcase_26 WA -
testcase_27 AC 2 ms
4,780 KB
testcase_28 WA -
testcase_29 AC 1 ms
4,376 KB
testcase_30 AC 1 ms
4,620 KB
testcase_31 AC 2 ms
6,404 KB
testcase_32 WA -
testcase_33 WA -
testcase_34 AC 2 ms
6,228 KB
testcase_35 AC 2 ms
4,752 KB
testcase_36 AC 1 ms
4,376 KB
testcase_37 AC 2 ms
6,180 KB
testcase_38 AC 2 ms
4,664 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <stdio.h>

typedef struct List {
	struct List *next;
	int v, id;
} list;

int is_palindrome(char S[])
{
	int i, j;
	for (j = 0; S[j] != 0; j++);
	for (i = 0, j--; i < j; i++, j--) if (S[i] != S[j]) break;
	if (i < j) return 0;
	else return 1;
}

int solve(int N, int M, list* adj[], list e[], char c[], int ans[])
{
	int i;
	list *p;
	for (i = 2; i <= M; i++) if (c[i] != c[1]) break;
	if (i > M) return -1;
	
	int u, w, x = adj[1]->v, par[2][100001][2], dist[2][100001] = {}, q[100001], head, tail;
	dist[0][x] = 1;
	q[0] = x;
	for (head = 0, tail = 1; head < tail; head++) {
		u = q[head];
		for (p = adj[u]; p != NULL; p = p->next) {
			w = p->v;
			if (dist[0][w] == 0) {
				dist[0][w] = dist[0][u] + 1;
				par[0][w][0] = u;
				par[0][w][1] = p->id;
				q[tail++] = w;
			}
		}
	}
	dist[1][N] = 1;
	q[0] = N;
	for (head = 0, tail = 1; head < tail; head++) {
		u = q[head];
		for (p = adj[u]; p != NULL; p = p->next) {
			w = p->v;
			if (dist[1][w] == 0) {
				dist[1][w] = dist[1][u] + 1;
				par[1][w][0] = u;
				par[1][w][1] = p->id;
				q[tail++] = w;
			}
		}
	}
	
	int j, k = 0, y, z;
	char S[200001];
	for (j = 1, i = adj[1]->id; j <= M; j++) if (c[j] != c[i]) break;
	y = e[(j-1)*2].v;
	z = e[j*2-1].v;
	ans[k] = i;
	S[k++] = c[i];
	if (dist[0][y] <= dist[0][z]) {
		k += dist[0][y] - 1;
		for (i = k - 1, u = y; u != x; i--, u = par[0][u][0]) {
			ans[i] = par[0][u][1];
			S[i] = c[ans[i]];
		}

		if (dist[1][y] < dist[1][z]) {
			ans[k] = j;
			S[k++] = c[j];
			ans[k] = j;
			S[k++] = c[j];
			for (u = y; u != N; k++, u = par[1][u][0]) {
				ans[k] = par[1][u][1];
				S[k] = c[ans[i]];
			}
		} else {
			ans[k] = j;
			S[k++] = c[j];
			for (u = z; u != N; k++, u = par[1][u][0]) {
				ans[k] = par[1][u][1];
				S[k] = c[ans[i]];
			}
		}
	} else {
		k += dist[0][z] - 1;
		for (i = k - 1, u = z; u != x; i--, u = par[0][u][0]) {
			ans[i] = par[0][u][1];
			S[i] = c[ans[i]];
		}
		
		if (dist[1][y] > dist[1][z]) {
			ans[k] = j;
			S[k++] = c[j];
			ans[k] = j;
			S[k++] = c[j];
			for (u = z; u != N; k++, u = par[1][u][0]) {
				ans[k] = par[1][u][1];
				S[k] = c[ans[i]];
			}
		} else {
			ans[k] = j;
			S[k++] = c[j];
			for (u = z; u != N; k++, u = par[1][u][0]) {
				ans[k] = par[1][u][1];
				S[k] = c[ans[i]];
			}
		}
	}
	
	if (is_palindrome(S) == 0) return k;
	else {
		ans[k] = ans[k-1];
		ans[k+1] = ans[k];
		return k + 2;
	}
}

int main()
{
	int i, N, M, u, w;
	char c[200001];
	list *adj[100001] = {}, e[400001];
	scanf("%d %d", &N, &M);
	for (i = 0; i < M; i++) {
		scanf("%d %d %c ", &u, &w, &(c[i+1]));
		e[i*2].v = w;
		e[i*2+1].v = u;
		e[i*2].id = i + 1;
		e[i*2+1].id = i + 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]);
	}
	
	int ans[200001], k = solve(N, M, adj, e, c, ans);
	printf("%d\n", k);
	if (k >= 0) for (i = 0; i < k; i++) printf("%d\n", ans[i]);
	fflush(stdout);
	return 0;
}
0