Submission #367720

#	Time	Username	Problem	Language	Result	Execution time	Memory
367720		arnold518	Semafor (COI20_semafor)	C++14	21 / 100	26 ms	1152 KiB

semafor

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vector<ll>> Mat;

const ll MOD = 1e9+7;

const int MM[10]={12, 8, 5, 25, 10, 19, 20, 9, 23, 27};

int M, X;
ll N, K;

Mat operator + (const Mat &p, const Mat &q)
{
	Mat ret;
	int sz=p.size();
	ret=vector<vector<ll>>(sz, vector<ll>(sz));
	for(int i=0; i<sz; i++)
	{
		for(int j=0; j<sz; j++)
		{
			ret[i][j]=0;
			for(int k=0; k<sz; k++)
			{
				ret[i][j]+=p[i][k]*q[k][j]%MOD;
				ret[i][j]%=MOD;
				//if(ret[i][j]>=MOD) ret[i][j]-=MOD;
			}
		}
	}
	return ret;
}

Mat mypow(Mat x, ll y)
{
	if(y==0)
	{
		int sz=x.size();
		Mat ret=vector<vector<ll>>(sz, vector<ll>(sz, 0));
		for(int i=0; i<sz; i++) ret[i][i]=1;
		return ret;
	}
	if(y%2) return mypow(x, y-1)+x;
	Mat ret=mypow(x, y/2);
	return ret+ret;
}

Mat A, B, C;
Mat P, Q, R;

int main()
{
	scanf("%d%lld%lld%d", &M, &N, &K, &X);

	A=vector<vector<ll>>(32, vector<ll>(32));
	for(int i=0; i<32; i++)
	{
		for(int j=0; j<32; j++)
		{
			if(__builtin_popcount(i^j)==1) A[i][j]=1;
		}
	}

	B=mypow(A, K);
	C=mypow(A, N%K);

	P=vector<vector<ll>>(10, vector<ll>(10));
	Q=vector<vector<ll>>(10, vector<ll>(10));

	for(int i=0; i<10; i++)
	{
		for(int j=0; j<10; j++)
		{
			P[i][j]=B[MM[i]][MM[j]];
			Q[i][j]=C[MM[i]][MM[j]];
		}
	}


	R=mypow(P, N/K)+Q;

	for(int i=0; i<10; i++)
	{
		printf("%lld\n", R[X][i]);
	}
}

Compilation message (stderr)

semafor.cpp: In function 'int main()':
semafor.cpp:56:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   56 |  scanf("%d%lld%lld%d", &M, &N, &K, &X);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 6 / 6
• Subtask 2: 15 / 15
• Subtask 3: 0 / 12
• Subtask 4: 0 / 12
• Subtask 5: 0 / 15
• Subtask 6: 0 / 40