提出 #27698083

ソースコード 拡げる

def find_grouping(N):
	if N % 3 == 2:
		return []
	A = N * (N - 1) // 6
	dp = [ [ [ False ] * (A + 1) for j in range(A + 1) ] for i in range(N) ]
	dp[0][0][0] = True
	for i in range(1, N):
		for sum1 in range(0, A + 1):
			for sum2 in range(0, A + 1):
				if sum1 >= i and dp[i - 1][sum1 - i][sum2] == True:
					dp[i][sum1][sum2] = True # put i into group 1
				if sum2 >= i and dp[i - 1][sum1][sum2 - i] == True:
					dp[i][sum1][sum2] = True # put i into group 2
				if dp[i - 1][sum1][sum2] == True:
					dp[i][sum1][sum2] = True # put i into group 3
	if dp[N - 1][A][A] == False:
		return []
	g = [ 0 ] * N
	curi = N - 1; cursum1 = A; cursum2 = A
	while curi >= 1:
		if cursum1 >= curi and dp[curi - 1][cursum1 - curi][cursum2] == True:
			g[curi] = 1
			cursum1 -= curi
		elif cursum2 >= curi and dp[curi - 1][cursum1][cursum2 - curi] == True:
			g[curi] = 2
			cursum2 -= curi
		else:
			g[curi] = 3
		curi -= 1
	return g

N = int(input())
g = find_grouping(N)
if g == []:
	print("No")
else:
	print("Yes")
	for i in range(0, N - 1):
		output = ""
		for j in range(i + 1, N):
			if g[j] == 1:
				output += "R"
			elif g[j] == 2:
				output += "B"
			else:
				output += "W"
		print(output)

提出情報

提出日時
問題 E - Christmas Wreath
ユーザ square1001
言語 Python (3.8.2)
得点 600
コード長 1242 Byte
結果 AC
実行時間 2700 ms
メモリ 69436 KiB

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 600 / 600
結果
AC × 1
AC × 48
セット名 テストケース
Sample sample_01.txt
All in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, sample_01.txt
ケース名 結果 実行時間 メモリ
in01.txt AC 18 ms 9148 KiB
in02.txt AC 20 ms 9156 KiB
in03.txt AC 29 ms 8952 KiB
in04.txt AC 24 ms 8956 KiB
in05.txt AC 19 ms 9196 KiB
in06.txt AC 24 ms 9132 KiB
in07.txt AC 19 ms 9132 KiB
in08.txt AC 19 ms 9164 KiB
in09.txt AC 25 ms 9144 KiB
in10.txt AC 29 ms 8968 KiB
in11.txt AC 21 ms 8952 KiB
in12.txt AC 28 ms 8980 KiB
in13.txt AC 33 ms 8960 KiB
in14.txt AC 18 ms 9196 KiB
in15.txt AC 43 ms 9028 KiB
in16.txt AC 49 ms 9276 KiB
in17.txt AC 18 ms 8956 KiB
in18.txt AC 66 ms 9964 KiB
in19.txt AC 68 ms 10040 KiB
in20.txt AC 23 ms 9088 KiB
in21.txt AC 96 ms 10620 KiB
in22.txt AC 109 ms 11228 KiB
in23.txt AC 19 ms 8972 KiB
in24.txt AC 153 ms 12080 KiB
in25.txt AC 175 ms 12668 KiB
in26.txt AC 18 ms 9152 KiB
in27.txt AC 238 ms 14204 KiB
in28.txt AC 278 ms 15136 KiB
in29.txt AC 18 ms 8964 KiB
in30.txt AC 374 ms 17404 KiB
in31.txt AC 427 ms 18624 KiB
in32.txt AC 19 ms 8976 KiB
in33.txt AC 568 ms 21752 KiB
in34.txt AC 643 ms 23676 KiB
in35.txt AC 25 ms 8952 KiB
in36.txt AC 832 ms 28200 KiB
in37.txt AC 955 ms 30964 KiB
in38.txt AC 26 ms 9144 KiB
in39.txt AC 1221 ms 36952 KiB
in40.txt AC 1375 ms 40696 KiB
in41.txt AC 21 ms 9208 KiB
in42.txt AC 1728 ms 48632 KiB
in43.txt AC 1937 ms 53276 KiB
in44.txt AC 26 ms 9184 KiB
in45.txt AC 2408 ms 63408 KiB
in46.txt AC 2700 ms 69436 KiB
in47.txt AC 22 ms 8972 KiB
sample_01.txt AC 18 ms 9152 KiB