# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
338070 | boykut | UFO (IZhO14_ufo) | C++14 | 895 ms | 159780 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m, k, r, p;
cin >> n >> m >> r >> k >> p;
vector < vector <int> > a(1+n, vector <int> (1+m, 0));
vector < vector <int> > sum(1+n, vector <int> (1+m, 0));
set <int> col[1+m];
set <int> row[1+n];
set <int> del;
set <int>::iterator it;
int temp, cnt;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> a[i][j];
if (a[i][j] != 0) {
row[i].insert(j);
col[j].insert(i);
}
}
}
for (int tmp = k; tmp--;) {
char c; cin >> c;
int pos, h; cin >> pos >> h;
if (c == 'N') {
if (col[pos].empty()) continue;
it = col[pos].begin();
int cnt = 0;
for (temp = col[pos].size(); temp--;) {
a[*it][pos]--;
if (a[*it][pos] == 0) del.insert(*it);
it++;
cnt++;if(cnt==r)break;
}
for (auto i: del) {
col[pos].erase(i);
row[i].erase(pos);
}
} else if (c == 'S') {
if (col[pos].empty()) continue;
it = col[pos].end(); it--;
int cnt = 0;
for (temp = col[pos].size(); temp--;) {
a[*it][pos]--;
if (a[*it][pos] == 0) del.insert(*it);
it--;
cnt++;if(cnt==r)break;
}
for (auto i: del) {
col[pos].erase(i);
row[i].erase(pos);
}
} else if (c == 'W') {
if (row[pos].empty()) continue;
it = row[pos].begin();
int cnt = 0;
for (temp = row[pos].size(); temp--;) {
a[pos][*it]--;
if (a[pos][*it] == 0) del.insert(*it);
it++;
cnt++;if(cnt==r)break;
}
for (auto i: del) {
row[pos].erase(i);
col[i].erase(pos);
}
} else {
if (row[pos].empty()) continue;
it = row[pos].end(); it--;
int cnt = 0;
for (temp = row[pos].size(); temp--;) {
a[pos][*it]--;
if (a[pos][*it] == 0) del.insert(*it);
it--;
cnt++;if(cnt==r)break;
}
for (auto i: del) {
row[pos].erase(i);
col[i].erase(pos);
}
}
del.clear();
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
sum[i][j] = a[i][j];
sum[i][j] += sum[i-1][j];
sum[i][j] += sum[i][j-1];
sum[i][j] -= sum[i-1][j-1];
}
}
int ans = 0, A, i2, j2;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
i2 = i + p - 1, j2 = j + p - 1;
if (i2 <= n && j2 <= m) {
A = sum[i2][j2];
A -= sum[i2][j-1];
A -= sum[i-1][j2];
A += sum[i-1][j-1];
if (A > ans)
ans = A;
}
}
}
cout << ans << '\n';
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |