답안 #39001

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
39001 2018-01-09T04:28:02 Z RockyB UFO (IZhO14_ufo) C++14
50 / 100
203 ms 10724 KB
/// In The Name Of God

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")

#include <bits/stdc++.h>

#define f first
#define s second

#define pb push_back
#define pp pop_back
#define mp make_pair

#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()

#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define nl '\n'
#define ioi exit(0);

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

const int N = (int)5e5 + 7, inf = (int)1e9 + 7, mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1}, dy[] = {0, 1, 0, -1, 1, -1, 1, -1};

using namespace std;

int n, m, r, k, p;
vector < vector <int> > a;
int get(int x1, int y1) {
	int res = 0;
	int x2 = x1 + p - 1, y2 = y1 + p - 1;
	for (int i = x1; i <= x2; i++) {
		for (int j = y1; j <= y2; j++) {
			res += a[i][j];
		}
	}
	return res;
}
int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
	#endif
	Kazakhstan
	cin >> n >> m >> r >> k >> p;
	a.resize(n + 1);
	for (int i = 1; i <= n; i++) {
		a[i].resize(m + 1);
		for (int j = 1; j <= m; j++) {
			cin >> a[i][j];
		}
	}
	for (int t = 1; t <= k; t++) {
		char c;
		int x, y;
		cin >> c >> x >> y;
		if (c == 'N') {
			for (int i = n; i >= max(1, n - r + 1); i--) {
				if (a[i][x] >= y) a[i][x]--;
			}
		}
		else if (c == 'S') {
			for (int i = 1; i <= min(n, r); i++) {
				if (a[i][x] >= y) a[i][y]--;
			}
		}
		else if (c == 'E') {
			for (int i = 1; i <= min(m, r); i++) {
				if (a[x][i] >= y) a[x][i]--;
			}
		}
		else {
			for (int i = m; i >= max(1, m - r + 1); i--) {
				if (a[x][i] >= y) a[x][i]--;
			}
		}
	}
	int ans = 0;
	for (int i = 1; i <= n - p + 1; i++) {
		for (int j = 1; j <= m - p + 1; j++) {
			ans = max(ans, get(i, j));
		}
	}
	cout << ans;
	ioi
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2176 KB Output is correct
2 Incorrect 0 ms 2176 KB Output isn't correct
3 Runtime error 0 ms 2176 KB Execution killed because of forbidden syscall writev (20)
4 Runtime error 3 ms 2176 KB Execution killed because of forbidden syscall writev (20)
5 Incorrect 13 ms 2308 KB Output isn't correct
6 Runtime error 76 ms 4024 KB Execution killed because of forbidden syscall writev (20)
7 Correct 156 ms 6096 KB Output is correct
8 Correct 123 ms 6096 KB Output is correct
9 Incorrect 133 ms 6096 KB Output isn't correct
10 Correct 123 ms 6096 KB Output is correct
11 Incorrect 113 ms 5952 KB Output isn't correct
12 Correct 119 ms 6096 KB Output is correct
13 Correct 166 ms 10724 KB Output is correct
14 Correct 109 ms 5952 KB Output is correct
15 Incorrect 143 ms 6096 KB Output isn't correct
16 Correct 159 ms 5952 KB Output is correct
17 Incorrect 203 ms 10724 KB Output isn't correct
18 Correct 146 ms 10536 KB Output is correct
19 Incorrect 136 ms 6096 KB Output isn't correct
20 Correct 126 ms 6084 KB Output is correct