codeforces 732D 二分+贪心

http://codeforces.com/problemset/problem/732/D
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.
题目大意：有$n$天的时间和$m$个要考试的课程，给出序列$d$，若$d[i]=0$，表示这一天不能考试，否则表示这一天可以考第$d[i]$门科目，给出序列$a$，$a[i]$表示考第$i$门科目所需要的复习天数。每门科目只需要考一次，考试的那天是不能复习的，且你可以任意分配复习时间，不用连续复习一门科目。求最少需要多少天你可以通过$m$个测试，若无解输出$-1。$

思路：二分。对于每个$mid$判断$mid$天内是否能够通过所有科目的测试。时间复杂度$O(nlgn)$。判断方法：从$mid$开始向前遍历序列$d$，如果此时可以考试，判断一下时间够不够，够的话就减掉复习的时间同时记录一下这门科目的编号，否则说明时间不够，返回$false$即可。具体见代码。

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<cmath>
#define INF 0x3f3f3f3f
#define eps 1e-6
using namespace std;
typedef long long ll;

const int maxn=1e5+5;

int a[maxn],d[maxn],n,m;
bool vis[maxn];

bool check(int mid)
{
	if(mid>n)
		return 0;
	memset(vis,0,sizeof(vis));
	int cnt=0;
	int sum=mid;
	for(int i=mid;i>=1;i--)
	{
		sum=min(sum,i);//复习时间最多只有i天
		if(d[i]!=0&&!vis[d[i]])
		{
			--sum;//考试的那天不算复习时间
			if(sum>=a[d[i]])
			{
				vis[d[i]]=1;
				sum-=a[d[i]];
				++cnt;
			}
			else
				return 0;
		}
		if(cnt==m)
			return 1;
	}
	return 0;
}

int main()
{
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)
		scanf("%d",&d[i]);
	for(int i=1;i<=m;i++)
		scanf("%d",&a[i]);
	int l=1,r=n,mid;
	while(l<=r)
	{
		mid=l+r>>1;
		if(check(mid))
			r=mid-1;
		else
			l=mid+1;
	}
	if(check(l))
		printf("%d\n",l);
	else
		printf("-1\n");
	return 0;
}