1 solutions

  • 0
    @ 2025-11-5 16:34:50

    C++ :

    #include<cstdio>
    #include<cstdlib>
    #include<cstring>
    using namespace std;
    int n,m,a[405],q[25][25],t[25][25],s[25][8005],tot[25],maxn=-1,ss[25];
    int main()
    {
    	scanf("%d%d",&m,&n);
    	memset(tot,0,sizeof(tot));
    	for(int i=1;i<=n*m;++i)
    	{
    		scanf("%d",&a[i]);
    	}
    	
    	for(int i=1;i<=n;++i)
    	{
    		for(int j=1;j<=m;++j)
    		{
    			scanf("%d",&q[i][j]);
    		}
    	}
    	
    	for(int i=1;i<=n;++i)
    	{
    		for(int j=1;j<=m;++j)
    		{
    			scanf("%d",&t[i][j]);
    		}
    	}
    	
    	for(int i=1;i<=n;++i)
    	{
    		ss[i]=0;
    	}
    	
    	for(int i=1;i<=m*n;++i)
    	{
    		int k=++tot[a[i]];
    		int kq=q[a[i]][k];
    		int kt=t[a[i]][k];
    		int L=0;
    		for(int j=ss[a[i]]+1;j<=8000;++j)
    		{
    			if(s[kq][j]==0)
    			{
    				++L;
    			}
    			else
    			{
    				L=0;
    			}
    			if(L==kt)
    			{
    				for(int kk=j;kk>=j-L+1;--kk)
    				{
    					s[kq][kk]=1;
    				}
    				ss[a[i]]=j;
    				break;
    			}
    		}
    	}
    	
    	for(int i=1;i<=m;++i)
    	{
    		for(int j=8000;j>=1;--j)
    		{
    			if(s[i][j]==1)
    			{
    				maxn=maxn>j?maxn:j;
    				break;
    			}
    		}
    	}
    	printf("%d",maxn);
    	return 0;
    }
    
    • 1

    Information

    ID
    17877
    Time
    1000ms
    Memory
    128MiB
    Difficulty
    (None)
    Tags
    # Submissions
    0
    Accepted
    0
    Uploaded By