0
1

Delete article

Deleted articles cannot be recovered.

Draft of this article would be also deleted.

Are you sure you want to delete this article?

More than 3 years have passed since last update.

yukicoder contest 296 参戦記

Last updated at Posted at 2021-05-21

yukicoder contest 296 参戦記

A 1511 A ? B Problem

使っているプログラミング言語の論理和と論理積の演算子が分かっていれば書くだけ.

A, B = map(int, input().split())

print((A | B) - (A & B))

B 1512 作文

まず文字列内の文字がソート順に並んでないものは良い文字列になることがなく、選択できないので省く. 次に aa の後に ab は接続できても、その逆は無理なのでソートする. 後は末尾文字をキーとした DP をすれば解ける. 開始文字が DP のキー以上のときに、末尾のキーに対して最大長を取る DP をすればいい.

from sys import stdin

readline = stdin.readline

N = int(readline())
S = [readline()[:-1] for _ in range(N)]

dp = {'a': 0}
for s in sorted(S):
    if ''.join(sorted(s)) != s:
        continue
    start = s[0]
    last = s[-1]
    l = len(s)
    dp.setdefault(last, 0)
    for c in 'zyxwvutsrqponmlkjihgfedcba':
        if c not in dp:
            continue
        if start < c:
            continue
        dp[last] = max(dp[last], dp[c] + l)
print(max(dp.values()))
0
1
0

Register as a new user and use Qiita more conveniently

  1. You get articles that match your needs
  2. You can efficiently read back useful information
  3. You can use dark theme
What you can do with signing up
0
1

Delete article

Deleted articles cannot be recovered.

Draft of this article would be also deleted.

Are you sure you want to delete this article?