Submission #1797604


Source Code Expand

#include <cstdio>
const int mo=1000000007;
int x[100005];
struct Matrix{
	long long a[3][3];
}I=(Matrix){1,0,0,0,1,0,0,0,1};
Matrix operator *(Matrix A,Matrix B){
	Matrix C;
	for (int i=0;i<3;i++)
		for (int j=0;j<3;j++){
			C.a[i][j]=0;
			for (int k=0;k<3;k++)
				C.a[i][j]+=A.a[i][k]*B.a[k][j];
			C.a[i][j]%=mo;
		}
	return C;
}
Matrix operator ^(Matrix A,int B){
	Matrix C=I;
	for (;B;B>>=1,A=A*A)
		if (B&1) C=C*A;
	return C;
}
int main(){
	Matrix P=(Matrix){1,2,1,0,1,1,1,2,2},Q={1,2,1,0,1,1,0,0,1};
	Matrix ans=(Matrix){1,0,0,0,0,0,0,0,0};
	int n,m;
	scanf("%d%d",&n,&m);x[0]=-1;
	for (int i=1;i<=m;i++){
		scanf("%d",&x[i]);
		ans=ans*(P^(x[i]-x[i-1]-1))*Q;
	}
	ans=ans*(P^(n-x[m]-1));
	printf("%lld\n",ans.a[0][2]);
}

Submission Info

Submission Time
Task E - Placing Squares
User aufeas
Language C++14 (GCC 5.4.1)
Score 1600
Code Size 762 Byte
Status AC
Exec Time 112 ms
Memory 512 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:28:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&m);x[0]=-1;
                     ^
./Main.cpp:30:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&x[i]);
                    ^

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 36 ms 256 KB
subtask_1_02.txt AC 9 ms 128 KB
subtask_1_03.txt AC 5 ms 256 KB
subtask_1_04.txt AC 12 ms 384 KB
subtask_1_05.txt AC 112 ms 512 KB
subtask_1_06.txt AC 111 ms 512 KB
subtask_1_07.txt AC 20 ms 512 KB
subtask_1_08.txt AC 21 ms 512 KB
subtask_1_09.txt AC 2 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 7 ms 256 KB
subtask_1_18.txt AC 15 ms 512 KB
subtask_1_19.txt AC 1 ms 128 KB
subtask_1_20.txt AC 18 ms 512 KB
subtask_1_21.txt AC 1 ms 128 KB
subtask_1_22.txt AC 1 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