Submission #1613139


Source Code Expand

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>

typedef long long LL;
const int MX=300011;
struct Tri{
	int a[11];
	Tri(int _a=0){memset(a,0,sizeof(a));a[0]=_a;}
	//inline void pr()const{
	//	for(int i=0;a[i];i++)printf("%d ",a[i]);puts("");
	//}
}T[MX],S[MX];

int x[MX],a[MX];
int n,m;LL k;
inline int Abs(const int &x){return x>=0?x:-x;}
inline Tri operator+(const Tri &x,const Tri &y){
	int it[3]={0,0,0};
	Tri r;
	while(x.a[it[0]]||y.a[it[1]]){
		static int t;
		t=(x.a[it[0]]&&(!y.a[it[1]]||Abs(x.a[it[0]])<=Abs(y.a[it[1]]))?x.a[it[0]++]:y.a[it[1]++]);
		if(it[2]&&r.a[it[2]-1]==-t)r.a[--it[2]]=0;
		else r.a[it[2]++]=t;
	}
	return r;
}
inline Tri operator-(const Tri &x,const Tri &y){
	int it[3]={0,0,0};
	Tri r;
	while(x.a[it[0]]||y.a[it[1]]){
		static int t;
		t=(x.a[it[0]]&&(!y.a[it[1]]||Abs(x.a[it[0]])<=Abs(y.a[it[1]]))?x.a[it[0]++]:-y.a[it[1]++]);
		if(it[2]&&r.a[it[2]-1]==-t)r.a[--it[2]]=0;
		else r.a[it[2]++]=t;
	}
	return r;
}
Tri* X(Tri x[],const Tri y[]){
	static Tri t[MX];
	//for(int i=1;i<=n;i++)x[i].pr();puts("");
	//for(int i=1;i<=n;i++)y[i].pr();puts("");
	for(int i=1;i<=n;i++){
		t[i]=Tri();
		for(int j=0;x[i].a[j];j++)
			t[i]=(x[i].a[j]>0?t[i]+y[x[i].a[j]]:t[i]-y[-x[i].a[j]]);
	}
	memcpy(x+1,t+1,sizeof(Tri)*n);
	//for(int i=1;i<=n;i++)x[i].pr();puts("");
	return x;
}
LL ans[MX];
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++)scanf("%d",&x[i]);
	scanf("%d%lld",&m,&k);
	for(int i=1;i<=m;i++)scanf("%d",&a[i]);
	for(int i=1;i<=n;i++)S[i].a[0]=T[i].a[0]=i;
	for(int i=1;i<=m;i++)
		T[a[i]]=T[a[i]-1]+T[a[i]+1]-T[a[i]];
	
	while(k){
		if(k&1)X(S,T);
		X(T,T);
		k>>=1;
	}
	for(int i=1;i<=n;i++)for(int j=0;S[i].a[j];j++)ans[i]+=(S[i].a[j]>0?x[S[i].a[j]]:-x[-S[i].a[j]]);
	for(int i=1;i<=n;i++)printf("%lld\n",ans[i]);
	return 0;
}

Submission Info

Submission Time
Task C - Rabbit Exercise
User CommonAnts
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1866 Byte
Status RE
Exec Time 708 ms
Memory 43392 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:56:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:57:40: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=n;i++)scanf("%d",&x[i]);
                                        ^
./Main.cpp:58:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%lld",&m,&k);
                       ^
./Main.cpp:59:40: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for(int i=1;i<=m;i++)scanf("%d",&a[i]);
                                        ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 800
Status
AC × 3
AC × 10
RE × 19
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt
Case Name Status Exec Time Memory
0_00.txt AC 18 ms 41600 KB
0_01.txt AC 18 ms 41600 KB
0_02.txt AC 19 ms 41600 KB
1_00.txt AC 18 ms 41600 KB
1_01.txt AC 18 ms 41600 KB
1_02.txt AC 271 ms 43392 KB
1_03.txt AC 708 ms 43392 KB
1_04.txt RE 170 ms 41600 KB
1_05.txt RE 111 ms 29056 KB
1_06.txt RE 114 ms 28928 KB
1_07.txt RE 112 ms 28928 KB
1_08.txt RE 115 ms 28928 KB
1_09.txt RE 114 ms 28928 KB
1_10.txt RE 111 ms 28928 KB
1_11.txt RE 112 ms 28928 KB
1_12.txt RE 110 ms 28928 KB
1_13.txt RE 116 ms 28928 KB
1_14.txt RE 113 ms 28928 KB
1_15.txt RE 118 ms 28928 KB
1_16.txt AC 34 ms 41600 KB
1_17.txt RE 127 ms 28928 KB
1_18.txt RE 125 ms 28928 KB
1_19.txt RE 128 ms 28928 KB
1_20.txt RE 121 ms 28928 KB
1_21.txt RE 121 ms 28928 KB
1_22.txt RE 129 ms 28928 KB
1_23.txt AC 281 ms 43008 KB
1_24.txt AC 200 ms 42752 KB
1_25.txt RE 130 ms 28928 KB