oj.uz

Submission #337619

# Submission time Handle Problem Language Result Execution time Memory
337619 2020-12-21T09:24:01 Z kutbilim_one UFO (IZhO14_ufo) C++14
0 / 100
 5 ms 1900 KB 
/** kutbilim.one **/
#include <bits/stdc++.h>
 
using namespace std;
 
#define all(x) x.begin(),x.end()
//#define int long long
#define endl '\n'
                               
ifstream in("test.txt"); 
#define cin in                   
 
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int n, m, r, k, p;
    cin >> n >> m >> r >> k >> p;
    
    vector< vector<int> > a(n+1, vector<int>(m+1));
    for(int i = 1; i <= n; i++)
	for(int j = 1; j <= m; j++) cin >> a[i][j];
 
    vector<int> maxi(n+1, -1), maxj(m+1, -1);
	while(k--){
		char side;
		int pos, h;
		cin >> side >> pos >> h;
 
		int shots = r;
		if(side == 'W' && (maxi[pos] == -1 || maxi[pos] >= h)){
			for(int j = 1; j <= m && shots > 0; j++){
				if(a[pos][j] >= h) a[pos][j]--, shots--;
				if(maxi[pos] == -1 || maxi[pos] < a[pos][j]) maxi[pos] = a[pos][j];
			}
		}else if(side == 'E' && (maxi[pos] == -1 || maxi[pos] >= h)){
		    for(int j = m; j >= 1 && shots > 0; j--){
				if(a[pos][j] >= h) a[pos][j]--, shots--;
				if(maxi[pos] == -1 || maxi[pos] < a[pos][j]) maxi[pos] = a[pos][j];
			}
		}else if(side == 'N' && (maxj[pos] == -1 || maxj[pos] >= h)){
		    for(int i = 1; i <= n && shots > 0; i++){
				if(a[i][pos] >= h) a[i][pos]--, shots--;
				if(maxj[pos] == -1 || maxj[pos] < a[i][pos]) maxj[pos] = a[i][pos];
			}	
		}else if(side == 'S' && (maxj[pos] == -1 || maxj[pos] >= h)){
		    for(int i = n; i >= 1 && shots > 0; i--){
				if(a[i][pos] >= h) a[i][pos]--, shots--;
				if(maxj[pos] == -1 || maxj[pos] < a[i][pos]) maxj[pos] = a[i][pos];
			}
		}
	}
 
	vector< vector<int> > sums(n+2, vector<int>(m+1));
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= m; j++){
        	sums[i][j] += a[i][j] + sums[i][j-1];
        }
	}
	for(int i = 1; i <= m; i++){
		for(int j = 1; j <= n; j++){
        	sums[j][i] += sums[j-1][i];
        }
	}
	                  
	int maxx = 0;
	for(int i = p; i <= n; i++){
		for(int j = p; j <= m; j++){
			maxx = max(maxx, sums[i][j]-sums[i][j-p]-sums[i-p][j]+sums[i-p][j-p]);	
		} 
	}
	    
    cout << maxx;
 
    return 0;
}

Subtask #1
0 / 100.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 1772 KB Output isn't correct
2 Incorrect 4 ms 1824 KB Output isn't correct
3 Incorrect 4 ms 1772 KB Output isn't correct
4 Incorrect 5 ms 1772 KB Output isn't correct
5 Incorrect 4 ms 1772 KB Output isn't correct
6 Incorrect 4 ms 1900 KB Output isn't correct
7 Incorrect 4 ms 1772 KB Output isn't correct
8 Incorrect 4 ms 1772 KB Output isn't correct
9 Incorrect 4 ms 1772 KB Output isn't correct
10 Incorrect 4 ms 1772 KB Output isn't correct
11 Incorrect 4 ms 1772 KB Output isn't correct
12 Incorrect 5 ms 1772 KB Output isn't correct
13 Incorrect 4 ms 1772 KB Output isn't correct
14 Incorrect 4 ms 1772 KB Output isn't correct
15 Incorrect 4 ms 1772 KB Output isn't correct
16 Incorrect 4 ms 1772 KB Output isn't correct
17 Incorrect 4 ms 1772 KB Output isn't correct
18 Incorrect 4 ms 1772 KB Output isn't correct
19 Incorrect 4 ms 1772 KB Output isn't correct
20 Incorrect 4 ms 1772 KB Output isn't correct