#689440 (Lua) No.1646 Avoid Palindrome

• 問題: No.1646 Avoid Palindrome
• ユーザー: 👑 obakyan
• 提出日時: 2021-08-13 22:48:33
• 言語: Lua (LuaJit 2.1.1734355927)
• 結果: AC
• 実行時間: 482 ms / 3,000 ms
• コード長: 2,374 bytes
• コンパイル時間: 238 ms
• コンパイル使用メモリ: 5,504 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-11-08 15:50:06
• 合計ジャッジ時間: 13,938 ms
• ジャッジサーバーID （参考情報）: judge4 / judge1

ファイルパターン	結果
sample	AC * 4
other	AC * 40

ソースコード

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
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
local mfl, mce = math.floor, math.ceil
local mod = 998244353
local n = io.read("*n", "*l")
local s = io.read()
local t = {}
for i = 1, n do
  t[i] = s:sub(i, i)
  if t[i] == "?" then
    t[i] = false
  else
    t[i] = t[i]:byte() - 96
  end
end
for i = 1, n - 1 do
  if t[i] and t[i] == t[i + 1] then
    print(0) os.exit()
  end
end
for i = 1, n - 2 do
  if t[i] and t[i] == t[i + 2] then
    print(0) os.exit()
  end
end
if n == 1 then
  print(t[1] and 1 or 26) os.exit()
end
local dp1, dp2 = {}, {}
if not t[1] and not t[2] then
  for i = 1, 26 do for j = 1, 26 do
    local v = (i - 1) * 26 + j
    dp1[v] = i == j and 0 or 1
  end end
elseif not t[1] then
  local i2 = t[2]
  for i = 1, 26 do for j = 1, 26 do
    local v = (i - 1) * 26 + j
    if i == i2 or j ~= i2 then
      dp1[v] = 0
    else
      dp1[v] = 1
    end
  end end
elseif not t[2] then
  local i1 = t[1]
  for i = 1, 26 do for j = 1, 26 do
    local v = (i - 1) * 26 + j
    if i ~= i1 or j == i1 then
      dp1[v] = 0
    else
      dp1[v] = 1
    end
  end end
else
  local i1 = t[1]
  local i2 = t[2]
  for i = 1, 26 do for j = 1, 26 do
    local v = (i - 1) * 26 + j
    if i ~= i1 or j ~= i2 then
      dp1[v] = 0
    else
      dp1[v] = 1
    end
  end end
end
for i = 3, n do
  local src = i % 2 == 1 and dp1 or dp2
  local dst = i % 2 == 1 and dp2 or dp1
  for j = 1, 676 do dst[j] = 0 end
  if t[i] then
    local z = t[i]
    for prvprv = 1, 26 do
      if prvprv ~= z then
        for prv = 1, 26 do
          if prv ~= z then
            local d = (prv - 1) * 26 + z
            dst[d] = dst[d] + src[(prvprv - 1) * 26 + prv]
          end
        end
      end
    end
  else
    local row = {}
    local col = {}
    for j = 1, 26 do row[j], col[j] = 0, 0 end
    local all = 0
    for j = 1, 26 do
      for k = 1, 26 do
        local sz = src[(j - 1) * 26 + k]
        all = all + sz
        row[j] = row[j] + sz
        col[k] = col[k] + sz
      end
    end
    local z = t[i]
    for j = 1, 26 do
      for prv = 1, 26 do
        if prv ~= j then
          local v = col[prv] - src[(j - 1) * 26 + prv]
          local d = (prv - 1) * 26 + j
          dst[d] = v
        end
      end
    end
  end
  for j = 1, 676 do dst[j] = dst[j] % mod end
end
local tbl = n % 2 == 1 and dp2 or dp1
local ret = 0
for i = 1, 676 do
  ret = ret + tbl[i]
end
print(ret % mod)
-- print(os.clock())
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX