Submission #1586533
Source Code Expand
#include <iostream> #include <algorithm> #include <cstdio> using namespace std; typedef long long ll; const ll mod = 1e9 + 7; int n, m, q, x1, x2, y1, y2; char a[2005][2005]; int dp1[2005][2005], dp2[2005][2005], s[2005][2005]; int sum(int x1, int y1, int x2, int y2) { return s[x2][y2] - s[x2][y1 - 1] - s[x1 - 1][y2] + s[x1 - 1][y1 - 1]; } int edges(int x1, int y1, int x2, int y2) { return (dp1[x2][y2] - dp1[x2][y1] - dp1[x1 - 1][y2] + dp1[x1 - 1][y1]) + (dp2[x2 - 1][y2] - dp2[x2 - 1][y1 - 1] - dp2[x1 - 1][y2] + dp2[x1 - 1][y1 - 1]); } int main() { cin >> n >> m >> q; for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { cin >> a[i][j]; s[i][j] = s[i][j - 1] + s[i - 1][j] + (a[i][j] == '1') - s[i - 1][j - 1]; } } for (int i = 1; i <= n; i++) { for (int j = 1; j <= m; j++) { dp1[i][j] = dp1[i][j - 1] + dp1[i - 1][j] + (a[i][j - 1] == '1' && a[i][j] == '1') - dp1[i - 1][j - 1]; dp2[i][j] = dp2[i][j - 1] + dp2[i - 1][j] + (a[i + 1][j] == '1' && a[i][j] == '1') - dp2[i - 1][j - 1]; } } for (int i = 1; i <= q; i++) { cin >> x1 >> y1 >> x2 >> y2; cout << sum(x1, y1, x2, y2) - edges(x1, y1, x2, y2) << "\n"; } }
Submission Info
Submission Time | |
---|---|
Task | C - Nuske vs Phantom Thnook |
User | HardNut |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1315 Byte |
Status | AC |
Exec Time | 861 ms |
Memory | 52864 KB |
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 | 805 ms | 52480 KB |
02.txt | AC | 861 ms | 52352 KB |
03.txt | AC | 819 ms | 52480 KB |
04.txt | AC | 860 ms | 52224 KB |
05.txt | AC | 825 ms | 52608 KB |
06.txt | AC | 859 ms | 52352 KB |
07.txt | AC | 776 ms | 52224 KB |
08.txt | AC | 826 ms | 52224 KB |
09.txt | AC | 769 ms | 52224 KB |
10.txt | AC | 853 ms | 52224 KB |
11.txt | AC | 808 ms | 52480 KB |
12.txt | AC | 667 ms | 34048 KB |
13.txt | AC | 516 ms | 51072 KB |
14.txt | AC | 525 ms | 7168 KB |
15.txt | AC | 467 ms | 6784 KB |
16.txt | AC | 524 ms | 7040 KB |
17.txt | AC | 525 ms | 51072 KB |
18.txt | AC | 538 ms | 50688 KB |
19.txt | AC | 503 ms | 7168 KB |
20.txt | AC | 812 ms | 51328 KB |
21.txt | AC | 788 ms | 51840 KB |
22.txt | AC | 839 ms | 52224 KB |
23.txt | AC | 535 ms | 12160 KB |
24.txt | AC | 850 ms | 52224 KB |
25.txt | AC | 465 ms | 6784 KB |
26.txt | AC | 514 ms | 9472 KB |
27.txt | AC | 510 ms | 7040 KB |
28.txt | AC | 538 ms | 50688 KB |
29.txt | AC | 518 ms | 51072 KB |
30.txt | AC | 522 ms | 7040 KB |
31.txt | AC | 786 ms | 52864 KB |
32.txt | AC | 836 ms | 52480 KB |
33.txt | AC | 792 ms | 52224 KB |
34.txt | AC | 822 ms | 52480 KB |
35.txt | AC | 786 ms | 52096 KB |
36.txt | AC | 834 ms | 51968 KB |
37.txt | AC | 792 ms | 52096 KB |
38.txt | AC | 821 ms | 51968 KB |
39.txt | AC | 770 ms | 52608 KB |
40.txt | AC | 833 ms | 52480 KB |
41.txt | AC | 787 ms | 52224 KB |
42.txt | AC | 845 ms | 52096 KB |
43.txt | AC | 797 ms | 51712 KB |
44.txt | AC | 823 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 |