C++(g++ 7.5.0) 解法, 执行用时: 389ms, 内存消耗: 19288K, 提交时间: 2022-11-08 18:53:12

#include <iostream>
#define int long long
using namespace std;
const int N=2e6+10;
int n,m,d[N],p[N],dp[N],max1;
signed main()
{
	cin>>n>>m;
	for(int i=1;i<=m;i++) cin>>d[i];
	for(int i=1;i<=m;i++) cin>>p[i],dp[p[i]]=d[i]+1;
	int l=0,r=0;
	for(int i=1;i<=n;i++)
	{
		if(dp[i]==0) continue;
		if(dp[i]==1) max1=max(max1,i+r);
		else r++;
	}
	for(int i=n;i>=1;i--)
	{
		if(dp[i]==0) continue;
		if(dp[i]==2) max1=max(max1,n-i+1+l);
		else l++;
	}
	cout<<max1<<"\n";
	return 0;
}

Python3 解法, 执行用时: 1383ms, 内存消耗: 90756K, 提交时间: 2022-10-30 20:21:31

n,m=map(int,input().split())
d=list(map(int,input().split()))
p=list(map(int,input().split()))
left,right,pos=[0]*(n+5),[0]*(n+5),[-1]*(n+5)
for i in range(m):
    pos[p[i]]=d[i]
for i in range(1,n+2):
    left[i]=left[i-1]
    if pos[i]==1:
        left[i]+=1
for i in range(n+2,-1,-1):
    right[i]=right[i+1]
    if pos[i]==0:
        right[i]+=1
ans=0
for k in p:
    if pos[k]==0:
        ans=max(ans,left[k]+k)
    else:
        ans=max(ans,n+1-k+right[k])
print(ans)

pypy3 解法, 执行用时: 828ms, 内存消耗: 125904K, 提交时间: 2022-10-29 15:50:07

n,m=map(int,input().split())
d=list(map(int,input().split()))
p=list(map(int,input().split()))
left,right,pos=[0]*(n+5),[0]*(n+5),[-1]*(n+5)
for i in range(m):
    pos[p[i]]=d[i]
for i in range(1,n+2):
    left[i]=left[i-1]
    if pos[i]==1:
        left[i]+=1
for i in range(n+2,-1,-1):
    right[i]=right[i+1]
    if pos[i]==0:
        right[i]+=1
ans=0
for k in p:
    if pos[k]==0:
        ans=max(ans,left[k]+k)
    else:
        ans=max(ans,n+1-k+right[k])
print(ans)

C++(clang++ 11.0.1) 解法, 执行用时: 387ms, 内存消耗: 27444K, 提交时间: 2022-10-28 20:06:43

#include<bits/stdc++.h>
using namespace std;
long long n,m,a[1000001],b[1000001],c[1000001],d[1000001],s,i;
int main()
{
	cin>>n>>m;
	for(i=1;i<=m;i=i+1)cin>>a[i];
	for(i=1;i<=m;i=i+1)
	{
		cin>>b[i];
		if(a[i]==0)++c[b[i]];else ++d[b[i]];
	}
	for(i=n;i>=1;i=i-1)c[i]=c[i]+c[i+1];
	for(i=1;i<=n;i=i+1)d[i]=d[i]+d[i-1];
	for(i=1;i<=m;i=i+1)
	{
		if(a[i]==0)s=max(s,b[i]+d[b[i]]);
		else s=max(s,n+1-b[i]+c[b[i]]);
	}
	cout<<s;
	return 0;
}