Submission #76450655

Source Code Expand

import sys

N = int(input())
A = list(map(int, input().split()))
B  = list(map(int, input().split()))
n = 0
for i in range(N):
  n = int(A[i])
  if (i + 1) != (B[n-1]):
    print("No")
    sys.exit()
print("Yes")

Submission Info

Submission Time
Task B - The Honest Woodcutters
User Aze__
Language Python (CPython 3.13.7)
Score 200
Code Size 223 Byte
Status AC
Exec Time 10 ms
Memory 9180 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 13
Set Name Test Cases
Sample 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt
All 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 01_01.txt, 01_02.txt, 02_01.txt, 02_02.txt, 03_01.txt, 03_02.txt, 04_01.txt, 04_02.txt, 04_03.txt, 04_04.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 9 ms 9040 KiB
00_sample_02.txt AC 10 ms 9128 KiB
00_sample_03.txt AC 9 ms 9028 KiB
01_01.txt AC 9 ms 9180 KiB
01_02.txt AC 9 ms 9100 KiB
02_01.txt AC 9 ms 9100 KiB
02_02.txt AC 10 ms 9104 KiB
03_01.txt AC 10 ms 8932 KiB
03_02.txt AC 9 ms 9028 KiB
04_01.txt AC 9 ms 8992 KiB
04_02.txt AC 9 ms 8844 KiB
04_03.txt AC 9 ms 9132 KiB
04_04.txt AC 9 ms 9100 KiB