1 solutions

  • 0
    @ 2025-11-5 20:04:13

    C++ :

    #include <iostream>
    #include <cstdio>
    #include <cstdlib>
    #include <algorithm>
    #include <cstring>
    #define N 20123
    using namespace std;
    int n,m,x;
    long long sum;
    struct ad
    {
    	int a[105],b[105];
    	int c;
    }q[10005];
    int main()
    {
    	
    	scanf("%d%d",&n,&m);
    	for(int i=1;i<=n;i++)
    	{
    		q[i].c=0;
    		for(int j=0;j<m;j++)
    		{
    		  scanf("%d%d",&q[i].a[j],&q[i].b[j]);
    		  if(q[i].a[j]!=0) q[i].c++;
    		}
    	}
    	scanf("%d",&x);
    	for(int i=1;i<=n;i++)
    	{
    		sum=(sum+q[i].b[x])%N;
    		int j=q[i].b[x]%q[i].c;
    		if(j==0)j=q[i].c;
    		while(1)
    		{			
    			if(q[i].a[x])j--;
    			if(j==0)break;
    			x=(x+1)%m;
    		}
    		//cout<<x<<' '<<sum<<endl;
    	}
    	cout<<sum;
    	//while(1);
    	return 0;
    }
    
    • 1

    Information

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