Submission #2673241
Source Code Expand
#include <bits/stdc++.h> using namespace std; const int MAXN = 2005; int a[MAXN][MAXN], c[MAXN][MAXN], d[MAXN][MAXN]; char str[MAXN][MAXN]; int n, m, q; inline int read() { int a = 0, c; do c = getchar(); while (!isdigit(c)); while (isdigit(c)) { a = a*10+c-'0'; c = getchar(); } return a; } int main() { n = read(), m = read(), q = read(); for (int i = 1; i <= n; i++) scanf("%s", str[i]+1); for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { a[i][j] = str[i][j]-'0'; if (j < m) c[i][j] = (str[i][j]==str[i][j+1]&&str[i][j]=='1'); if (i < n) d[i][j] = (str[i][j]==str[i+1][j]&&str[i][j]=='1'); a[i][j] += a[i-1][j]+a[i][j-1]-a[i-1][j-1]; c[i][j] += c[i-1][j]+c[i][j-1]-c[i-1][j-1]; d[i][j] += d[i-1][j]+d[i][j-1]-d[i-1][j-1]; } } for (int i = 1; i <= q; i++) { int x1 = read(), y1 = read(), x2 = read(), y2 = read(); int tot = a[x2][y2]-a[x1-1][y2]-a[x2][y1-1]+a[x1-1][y1-1]; int link_lr = c[x2][y2-1]-c[x1-1][y2-1]-c[x2][y1-1]+c[x1-1][y1-1]; int link_ud = d[x2-1][y2]-d[x1-1][y2]-d[x2-1][y1-1]+d[x1-1][y1-1]; printf("%d\n", tot-link_lr-link_ud); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Nuske vs Phantom Thnook |
User | ljt12138 |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1172 Byte |
Status | AC |
Exec Time | 119 ms |
Memory | 52864 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:25:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%s", str[i]+1); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 700 / 700 | ||||
Status |
|
|
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 | AC | 91 ms | 52480 KB |
02.txt | AC | 118 ms | 52352 KB |
03.txt | AC | 92 ms | 52352 KB |
04.txt | AC | 115 ms | 52224 KB |
05.txt | AC | 96 ms | 52608 KB |
06.txt | AC | 115 ms | 52224 KB |
07.txt | AC | 91 ms | 52224 KB |
08.txt | AC | 117 ms | 51712 KB |
09.txt | AC | 87 ms | 51840 KB |
10.txt | AC | 119 ms | 52224 KB |
11.txt | AC | 93 ms | 52480 KB |
12.txt | AC | 84 ms | 35968 KB |
13.txt | AC | 51 ms | 51072 KB |
14.txt | AC | 42 ms | 7168 KB |
15.txt | AC | 31 ms | 6784 KB |
16.txt | AC | 41 ms | 7040 KB |
17.txt | AC | 50 ms | 51072 KB |
18.txt | AC | 53 ms | 50688 KB |
19.txt | AC | 38 ms | 7168 KB |
20.txt | AC | 107 ms | 50048 KB |
21.txt | AC | 90 ms | 51840 KB |
22.txt | AC | 115 ms | 52224 KB |
23.txt | AC | 48 ms | 13696 KB |
24.txt | AC | 117 ms | 52224 KB |
25.txt | AC | 31 ms | 6784 KB |
26.txt | AC | 41 ms | 9216 KB |
27.txt | AC | 37 ms | 7040 KB |
28.txt | AC | 57 ms | 50688 KB |
29.txt | AC | 50 ms | 51072 KB |
30.txt | AC | 41 ms | 7040 KB |
31.txt | AC | 93 ms | 52864 KB |
32.txt | AC | 116 ms | 52480 KB |
33.txt | AC | 91 ms | 52224 KB |
34.txt | AC | 119 ms | 52480 KB |
35.txt | AC | 90 ms | 51968 KB |
36.txt | AC | 114 ms | 51968 KB |
37.txt | AC | 91 ms | 51968 KB |
38.txt | AC | 113 ms | 51968 KB |
39.txt | AC | 92 ms | 52608 KB |
40.txt | AC | 116 ms | 52480 KB |
41.txt | AC | 94 ms | 52224 KB |
42.txt | AC | 113 ms | 51968 KB |
43.txt | AC | 89 ms | 51584 KB |
44.txt | AC | 116 ms | 51840 KB |
45.txt | AC | 2 ms | 6400 KB |
46.txt | AC | 2 ms | 6400 KB |
47.txt | AC | 2 ms | 6400 KB |
48.txt | AC | 2 ms | 6400 KB |
s1.txt | AC | 2 ms | 6400 KB |
s2.txt | AC | 2 ms | 6400 KB |