Submission #44517446

Source Code Expand

n, m = map(int, input().split())
s = list(input())
t = [' '] * len(s)
c = list(map(int, input().split()))
d = sorted([(c[i], i) for i in range(n)])
i = 0
while i < len(d):
	j = i
	while j + 1 < len(d) and d[j+1][0] == d[i][0]:
		j += 1
	for k in range(i, j + 1):
		x = d[k][1]
		y = d[k+1][1] if k < j else d[i][1]
		t[y] = s[x]
	i = j + 1
print(''.join(t))

Submission Info

Submission Time
Task C - Rotate Colored Subsequence
User yefllower
Language Python (CPython 3.11.4)
Score 300
Code Size 372 Byte
Status AC
Exec Time 429 ms
Memory 42568 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 29
Set Name Test Cases
Sample example0.txt, example1.txt
All 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, 022.txt, 023.txt, 024.txt, 025.txt, 026.txt, example0.txt, example1.txt
Case Name Status Exec Time Memory
000.txt AC 10 ms 8540 KiB
001.txt AC 152 ms 35388 KiB
002.txt AC 429 ms 42568 KiB
003.txt AC 167 ms 35740 KiB
004.txt AC 278 ms 36020 KiB
005.txt AC 417 ms 42468 KiB
006.txt AC 84 ms 17160 KiB
007.txt AC 134 ms 20268 KiB
008.txt AC 160 ms 23044 KiB
009.txt AC 418 ms 42244 KiB
010.txt AC 417 ms 42420 KiB
011.txt AC 318 ms 39064 KiB
012.txt AC 315 ms 38904 KiB
013.txt AC 278 ms 36040 KiB
014.txt AC 273 ms 36060 KiB
015.txt AC 196 ms 36184 KiB
016.txt AC 280 ms 36200 KiB
017.txt AC 155 ms 35312 KiB
018.txt AC 180 ms 35964 KiB
019.txt AC 171 ms 35896 KiB
020.txt AC 165 ms 35960 KiB
021.txt AC 172 ms 35676 KiB
022.txt AC 165 ms 35708 KiB
023.txt AC 168 ms 35880 KiB
024.txt AC 166 ms 35644 KiB
025.txt AC 156 ms 35472 KiB
026.txt AC 154 ms 35380 KiB
example0.txt AC 10 ms 8472 KiB
example1.txt AC 11 ms 8552 KiB