제출 #571646

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
571646		pragmatist	T-Covering (eJOI19_covering)	C++17	5 / 100	64 ms	7928 KiB

covering

/*#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
#pragma GCC target ("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")*/

#include<bits/stdc++.h>

#define sz(v) (int)v.size()
#define ll long long
#define pb push_back
#define x first
#define y second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define nl "\n"

using namespace std;
using pii = pair<int, int>;

const int N = (int)2e5 + 7;
const int inf = (int)1e9 + 7;
const ll INF = (ll)1e18 + 7;
const ll MOD = (ll)1e9;

int n, m, k;
vector<vector<pii> > dir;

void solve() {                    
	cin >> n >> m;
	int a[n + 1][m + 1];
	dir.pb({{-1, 0}, {0, -1}, {0, 1}});
	dir.pb({{1, 0}, {0, -1}, {0, 1}});
	dir.pb({{-1, 0}, {1, 0}, {0, 1}});
	dir.pb({{-1, 0}, {1, 0}, {0, -1}});
	for(int i = 1; i <= n; ++i) {
		for(int j = 1; j <= m; ++j) {
			cin >> a[i][j];
		}
	}
	int ans = 0;
	cin >> k;
	while(k--) {
		int mx = -inf;
		int x, y;
		cin >> x >> y;
		x++, y++;
		for(auto e : dir) {
			int cur = a[x][y];
			for(auto f : e) {
				int i = x + f.x, j = y + f.y;
				if(i < 1 || i > n || j < 1 || j > m) {
					cur = -inf;
					break;
				}		
				cur += a[i][j];
			}
			mx = max(mx, cur);
		}
		ans += mx;
		if(mx == -inf) {
			cout << "No\n";
			return;
		}		
	}
	cout << ans << nl;
}

signed main() {	
	ios_base::sync_with_stdio(NULL);
	cin.tie(0);
	cout.tie(0);
	int test = 1;
	//cin >> test;
	while(test--) {
		solve();
	}
	return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 15
• Subtask 6: 0 / 20
• Subtask 7: 0 / 30