Submission #64331234

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
import sys
sys.setrecursionlimit(10**6)
import pypyjit
pypyjit.set_param('max_unroll_recursion=-1')
n = int(input())
s = input()
t = input()
dd = {}
for i in range(n):
    si, ti = s[i], t[i]
    if si in dd:
        if dd[si] != ti:
            exit(print(-1))
    else:
        dd[si] = ti
ts = {c for c in dd if dd[c] != c}
g = {c: None for c in ts}
for c in ts:
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

import sys
sys.setrecursionlimit(10**6)
import pypyjit
pypyjit.set_param('max_unroll_recursion=-1')
n = int(input())
s = input()
t = input()

dd = {}
for i in range(n):
    si, ti = s[i], t[i]
    if si in dd:
        if dd[si] != ti:
            exit(print(-1))
    else:
        dd[si] = ti

ts = {c for c in dd if dd[c] != c}

g = {c: None for c in ts}
for c in ts:
    target = dd[c]
    if target in ts:
        g[c] = target

vis = {c: 0 for c in ts}
cnt = 0
stack = {}

def dfs(now, depth):
    global cnt
    vis[now] = 1
    stack[now] = depth
    nxt = g[now]
    if nxt is not None:
        if vis[nxt] == 0:
            dfs(nxt, depth + 1)
        elif vis[nxt] == 1:
            cycle_length = depth + 1 - stack[nxt]
            cnt += cycle_length - 2
    vis[now] = 2
    del stack[now]

for c in ts:
    if vis[c] == 0:
        dfs(c, 0)
ans = len(ts) + cnt
print(ans)

Submission Info

Judge Result