Submission #2183052


Source Code Expand

import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Deque;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

class Main{
    public static void main(String[] args){
        Scanner scan = new Scanner(System.in);
        int N = scan.nextInt();
        long[] a = new long[N];
        long[] b = new long[N];
        for(int i=0;i<N;++i)a[i] =scan.nextLong();
        for(int i=0;i<N;++i)b[i] =scan.nextLong();
        Map<Long,Integer> countmap = new HashMap<>();
        long x = 0;
        for(int i=0;i<N;++i)x^=a[i];
        countmap.put(x,1);
        for(int i=0;i<N;++i){
            if(!countmap.containsKey(a[i]))countmap.put(a[i],0);
            countmap.put(a[i], countmap.get(a[i])+1);
        }
        for(int i=0;i<N;++i){
            if(!countmap.containsKey(b[i]) || countmap.get(b[i])==0){
                System.out.println(-1);
                return;
            }
            countmap.put(b[i], countmap.get(b[i])-1);
        }
        Map<Long, Deque<Integer>> bNumToIndex = new HashMap<>();
        for(int i=0;i<N;++i){
            if(!bNumToIndex.containsKey(b[i]))bNumToIndex.put(b[i],new ArrayDeque<>());
            bNumToIndex.get(b[i]).add(i);
        }
        int ans =0;
        boolean used[] = new boolean[N];
        int index=0;
        for(int i=0;i<N;++i)if(a[i]==b[i])used[i]=true;
        while(true){
            int nextIndex=-1;
            if(bNumToIndex.containsKey(x)){
                nextIndex=bNumToIndex.get(x).poll();
                while(used[nextIndex] && !bNumToIndex.get(x).isEmpty()){
                    nextIndex = bNumToIndex.get(x).poll();
                }
                if(bNumToIndex.get(x).isEmpty())bNumToIndex.remove(x);
                if(used[nextIndex])nextIndex=-1;
                else used[nextIndex]=true;
            }
            if(nextIndex<0){
                while(index<N &&used[index])++index;
                if(index>=N)break;
                nextIndex=index;
            }
            ++ans;
            x=a[nextIndex];
        }

        System.out.println(ans);
    }
}

Submission Info

Submission Time
Task D - XOR Replace
User inmir
Language Java8 (OpenJDK 1.8.0)
Score 0
Code Size 2214 Byte
Status WA
Exec Time 1057 ms
Memory 108316 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1000
Status
AC × 4
AC × 46
WA × 28
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt, 1_46.txt, 1_47.txt, 1_48.txt, 1_49.txt, 1_50.txt, 1_51.txt, 1_52.txt, 1_53.txt, 1_54.txt, 1_55.txt, 1_56.txt, 1_57.txt, 1_58.txt, 1_59.txt, 1_60.txt, 1_61.txt, 1_62.txt, 1_63.txt, 1_64.txt, 1_65.txt, 1_66.txt, 1_67.txt, 1_68.txt, 1_69.txt
Case Name Status Exec Time Memory
0_00.txt AC 95 ms 21716 KB
0_01.txt AC 94 ms 16980 KB
0_02.txt AC 91 ms 19796 KB
0_03.txt AC 93 ms 19924 KB
1_00.txt AC 95 ms 19792 KB
1_01.txt AC 95 ms 21588 KB
1_02.txt AC 94 ms 21844 KB
1_03.txt AC 92 ms 18772 KB
1_04.txt AC 94 ms 21588 KB
1_05.txt AC 92 ms 18640 KB
1_06.txt AC 93 ms 21588 KB
1_07.txt AC 681 ms 100244 KB
1_08.txt AC 678 ms 95648 KB
1_09.txt AC 715 ms 108316 KB
1_10.txt AC 624 ms 62512 KB
1_11.txt AC 611 ms 67748 KB
1_12.txt AC 604 ms 92376 KB
1_13.txt AC 647 ms 72840 KB
1_14.txt WA 691 ms 85324 KB
1_15.txt AC 629 ms 71528 KB
1_16.txt WA 676 ms 93568 KB
1_17.txt AC 670 ms 89104 KB
1_18.txt WA 665 ms 89960 KB
1_19.txt AC 627 ms 71268 KB
1_20.txt WA 694 ms 87424 KB
1_21.txt AC 686 ms 77700 KB
1_22.txt WA 694 ms 86008 KB
1_23.txt AC 633 ms 93688 KB
1_24.txt WA 1057 ms 86508 KB
1_25.txt AC 664 ms 76816 KB
1_26.txt WA 703 ms 85708 KB
1_27.txt AC 663 ms 73132 KB
1_28.txt WA 706 ms 87388 KB
1_29.txt AC 644 ms 75056 KB
1_30.txt WA 696 ms 81156 KB
1_31.txt AC 633 ms 72772 KB
1_32.txt WA 676 ms 90864 KB
1_33.txt AC 636 ms 77096 KB
1_34.txt WA 701 ms 87980 KB
1_35.txt AC 671 ms 75072 KB
1_36.txt WA 712 ms 83620 KB
1_37.txt AC 676 ms 71060 KB
1_38.txt WA 725 ms 95688 KB
1_39.txt AC 643 ms 72864 KB
1_40.txt WA 702 ms 90140 KB
1_41.txt AC 654 ms 74724 KB
1_42.txt WA 761 ms 101972 KB
1_43.txt AC 613 ms 68900 KB
1_44.txt WA 763 ms 103424 KB
1_45.txt AC 643 ms 73268 KB
1_46.txt WA 783 ms 98392 KB
1_47.txt AC 653 ms 75612 KB
1_48.txt WA 800 ms 97524 KB
1_49.txt AC 645 ms 70416 KB
1_50.txt WA 759 ms 101096 KB
1_51.txt AC 638 ms 62968 KB
1_52.txt WA 771 ms 97116 KB
1_53.txt AC 626 ms 65528 KB
1_54.txt WA 768 ms 89848 KB
1_55.txt AC 644 ms 73216 KB
1_56.txt WA 799 ms 96144 KB
1_57.txt AC 639 ms 75688 KB
1_58.txt WA 791 ms 95880 KB
1_59.txt AC 671 ms 81020 KB
1_60.txt WA 807 ms 95816 KB
1_61.txt AC 654 ms 77868 KB
1_62.txt WA 743 ms 98276 KB
1_63.txt AC 640 ms 68176 KB
1_64.txt WA 795 ms 99660 KB
1_65.txt AC 660 ms 91364 KB
1_66.txt WA 769 ms 99824 KB
1_67.txt AC 645 ms 77056 KB
1_68.txt WA 789 ms 94384 KB
1_69.txt AC 640 ms 75232 KB