(cache)Submission #76553585 - Keysight Technologies Programming Contest（AtCoder Beginner Contest 454）

Contest Duration: 2026-04-18(Sat) 21:00 - 2026-04-18(Sat) 22:40 (local time) (100 minutes) Back to Home

Submission #76553585

Source Code Expand

Copy

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
#include <stdio.h>
#include <string.h>
char A[2123456];
char B[2123456];
char A2[2123456];
char B2[2123456];
void kakou(char* out, const char* in) {
  char* op = out;
  while (*in != '\0') {
    if (*in == ')' && out + 3 <= op && op[-3] == '(' && op[-2] == 'x' && op[-1] == 'x') {
      op[-3] = 'x';
      op[-2] = 'x';
      op--;
      in++;
    } else {
      *(op++) = *(in++);
    }
  }
  *op = '\0';
}
int main(void) {
  int T, tc;
  if (scanf("%d", &T) != 1) return 1;
  for (tc = 0; tc < T; tc++) {
    if (scanf("%2123455s", A) != 1) return 1;
    if (scanf("%2123455s", B) != 1) return 1;
    kakou(A2, A);
    kakou(B2, B);
    puts(strcmp(A2, B2) ? "No" : "Yes");
  }
  return 0;
}
/*
好きなだけ戻せるので、A, B ともに (xx) を潰せるだけ潰す → 一致判定
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <stdio.h>
#include <string.h>

char A[2123456];
char B[2123456];

char A2[2123456];
char B2[2123456];

void kakou(char* out, const char* in) {
	char* op = out;
	while (*in != '\0') {
		if (*in == ')' && out + 3 <= op && op[-3] == '(' && op[-2] == 'x' && op[-1] == 'x') {
			op[-3] = 'x';
			op[-2] = 'x';
			op--;
			in++;
		} else {
			*(op++) = *(in++);
		}
	}
	*op = '\0';
}

int main(void) {
	int T, tc;
	if (scanf("%d", &T) != 1) return 1;
	for (tc = 0; tc < T; tc++) {
		if (scanf("%2123455s", A) != 1) return 1;
		if (scanf("%2123455s", B) != 1) return 1;
		kakou(A2, A);
		kakou(B2, B);
		puts(strcmp(A2, B2) ? "No" : "Yes");
	}
	return 0;
}

/*

好きなだけ戻せるので、A, B ともに (xx) を潰せるだけ潰す → 一致判定

*/

Submission Info

Submission Time	2026-06-10 03:23:32
Task	D - (xx)
User	mikecat
Language	C23 (GCC 14.2.0)
Score	425
Code Size	805 Byte
Status	AC
Exec Time	36 ms
Memory	4656 KiB

Judge Result

Set Name

Sample

All

Score / Max Score

0 / 0

425 / 425

Status

× 1

× 37

Set Name	Test Cases
Sample	00_sample_00.txt
All	00_sample_00.txt, 01_small_00.txt, 01_small_01.txt, 01_small_02.txt, 01_small_03.txt, 01_small_04.txt, 01_small_05.txt, 01_small_06.txt, 02_medium_00.txt, 02_medium_01.txt, 02_medium_02.txt, 02_medium_03.txt, 02_medium_04.txt, 02_medium_05.txt, 02_medium_06.txt, 02_medium_07.txt, 02_medium_08.txt, 02_medium_09.txt, 02_medium_10.txt, 02_medium_11.txt, 02_medium_12.txt, 03_random_00.txt, 03_random_01.txt, 03_random_02.txt, 03_random_03.txt, 03_random_04.txt, 03_random_05.txt, 03_random_06.txt, 03_random_07.txt, 03_random_08.txt, 03_random_09.txt, 04_corner_00.txt, 04_corner_01.txt, 04_corner_02.txt, 04_corner_03.txt, 04_corner_04.txt, 04_corner_05.txt

Case Name	Status	Exec Time	Memory
00_sample_00.txt	AC	1 ms	1756 KiB
01_small_00.txt	AC	24 ms	1748 KiB
01_small_01.txt	AC	24 ms	1712 KiB
01_small_02.txt	AC	24 ms	1644 KiB
01_small_03.txt	AC	24 ms	1612 KiB
01_small_04.txt	AC	24 ms	1712 KiB
01_small_05.txt	AC	24 ms	1612 KiB
01_small_06.txt	AC	14 ms	1620 KiB
02_medium_00.txt	AC	36 ms	1636 KiB
02_medium_01.txt	AC	32 ms	1588 KiB
02_medium_02.txt	AC	30 ms	1588 KiB
02_medium_03.txt	AC	28 ms	1636 KiB
02_medium_04.txt	AC	27 ms	1612 KiB
02_medium_05.txt	AC	26 ms	1632 KiB
02_medium_06.txt	AC	21 ms	1676 KiB
02_medium_07.txt	AC	15 ms	1588 KiB
02_medium_08.txt	AC	12 ms	1624 KiB
02_medium_09.txt	AC	16 ms	1644 KiB
02_medium_10.txt	AC	13 ms	1636 KiB
02_medium_11.txt	AC	10 ms	1636 KiB
02_medium_12.txt	AC	9 ms	1748 KiB
03_random_00.txt	AC	10 ms	2240 KiB
03_random_01.txt	AC	10 ms	2396 KiB
03_random_02.txt	AC	10 ms	2396 KiB
03_random_03.txt	AC	10 ms	2388 KiB
03_random_04.txt	AC	10 ms	2284 KiB
03_random_05.txt	AC	5 ms	2752 KiB
03_random_06.txt	AC	9 ms	3044 KiB
03_random_07.txt	AC	9 ms	3136 KiB
03_random_08.txt	AC	9 ms	3292 KiB
03_random_09.txt	AC	9 ms	2880 KiB
04_corner_00.txt	AC	7 ms	4532 KiB
04_corner_01.txt	AC	7 ms	4656 KiB
04_corner_02.txt	AC	7 ms	4544 KiB
04_corner_03.txt	AC	6 ms	4556 KiB
04_corner_04.txt	AC	7 ms	4564 KiB
04_corner_05.txt	AC	7 ms	4544 KiB