/ SB域 /

记录详情

Time Exceeded

/in/foo.cc:1:0: warning: ignoring #pragma G  [-Wunknown-pragmas]
 # pragma G++ optimze(2) 
 
/in/foo.cc: In function 'int main()':
/in/foo.cc:72:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
  for (int i=1;i<=n;i++)
  ^~~
/in/foo.cc:77:3: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   for (int i=1;i<=n;i++)
   ^~~
/in/foo.cc:77:3: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
/in/foo.cc:80:4: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
    char opt;
    ^~~~
# 状态 耗时 内存占用
#1 Accepted 361ms 375.82 MiB
#2 Accepted 183ms 376.184 MiB
#3 Accepted 189ms 377.184 MiB
#4 Accepted 187ms 376.074 MiB
#5 Accepted 1736ms 383.254 MiB
#6 Time Exceeded ≥2000ms ≥376.059 MiB
#7 Time Exceeded ≥2001ms ≥380.172 MiB
#8 Accepted 1609ms 383.898 MiB
#9 Accepted 1875ms 382.977 MiB
#10 Accepted 1798ms 383.094 MiB
#11 Accepted 1869ms 384.258 MiB
#12 Accepted 1898ms 382.895 MiB
#13 Time Exceeded ≥2002ms ≥383.773 MiB
#14 Accepted 1351ms 381.105 MiB
#15 Accepted 1718ms 382.875 MiB
#16 Accepted 1925ms 382.348 MiB
#17 Accepted 1840ms 383.285 MiB
#18 Time Exceeded ≥2002ms ≥383.832 MiB
#19 Time Exceeded ≥2002ms ≥383.719 MiB
#20 Time Exceeded ≥2000ms ≥382.965 MiB
#21 Time Exceeded ≥2000ms ≥389.254 MiB
#22 Time Exceeded ≥2003ms ≥388.566 MiB
#23 Time Exceeded ≥2000ms ≥388.559 MiB
#24 Time Exceeded ≥2003ms ≥388.242 MiB
#25 Time Exceeded ≥2002ms ≥388.676 MiB

代码

# pragma G++ optimze(2) 
# include<bits/stdc++.h>
# define int long long
using namespace std;
const int MAXN=3505;
int a[MAXN][MAXN],d[MAXN][MAXN];
int n,m;
inline int read()
{
	int x;cin>>x; return x;
}
inline void write(int x)
{
	cout<<x;
}
inline void writeln(int x){write(x);putchar('\n');}
struct Tree{
	int c[MAXN][MAXN];
	Tree(){ memset(c,0,sizeof(c));}
	inline void update(int x,int y,int z){
		for (int i=x;i<=n;i+=i&(-i))
		 for (int j=y;j<=m;j+=j&(-j)){
		 	c[i][j]+=z;
		 }
	}	
}T1,T2,T3,T4;
# define A (x+1)
# define B (y+1)
inline int ask(int x,int y){
	int ret=0;
	for (int i=x;i;i-=i&(-i))
	 for (int j=y;j;j-=j&(-j))
	  ret+=A*B*T1.c[i][j]-B*T2.c[i][j]-A*T3.c[i][j]+T4.c[i][j];
	return ret;  
}
inline void add(int x,int y,int val){
	T1.update(x,y,val);   T2.update(x,y,val*x);
	T3.update(x,y,val*y); T4.update(x,y,val*x*y);
}
inline void work1()
{
	int x1=read(),y1=read(),x2=read(),y2=read();
	int ans=ask(x2,y2)-ask(x2,y1-1)-ask(x1-1,y2)+ask(x1-1,y1-1);
	writeln(ans);
}
inline void work2()
{
	int x1=read(),y1=read(),x2=read(),y2=read(),d=read();
	add(x1,y1,d); add(x1,y2+1,-d);
	add(x2+1,y1,-d); add(x2+1,y2+1,d);
}
inline void work3()
{
	int x1=read(),y1=read(),x2=read(),y2=read(),d=read(); d=-d;
	add(x1,y1,d); add(x1,y2+1,-d);
	add(x2+1,y1,-d); add(x2+1,y2+1,d);
}
inline void work4()
{
	int x1=read(),y1=read();
	int x2=x1,y2=y1;
	int ans=ask(x2,y2)-ask(x2,y1-1)-ask(x1-1,y2)+ask(x1-1,y1-1);
	writeln(ans);
}
signed main()
{
//	#ifdef LOCAL
//		freopen("7.in","r",stdin);
//		freopen("7.out","w",stdout);
//	#endif
	n=read();m=read();
	for (int i=1;i<=n;i++)
	 for (int j=1;j<=m;j++) {
	 	a[i][j]=read();
		d[i][j]=a[i][j]-a[i-1][j]-a[i][j-1]+a[i-1][j-1];  
	 }
	 for (int i=1;i<=n;i++)
	  for (int j=1;j<=m;j++)
	  	add(i,j,d[i][j]);
	  char opt;
	  while (true) {
	  	cin>>opt;
	  	switch (opt) {
	  		case 'Q':work1();break;
			case 'A':work2();break;
			case 'D':work3();break;
			case 'F':work4();break;
			case 'E':goto exit;break;  	
		}
	  }
	  exit:;
	return 0;
} 

信息

递交者
类型
递交
题目
二维数列 (U50446)
题目数据
下载
语言
C++
递交时间
2018-11-05 13:40:54
评测时间
2018-11-05 13:40:54
评测机
分数
56
总耗时
≥40564ms
峰值内存
≥389.254 MiB