Submission #1800184
Source Code Expand
#include <algorithm> #include <iostream> #include <cstring> #include <cstdio> #include <cmath> using namespace std; inline int getint() { static char c; while ((c = getchar()) < '0' || c > '9'); int res = c - '0'; while ((c = getchar()) >= '0' && c <= '9') res = res * 10 + c - '0'; return res; } const int MaxN = 2000; const int MaxM = 2000; int n, m, q; int a[MaxN + 2][MaxM + 2]; char s[MaxM + 2]; int sum[3][MaxN + 1][MaxM + 1]; inline int query(int k, int x1, int y1, int x2, int y2) { return sum[k][x2][y2] - sum[k][x2][y1 - 1] - sum[k][x1 - 1][y2] + sum[k][x1 - 1][y1 - 1]; } int main() { cin >> n >> m >> q; for (int i = 1; i <= n; ++i) { scanf("%s", s + 1); for (int j = 1; j <= m; ++j) a[i][j] = s[j] - '0'; } for (int i = 1; i <= n; ++i) for (int j = 1; j <= m; ++j) { sum[0][i][j] = a[i][j]; sum[1][i][j] = a[i][j] && a[i + 1][j]; sum[2][i][j] = a[i][j] && a[i][j + 1]; for (int k = 0; k < 3; ++k) sum[k][i][j] += sum[k][i - 1][j] + sum[k][i][j - 1] - sum[k][i - 1][j - 1]; } while (q--) { int x1 = getint(), y1 = getint(); int x2 = getint(), y2 = getint(); int res = query(0, x1, y1, x2, y2); // cout << res << ' '; res -= query(1, x1, y1, x2 - 1, y2); // cout << res << ' '; res -= query(2, x1, y1, x2, y2 - 1); // cout << res << endl; printf("%d\n", res); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Nuske vs Phantom Thnook |
User | InvUsr |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1429 Byte |
Status | AC |
Exec Time | 136 ms |
Memory | 64384 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:39:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%s", s + 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 | 109 ms | 64000 KB |
02.txt | AC | 133 ms | 63872 KB |
03.txt | AC | 107 ms | 64000 KB |
04.txt | AC | 134 ms | 63744 KB |
05.txt | AC | 110 ms | 64128 KB |
06.txt | AC | 136 ms | 63872 KB |
07.txt | AC | 90 ms | 63744 KB |
08.txt | AC | 120 ms | 63232 KB |
09.txt | AC | 100 ms | 63360 KB |
10.txt | AC | 131 ms | 63744 KB |
11.txt | AC | 107 ms | 64000 KB |
12.txt | AC | 87 ms | 44160 KB |
13.txt | AC | 50 ms | 62080 KB |
14.txt | AC | 45 ms | 7168 KB |
15.txt | AC | 30 ms | 6784 KB |
16.txt | AC | 46 ms | 7040 KB |
17.txt | AC | 51 ms | 62080 KB |
18.txt | AC | 51 ms | 61696 KB |
19.txt | AC | 41 ms | 7168 KB |
20.txt | AC | 112 ms | 62080 KB |
21.txt | AC | 90 ms | 63360 KB |
22.txt | AC | 131 ms | 63744 KB |
23.txt | AC | 49 ms | 14208 KB |
24.txt | AC | 131 ms | 63744 KB |
25.txt | AC | 31 ms | 6784 KB |
26.txt | AC | 42 ms | 11520 KB |
27.txt | AC | 40 ms | 7040 KB |
28.txt | AC | 51 ms | 61696 KB |
29.txt | AC | 49 ms | 62080 KB |
30.txt | AC | 44 ms | 7040 KB |
31.txt | AC | 96 ms | 64384 KB |
32.txt | AC | 120 ms | 64128 KB |
33.txt | AC | 93 ms | 63744 KB |
34.txt | AC | 120 ms | 64000 KB |
35.txt | AC | 93 ms | 63616 KB |
36.txt | AC | 118 ms | 63616 KB |
37.txt | AC | 93 ms | 63616 KB |
38.txt | AC | 118 ms | 63616 KB |
39.txt | AC | 94 ms | 64128 KB |
40.txt | AC | 120 ms | 64000 KB |
41.txt | AC | 96 ms | 63744 KB |
42.txt | AC | 117 ms | 63616 KB |
43.txt | AC | 91 ms | 63232 KB |
44.txt | AC | 118 ms | 63360 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 |