Submission #64337486

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
def solve():
    N=int(input())
    S=input()
    T=input()
    mapping = {}
    for s, t in zip(S, T):
        if s in mapping:
            if mapping[s] != t:
                print(-1)
                return
        else:
            mapping[s] = t
    graph = {}
    for c in mapping:
        if mapping[c] != c:
            graph[c] = mapping[c]
    ops = len(graph)
    visited = set()
    cycles = 0
    for c in graph:
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

def solve():
    N=int(input())
    S=input()
    T=input()
    mapping = {}
    for s, t in zip(S, T):
        if s in mapping:
            if mapping[s] != t:
                print(-1)
                return
        else:
            mapping[s] = t

    graph = {}
    for c in mapping:
        if mapping[c] != c:
            graph[c] = mapping[c]
    ops = len(graph)
    visited = set()
    cycles = 0
    for c in graph:
        if c in visited:
            continue
        cur = c
        cycle_nodes = set()
        while cur in graph and cur not in cycle_nodes:
            cycle_nodes.add(cur)
            cur = graph[cur]
        if cur in cycle_nodes:
            cycles += 1
        visited |= cycle_nodes
    used_targets = set(mapping[c] for c in mapping if mapping[c] != c)
    spare = 26 - len(used_targets)
    if spare < cycles:
        print(-1)
        return
    ops += cycles
    print(ops)

if __name__ == '__main__':
    solve()

Submission Info

Judge Result