제출 #629660

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
629660		lovrot	T-Covering (eJOI19_covering)	C++11	15 / 100	20 ms	24984 KiB

covering

#include <bits/stdc++.h> 
#include <unistd.h>

#define X first
#define Y second
#define ll long long
#define pii pair<int, int>
#define pb push_back
#define vec vector
#define pri(i, poc, n, pov) for(int i = (int) poc; i < (int) n; i += (int) pov)
#define od(i, poc, n, pov) for(int i = (int) poc; i > (int) n; i -= (int) pov)

using namespace std;

const int INF = 1e9;
const int lx[8] = {1, -1, 0, 0, -1, 1, 1, -1};
const int ly[8] = {0, 0, 1, -1, -1, 1, -1, 1};
const int N = 1e6 + 10;

int n, m, q;
int cdeg[N], vis[N];

vec<vec<int>> mat, spec;
vec<vec<bool>> bio, xp;
vec<pii> vx;
vec<int> g[N];

void fail(){ 
	cout << "No\n";
	exit(0);
}

void success(){ 
	int ans = 0;
	pri(i, 1, n + 1, 1) 
		pri(j, 1, m + 1, 1)
			ans += (bio[i][j] ? mat[i][j] : 0);
	cout << ans << "\n";
}

void mark4(int x, int y){ 
	bio[x][y] = 1;
	pri(i, 0, 4, 1)
		bio[x + lx[i]][y + ly[i]] = 1;
}

void countBan(int x, int y){ 
	int cnt = bio[x][y];
	pri(i, 0, 4, 1){ 
		cnt += bio[x + lx[i]][y + ly[i]];
	}
	if(cnt > 1) fail(); 
}

void tryPlace(int x, int y){ 
	countBan(x, y);
	mark4(x, y);
}

pii findLow(int x, int y){ 
	pii ret;
	int mn = INF;
	pri(i, 0, 4, 1)
		if(mat[x + lx[i]][y + ly[i]] < mn){ 
			mn = mat[x + lx[i]][y + ly[i]];
			ret = {x + lx[i], y + ly[i]};
		}
	return ret;
}

vec<vec<int>> createMat(int h, int w){ 
	vec<vec<int>> ret;
	pri(i, 0, h, 1){
		vec<int> line;
		pri(j, 0, w, 1) 
			line.pb(0);
		ret.pb(line);
	}
	return ret;
}

vec<vec<bool>> createBio(int h, int w){ 
	vec<vec<bool>> ret;
	pri(i, 0, h, 1){
		vec<bool> line;
		pri(j, 0, w, 1) 
			line.pb(0);
		ret.pb(line);
	}
	return ret;
}

void init(){ 
	cin >> n >> m;
	
	bio = createBio(n + 2, m + 2);	
	xp = createBio(n + 2, m + 2);
	mat = createMat(n + 2, m + 2);
	spec = createMat(n + 2, m + 2);

	mat[0][0] = INF;

	pri(i, 1, n + 1, 1)
		pri(j, 1, m + 1, 1) 
			cin >> mat[i][j];
	pri(i, 0, n + 2, 1) 
		xp[i][0] = xp[i][m + 1] = 1;
	pri(i, 0, m + 2, 1){ 
		xp[0][i] = xp[n + 1][i] = 1;
	}

	cin >> q;

	pri(i, 0, q, 1){ 
		int x, y;
		cin >> x >> y;
		x++;
		y++;
		vx.pb({x, y});
		xp[x][y] = true;
		spec[x][y] = i + 1;
	}
}

pii rek(int u){ 
	if(vis[u]) return {0, 0};
	vis[u] = true;
	tryPlace(vx[u].X, vx[u].Y);
	pii p = findLow(vx[u].X, vx[u].Y);
	for(int v : g[u]){ 
		if(vis[v]) continue;
		pii res = rek(v);
		if(mat[p.X][p.Y] > mat[res.X][res.Y])
			swap(p, res);
	}
	return p;
}

bool isCyc(int u, int p){
	if(vis[u]) return true; 
	vis[u] = true;
	for(int v : g[u]){ 
		if(v != p && vis[v]){ 
			vis[u] = false;
			return true;
		}
		if(v == p) continue;
		if(isCyc(v, u)) {
			vis[u] = false;
			return true;
		}
	}
	vis[u] = false;
	return false;
}

pii rek2(int u){ 
	pii ret = {1, g[u].size()};
	vis[u] = true;
	mark4(vx[u].X, vx[u].Y);
	for(int v : g[u]){ 
		//cout << u << " " << v << "\n";
		if(vis[v]) continue;
		pii res = rek2(v);
		ret.X += res.X;
		ret.Y += res.Y;
	}	
	return ret;
}

int main(){ 
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	init();

	//close edges
	pri(i, 0, q, 1){ 
		int x = vx[i].X;
		int y = vx[i].Y;
		pri(j, 0, 8, 1){ 
			int nx = x + lx[j];
			int ny = y + ly[j];
			if(xp[nx][ny]){ 
				cdeg[i]++;
			}
			if(j < 4){ 
				nx += lx[j];
				ny += ly[j];
				if(nx > 0 && nx < n + 1 && ny > 0 && ny < m + 1 && spec[nx][ny])
					g[i].pb(spec[nx][ny] - 1);
			}
		}	
		if(cdeg[i] > 1) fail();
		if(cdeg[i] == 1){
			vis[i] = true;	
			mark4(x, y);
		} 
	}

	pri(i, 0, q, 1){ 
		if(cdeg[i] == 1){ 
			for(int v : g[i])
				rek(v);
		}
	}

	
	pri(i, 0, q, 1){ 
		if(vis[i]) continue;
		bool res = isCyc(i, -1);
		//cout << i << " isCyc " << res << "\n";
		if(!res){ 
			pii p = rek(i);
			bio[p.X][p.Y] = false;
		} else { 
			pii ret = rek2(i);
			// cout << "node cnt: " << ret.X << " deg " << ret.Y / 2 << "\n";
			if(ret.X - ret.Y / 2 < 0) fail();	
		}
	}
	// pri(i, 1, n + 1, 1)
	// 	pri(j, 1, m + 1, 1)
	// 		cout << bio[i][j] << " \n"[j == m];
	success();
	return 0;
}

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