제출 #464402

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
464402		amunduzbaev	T-Covering (eJOI19_covering)	C++14	0 / 100	9 ms	1868 KiB

covering

#include "bits/stdc++.h"
using namespace std;

#define int long long

void solve(){
	int n, m; cin>>n>>m;
	vector<vector<int>> a(n, vector<int>(m));
	vector<vector<int>> is(n, vector<int>(m));
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			cin>>a[i][j];
		}
	} 
	int k; cin>>k;
	vector<array<int, 2>> cc(k);
	for(int i=0;i<k;i++) cin>>cc[i][0]>>cc[i][1];

	int ch[4][2] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
	int ch2[4][2] = {{1, 1}, {1, -1}, {-1, 1}, {-1, -1}};
	for(int i=0;i<k;i++){
		is[cc[i][0]][cc[i][1]] = 1;
	}
	int res = 0;
	auto check = [&](int i, int j) -> bool{
		return (~i && i < n && ~j && j < m);
	}; 
	
	set<array<int, 2>> ss;
	for(int t=0;t<k;t++){
		int i = cc[t][0], j = cc[t][1], cnt = 0;
		int sum = a[i][j], mn = 1e3;
		vector<array<int, 3>> aa;
		for(int t=0;t<4;t++){
			int x = i + ch[t][0], y = j + ch[t][1];
			if(!check(x, y)) cnt++;
			else if(is[x][y]) cnt++;
			else sum += a[x][y], mn = min(mn, a[x][y]), aa.push_back({x, y, a[x][y]});
		}
		
		int cnt2 = 0;
		for(int t=0;t<4;t++){
			int x = i + ch2[t][0], y = j + ch2[t][1];
			if(!check(x, y)) cnt2++;
			else if(is[x][y]) cnt2++;
		}
		
		if(cnt2 > 1 || cnt > 1 || (cnt && cnt2)){
			cout<<"No\n";
			return;
		} if(cnt){
			res = res + sum;
		} else if(cnt2){
			res += a[cc[t][0]][cc[t][1]];
			for(auto x : aa){
				if(ss.count({x[0], x[1]})) continue;
				res += x[2];
				ss.insert({x[0], x[1]});
			}
		} else {
			res = res + sum - mn;
		}
	} cout<<res<<"\n";
}

signed main(){
	ios_base::sync_with_stdio(0); cin.tie(0);
	int t = 1;
	//~ cin>>t;
	while(t--) solve();
}

• Subtask 1: 0 / 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