Submission #1852646


Source Code Expand

#include<cstdio>
#include<cstring>
using namespace std;
typedef long long ll;
const int D=4,P=1000000007;
int i,j,k,n,m,ff,ch,lt,nw;
struct matrix {
	int a[D][D];
	void clear() {
		memset(a,0,sizeof a);
	}
	matrix operator * (const matrix &n) const {
		int i,j,k;
		matrix t;
		t.clear();
		for (i=0;i<D;i++)
			for (j=0;j<D;j++) {
				ll tt=0;
				for (k=0;k<D;k++) tt+=(ll) a[i][k]*n.a[k][j];
				t.a[i][j]=tt%P;
			}
		return t;
	}
} A[32],B;
struct cc {
	int a[D];
	void clear() {
		memset(a,0,sizeof a);
	}
	cc operator * (const matrix &n) const {
		int j,k;
		cc t;
		t.clear();
		for (j=0;j<D;j++) {
			ll tt=0;
			for (k=0;k<D;k++) tt+=(ll) a[k]*n.a[k][j];
			t.a[j]=tt%P;
		}
		return t;
	}
} ans;
void R(int &x) {
	ff=x=0;ch=getchar();
	while (ch<'0' || '9'<ch) { if (ch=='-') ff=1;ch=getchar();}
	while ('0'<=ch && ch<='9') x=x*10+ch-'0',ch=getchar();
	if (ff) x=-x;
}
void pre() {
	int i,j,k;
	for (i=0;i<D;i++)
		for (j=0;j<D;j++) if ((i|j)==i) {
			A[0].a[i][j]=1;
			B.a[i][j]=1;
		}
	for (i=0;i<D;i++) A[0].a[i][3]++;
	for (i=1;i<=30;i++) A[i]=A[i-1]*A[i-1];
}
int main() {
	ans.a[3]=1;
	pre();
	R(n);R(m);
	lt=0;
	for (i=1;i<=m;i++) {
		R(nw);
		for (k=nw-lt-1,j=0;k;k>>=1,j++) if (k&1) ans=ans*A[j];
		ans=ans*B;
		lt=nw;
	}
	for (k=n-lt-1,j=0;k;k>>=1,j++) if (k&1) ans=ans*A[j];
	int Ans=((ll) ans.a[0]+ans.a[1]+ans.a[2]+ans.a[3])%P;
	printf("%d\n",Ans);
}

Submission Info

Submission Time
Task E - Placing Squares
User jiyutian
Language C++14 (GCC 5.4.1)
Score 1600
Code Size 1446 Byte
Status AC
Exec Time 28 ms
Memory 128 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1600 / 1600
Status
AC × 4
AC × 38
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt, subtask_1_30.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 128 KB
sample_02.txt AC 1 ms 128 KB
sample_03.txt AC 1 ms 128 KB
sample_04.txt AC 1 ms 128 KB
subtask_1_01.txt AC 9 ms 128 KB
subtask_1_02.txt AC 3 ms 128 KB
subtask_1_03.txt AC 3 ms 128 KB
subtask_1_04.txt AC 6 ms 128 KB
subtask_1_05.txt AC 28 ms 128 KB
subtask_1_06.txt AC 28 ms 128 KB
subtask_1_07.txt AC 10 ms 128 KB
subtask_1_08.txt AC 10 ms 128 KB
subtask_1_09.txt AC 1 ms 128 KB
subtask_1_10.txt AC 1 ms 128 KB
subtask_1_11.txt AC 1 ms 128 KB
subtask_1_12.txt AC 1 ms 128 KB
subtask_1_13.txt AC 1 ms 128 KB
subtask_1_14.txt AC 1 ms 128 KB
subtask_1_15.txt AC 1 ms 128 KB
subtask_1_16.txt AC 1 ms 128 KB
subtask_1_17.txt AC 3 ms 128 KB
subtask_1_18.txt AC 6 ms 128 KB
subtask_1_19.txt AC 1 ms 128 KB
subtask_1_20.txt AC 7 ms 128 KB
subtask_1_21.txt AC 1 ms 128 KB
subtask_1_22.txt AC 0 ms 128 KB
subtask_1_23.txt AC 1 ms 128 KB
subtask_1_24.txt AC 1 ms 128 KB
subtask_1_25.txt AC 1 ms 128 KB
subtask_1_26.txt AC 1 ms 128 KB
subtask_1_27.txt AC 1 ms 128 KB
subtask_1_28.txt AC 1 ms 128 KB
subtask_1_29.txt AC 1 ms 128 KB
subtask_1_30.txt AC 1 ms 128 KB