답안 #345354

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
345354	2021-01-07T07:56:01 Z	l3nl3	UFO (IZhO14_ufo)	C++14	10 / 100	2000 ms	42676 KB

ufo

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>  
 
#define exit exit(false)
 
//#define here() cerr << "herewego\n";
#define show(x) cerr << #x << ": " << x << '\n';
 
#define int long long
//#define double long double
 
#define all(a) a.begin(), a.end()
#define whole(a, p, q) a+p, a+p+q
 
#define ioio() ios_base::sync_with_stdio (0); cin.tie (0); cout.tie (0);
 
using namespace std;
 
//using namespace __gnu_pbds;   
//typedef tree <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;  
 
const int mxsz = 1e4 + 7;
 
int n, m, r, k , p, a[mxsz][mxsz], pr[mxsz][mxsz], mx;
char tp;
int x, y, h, sum, cn;
 
signed main () { ioio();
	cin >> n >> m >> r >> k >> p;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			cin >> a[i][j];
			sum += a[i][j];
		}
	}
	while (k--) {
		cin >> tp >> x >> h;
		x++;
		cn = r;
		y = 1;
		if (tp == 'N') {
			while (y <= n && cn > 0) {
				if (a[y][x] >= h) {
					a[y][x]--;
					cn--;
				}
				y++;
			}
		} else if (tp == 'W') {
			while (y <= m && cn > 0) {
				if (a[x][y] >= h) {
					a[x][y]--;
					cn--;
				}
				y++;
			}
		} else if (tp == 'S') {
			y = n;
			while (y >= 1 && cn > 0) {
				if (a[y][x] >= h) {
					a[y][x]--;
					cn--;
				}
				y--;
			}
		} else {
			y = m;
			while (y >= 1 && cn > 0) {
				if (a[x][y] >= h) {
					a[x][y]--;
					cn--;
				}
				y--;
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			pr[i][j] = pr[i-1][j] + a[i][j];
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			int pj = j;
			int sum = 0;
			while ((pj - j + 1) <= p) {
				sum += pr[i+(p-1)][pj] - pr[i-1][pj];
				pj++;
			}
			mx = max (mx, sum);
		}
	}
	cout << mx;
}

Subtask #1

10.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	492 KB	Output is correct
3	Incorrect	1 ms	748 KB	Output isn't correct
4	Incorrect	5 ms	1388 KB	Output isn't correct
5	Incorrect	31 ms	1260 KB	Output isn't correct
6	Incorrect	77 ms	13804 KB	Output isn't correct
7	Execution timed out	2071 ms	1772 KB	Time limit exceeded
8	Execution timed out	2056 ms	1772 KB	Time limit exceeded
9	Execution timed out	2077 ms	2284 KB	Time limit exceeded
10	Execution timed out	2065 ms	1772 KB	Time limit exceeded
11	Execution timed out	2084 ms	1772 KB	Time limit exceeded
12	Execution timed out	2053 ms	1772 KB	Time limit exceeded
13	Runtime error	70 ms	42636 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
14	Incorrect	1861 ms	3308 KB	Output isn't correct
15	Execution timed out	2080 ms	1836 KB	Time limit exceeded
16	Execution timed out	2067 ms	1792 KB	Time limit exceeded
17	Runtime error	86 ms	42676 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
18	Runtime error	78 ms	42476 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
19	Execution timed out	2060 ms	2284 KB	Time limit exceeded
20	Execution timed out	2033 ms	8224 KB	Time limit exceeded