Submission #1612273


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=(a),i##_end=(b);i<=i##_end;i++)
#define per(i,b,a) for(int i=(b),i##_st=(a);i>=i##_st;i--)
#define x first
#define y second
#define pb push_back
#define mp make_pair
#define debug(x) cerr<<#x" = "<<x<<endl
#define Debug(...) fprintf(stderr, __VA_ARGS__)
#define Es(x,i) for(Edge *i=G[x];i;i=i->nex)
typedef pair<int,int> pii;
typedef long long ll;
const int inf=~0u>>1,MOD=1e9+7;/*
char *TT,*mo,but[(1<<15)+2];
#define getchar() ((TT==mo&&(mo=(TT=but)+fread(but,1,1<<15,stdin),TT==mo))?-1:*TT++)//*/
inline int rd() {
	int x=0,c=0,f=1;
	for(; c<'0'||c>'9'; c=getchar())f=c!='-';
	for(; c>='0'&&c<='9'; c=getchar())x=x*10+c-'0';
	return f?x:-x;
}
const int N=2100;
char G[N][N];
int t[N][N],a[N][N],b[N][N],c[N][N];
int F(int x,int y,int z,int w){
	return (a[z][w]-a[x][w-1]-a[z][y-1]+a[x-1][y-1])-(b[z][w]-b[x-1][w]-b[z][y]+b[x-1][y])-(c[z][w]-c[x][w]-c[z][y-1]+c[x][y-1]);
}
int main() {
	int n = rd(), m = rd(), T = rd();
	rep(i,1,n)scanf("%s",G[i]+1);
	rep(i,1,n)rep(j,1,m){
		t[i][j] = G[i][j] - '0';
	}
	rep(i,1,n)rep(j,1,m){
		a[i][j]=a[i-1][j]+a[i][j-1]-a[i-1][j-1]+t[i][j];
	}
	rep(i,1,n)rep(j,2,m)b[i][j]=b[i-1][j]+b[i][j-1]-b[i-1][j-1]+(t[i][j-1]&t[i][j]);
	rep(i,2,n)rep(j,1,m)c[i][j]=c[i-1][j]+c[i][j-1]-b[i-1][j-1]+(t[i-1][j]&t[i][j]);
	while(T--) {
		int a = rd(), b = rd(), c = rd(), d = rd();
		printf("%d\n",F(a,b,c,d));
	}
}

Submission Info

Submission Time
Task C - Nuske vs Phantom Thnook
User flukehn
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1459 Byte
Status WA
Exec Time 161 ms
Memory 75516 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:31:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  rep(i,1,n)scanf("%s",G[i]+1);
                              ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 700
Status
WA × 2
AC × 3
WA × 47
Set Name Test Cases
Sample s1.txt, s2.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
01.txt WA 136 ms 75516 KB
02.txt WA 159 ms 75392 KB
03.txt WA 123 ms 75392 KB
04.txt WA 159 ms 75392 KB
05.txt WA 123 ms 75392 KB
06.txt WA 161 ms 75392 KB
07.txt WA 121 ms 75392 KB
08.txt WA 158 ms 75264 KB
09.txt WA 117 ms 75264 KB
10.txt WA 158 ms 75392 KB
11.txt WA 123 ms 75392 KB
12.txt WA 121 ms 49408 KB
13.txt WA 68 ms 74368 KB
14.txt WA 50 ms 10496 KB
15.txt AC 32 ms 6784 KB
16.txt WA 44 ms 9600 KB
17.txt WA 62 ms 73600 KB
18.txt WA 61 ms 58624 KB
19.txt WA 40 ms 9472 KB
20.txt WA 144 ms 73216 KB
21.txt WA 124 ms 73856 KB
22.txt WA 160 ms 75392 KB
23.txt WA 56 ms 17664 KB
24.txt WA 160 ms 75392 KB
25.txt WA 34 ms 8960 KB
26.txt WA 49 ms 13056 KB
27.txt WA 40 ms 9600 KB
28.txt WA 62 ms 58624 KB
29.txt WA 63 ms 73984 KB
30.txt WA 46 ms 9856 KB
31.txt WA 125 ms 74752 KB
32.txt WA 155 ms 74496 KB
33.txt WA 123 ms 75392 KB
34.txt WA 156 ms 74496 KB
35.txt WA 123 ms 75392 KB
36.txt WA 158 ms 75392 KB
37.txt WA 123 ms 75392 KB
38.txt WA 158 ms 75392 KB
39.txt WA 118 ms 74624 KB
40.txt WA 154 ms 74496 KB
41.txt WA 123 ms 75392 KB
42.txt WA 159 ms 75392 KB
43.txt WA 123 ms 75392 KB
44.txt WA 159 ms 75392 KB
45.txt AC 3 ms 6400 KB
46.txt AC 4 ms 8448 KB
47.txt WA 4 ms 8448 KB
48.txt WA 4 ms 8448 KB
s1.txt WA 4 ms 8448 KB
s2.txt WA 4 ms 8448 KB