CodeForces 732D - Exams(二分)

D. Exams
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Vasiliy has an exam period which will continue for n days. He has to pass exams on m subjects. Subjects are numbered from 1 to m.

About every day we know exam for which one of m subjects can be passed on that day. Perhaps, some day you can’t pass any exam. It is not allowed to pass more than one exam on any day.

On each day Vasiliy can either pass the exam of that day (it takes the whole day) or prepare all day for some exam or have a rest.

About each subject Vasiliy know a number ai — the number of days he should prepare to pass the exam number i. Vasiliy can switch subjects while preparing for exams, it is not necessary to prepare continuously during ai days for the exam number i. He can mix the order of preparation for exams in any way.

Your task is to determine the minimum number of days in which Vasiliy can pass all exams, or determine that it is impossible. Each exam should be passed exactly one time.

Input
The first line contains two integers n and m (1 ≤ n, m ≤ 105) — the number of days in the exam period and the number of subjects.

The second line contains n integers d1, d2, …, dn (0 ≤ di ≤ m), where di is the number of subject, the exam of which can be passed on the day number i. If di equals 0, it is not allowed to pass any exams on the day number i.

The third line contains m positive integers a1, a2, …, am (1 ≤ ai ≤ 105), where ai is the number of days that are needed to prepare before passing the exam on the subject i.

Output
Print one integer — the minimum number of days in which Vasiliy can pass all exams. If it is impossible, print -1.

Examples
input
7 2
0 1 0 2 1 0 2
2 1
output
5
input
10 3
0 0 1 2 3 0 2 0 1 2
1 1 4
output
9
input
5 1
1 1 1 1 1
5
output
-1
Note
In the first example Vasiliy can behave as follows. On the first and the second day he can prepare for the exam number 1 and pass it on the fifth day, prepare for the exam number 2 on the third day and pass it on the fourth day.

In the second example Vasiliy should prepare for the exam number 3 during the first four days and pass it on the fifth day. Then on the sixth day he should prepare for the exam number 2 and then pass it on the seventh day. After that he needs to prepare for the exam number 1 on the eighth day and pass it on the ninth day.

In the third example Vasiliy can’t pass the only exam because he hasn’t anough time to prepare for it.

题意:
你每天可以做三件事，考试、复习、或者休息。

每门课都有一个需要复习的天数，比如第i门课需要复习ai天，只有当你总共复习了ai天的第i门课，你才能在考试中通过这第i门课。当然，你也不用非得连续几天都复习一门课，可以穿插着复习，只要最后的天数满足就可以了。

为了尽早回家，你想计算出考完这m门课最少需要多少天？当然每门课都要考通过。要是怎么也不能全部通过，那就输出-1。

解题思路:
利用二分的思想,找出最优的天数.
假定出一个天数,然后从后往前遍历.
如果第一次遇到某种考试,那么就让你所有要复习的天数减去这门课要考的天数,同时把这种课标记掉.
如果你遍历到某一天是0或者是这一门已经被标记掉了,那么就让所有剩余的天数减一,因为你这一天拿来复习了.
当然,如果你剩余的天数小于你总的需要复习的天数,那么就返回错误.
遍历完成,看一下剩余的天数是否为0,如果为0就返回正确,否则返回错误.

AC代码:

#include<stdio.h>
#include<string.h>
const int maxn = 1e5 +10;  
int n,m,need;  
int a[maxn],d[maxn];  
bool Bsearch(int k){  
    int i;  
    bool vis[maxn]={false};  
    memset(vis, false, sizeof(vis));  
    int free = k-m,last = need;  
    for(i=k;i>=1;i--){  
        if(!d[i]||vis[d[i]]){  
            free--;  
            continue;  
        }  
        if(free>=last){  
            vis[d[i]]=true;  
            last -= a[d[i]];  
        }else{  
            return false;  
        }  
    }  
    return (free==0);  
}  
int main(){  
    int i,j;  
    scanf("%d%d",&n,&m);  
    for(i=1;i<=n;i++){  
        scanf("%d",&d[i]);  
    }  
    need=0;  
    for(i=1;i<=m;i++){  
        scanf("%d",&a[i]);  
        need+=a[i];  
    }  
    int left=1,right=n,middle;  
    while(left<right){  
        middle =(left+right)/2;  
        if(Bsearch(middle)){  
            right = middle;  
        }else{  
            left = middle +1;  
        }  
    }  
    if(Bsearch(right)){  
        printf("%d\n",right);  
    }else{  
        printf("-1\n");  
    }  
}