시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
1 초 | 256 MB | 111 | 44 | 42 | 44.681% |
There are n bits. Each bit i has a value ai (0 or 1) and an associated cost ci. We can change the value of bit i with a cost computed as the sum of all the costs cj of the bits j such that aj = 1 AFTER bit i is changed. What is the minimum amount that should be paid to set each bit i to a specified value bi.
The first line contains the integer n (1 ≤ n ≤ 5 x 103) - the number of bits
The second line contains n integers ci (1 ≤ ci ≤ 109) - the costs associated with the bits
The third line contains the original n values of the bits ai - the original values of the bits
The fourth line contains the required n values of the bits bi - the required values of the bits
Print one number - the minimum cost.
5 5 2 6 1 5 01110 10011
21
ICPC > Regionals > Europe > Southeastern European Regional Contest > SEERC 2017 F번