F - Exams CodeForces - 732D(二分+贪心)

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
inputCopy
7 2
0 1 0 2 1 0 2
2 1
outputCopy
5
inputCopy
10 3
0 0 1 2 3 0 2 0 1 2
1 1 4
outputCopy
9
inputCopy
5 1
1 1 1 1 1
5
outputCopy
-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个科目，要在n天内把m个科目全部考完，每天可以 复习某一科或者进行某一科的考试。输入d[i]，代表第i天只能考科目d[i]，d[i]==0代表当天不能考试。再输入m门科目的复习时间，在科目i考试之前必须花费a[i]复习科目i。最后输出考完所有科目最短时间，考不完则输出-1。

二分天数

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn = 1e5+10;
int a[maxn],dis[maxn];
int n,m;
int res;
bool check(int k)
{
    int ans = 0;
    memset(dis,0,sizeof(dis));
    int cnt = 0;    //  记录考试了几科
    for(int i=k; i>=1; i--)
    {
        if(a[i]!=0&&!dis[a[i]])
        {
            dis[a[i]] = 1;
            cnt++;
        }
        else if(a[i]==0&&cnt)
        // 后面有考试的情况下ans才+1
            //   例如样例 3 1
            //     1 0 1
            //    1
            ans++;            
        else if(a[i]!=0&&dis[a[i]])  
            ans++;                    
        if(ans==res&&cnt==m)
            return true;
    }
    return false;
}

int main()
{
    cin>>n>>m;
    int i;
    for(i=1; i<=n; i++)
    {
        scanf("%d",&a[i]);
    }
    res = 0;
    for(i=1; i<=m; i++)
    {
        int x;
        scanf("%d",&x);
        res +=x;   //记录复习所需的总天数
    }
    int l = 1;
    int ans;
    int r = n;
    while(l<=r)  //二分天数
    {
        int mid = (l+r)>>1;
        if(check(mid))
        {
            ans = mid;
            r = mid-1;
        }
        else
        {
            l = mid+1;
        }
    }
    if(ans>n)
        printf("-1\n");
    else
        printf("%d\n",ans);
    return 0;
}