【codeforces732D】二分+灵活

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

题意：

输入n,m，代表n天要准备m门考试，第二行输入n个数，0代表不考试，非0代表这一天能考试这一门，第三行m个数，代表每门考试需要复习的天数，只有复习指定天数后考试才能通过。问通过所有考试最少需要几天，如果不能通过所有考试则输出-1。

思路：

二分答案，求满足条件的最短天数，根据二分balabala规律可知等号应加在r = mid - 1,答案是l。现在题目就变成了判断某一天能否通过所有的考试，我感觉这个还是有一定难度的。从后往前推，具体见代码。因为有可能答案是-1，所以不能直接输出l，具体写法还是见代码。

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
LL a[500005],b[500005],f[500005],n,m;
bool ok(LL x)
{
    LL i,day=x-1;
    for(i=1; i<=m; i++) f[i]=0;
    for(i=x; i>=1; i--)
    {
        day=min(i-1,day);//剩余复习天数一定不会超过i-1
        if(a[i]!=0&&f[a[i]]==0&&day>=b[a[i]])//某天可以考试这门&&以后也没有考试这门&&剩余天数足够复习这门
        {
            f[a[i]]=1;//标记这天为考试天
            day=day-b[a[i]]-1;//剩余天数-这门考试需要复习多少天-考试当天
        }
    }
    //如果f[i]=0说明不含某一门考试
    for(i=1; i<=m; i++)
    {
        if(f[i]==0)
            return 0;
    }
    return 1;
}
int main()
{
    LL i,n,sum=0;
    scanf("%I64d%I64d",&n,&m);
    for(i=1; i<=n; i++) scanf("%I64d",&a[i]);
    for(i=1; i<=m; i++)
    {
        scanf("%I64d",&b[i]);
        sum+=b[i];
    }
    LL l=sum+1,r=n,ans=-1;
    while(l<=r)
    {
        LL mid=(l+r)>>1;
        if(ok(mid))
        {
            r=mid-1;
            ans=mid;
        }
        else
            l=mid+1;
    }
    printf("%I64d\n",ans);
    return 0;
}