Submission #3820364
Source Code Expand
# -*- coding: utf-8 -*- def answer(S, T, N): # print(S) # print(T) same_c1_list = [] same_c1 = [] i = 0 while i < N: c1 = S[i] c2 = T[i] # same_c1.append(c1, c2) # j = i + 1 # while j < N: # if S[j] == c1: # same_c1.append(S[j], T[j]) for j in range(i, N): if S[j] == c1: same_c1.append([S[j], T[j]]) else: same_c1_list.append(same_c1) break if j == N - 1: break i = j same_c1 = [] # print([i, j]) for same_c1 in same_c1_list: c2 = same_c1[0][1] for c1c2 in same_c1: if c1c2[1] != c2: return False # i = 0 # while i < N: # c1 = S[i] # c2 = T[i] # # print("c1:", str(c1)) # # print("c2:", str(c2)) # if c1 != c2: # for j in range(N): # # print([S[j], c1]) # # print([T[j], c2]) # if S[j] == c1 and T[j] != c2: # return False # i += 1 return True S = list(input()) T = list(input()) N = len(S) ST = [None] * N for i in range(N): ST[i] = [S[i], T[i]] ST.sort(key=lambda a_i: a_i[0]) for i in range(N): S[i] = ST[i][0] T[i] = ST[i][1] ans1 = answer(S, T, N) ST.sort(key=lambda a_i: a_i[1]) for i in range(N): S[i] = ST[i][0] T[i] = ST[i][1] # print(S) # print(T) ans2 = answer(T, S, N) if ans1 and ans2: print("Yes") else: print("No")
Submission Info
Submission Time | |
---|---|
Task | C - String Transformation |
User | CabochaSoup |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 1668 Byte |
Status | WA |
Exec Time | 699 ms |
Memory | 47332 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01, sample_02, sample_03 |
All | 0_min0, 0_min1, 1_small0, 1_small1, 1_small2, 2_medium0, 2_medium1, 2_medium2, 2_medium3, 2_medium4, 3_max0, 3_max1, 3_max2, 3_max3, 3_max4, 3_max5, 3_max6, 3_max7, 3_max8, 3_max9, 5_hand0, sample_01, sample_02, sample_03 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_min0 | AC | 17 ms | 3064 KB |
0_min1 | AC | 18 ms | 3064 KB |
1_small0 | AC | 18 ms | 3064 KB |
1_small1 | AC | 18 ms | 3064 KB |
1_small2 | AC | 18 ms | 3064 KB |
2_medium0 | AC | 532 ms | 37844 KB |
2_medium1 | AC | 407 ms | 33412 KB |
2_medium2 | AC | 98 ms | 10976 KB |
2_medium3 | AC | 536 ms | 43060 KB |
2_medium4 | AC | 417 ms | 35228 KB |
3_max0 | AC | 699 ms | 47332 KB |
3_max1 | AC | 622 ms | 47260 KB |
3_max2 | AC | 638 ms | 47244 KB |
3_max3 | AC | 634 ms | 47208 KB |
3_max4 | AC | 610 ms | 47244 KB |
3_max5 | AC | 571 ms | 47220 KB |
3_max6 | AC | 519 ms | 47232 KB |
3_max7 | WA | 520 ms | 47228 KB |
3_max8 | AC | 535 ms | 47228 KB |
3_max9 | WA | 517 ms | 47228 KB |
5_hand0 | WA | 18 ms | 3064 KB |
sample_01 | AC | 18 ms | 3064 KB |
sample_02 | AC | 18 ms | 3064 KB |
sample_03 | AC | 18 ms | 3064 KB |