oj.uz

Submission #528711

# Submission time Handle Problem Language Result Execution time Memory
528711 2022-02-21T07:30:47 Z colazcy Domino (COCI15_domino) C++17
130 / 160
 2271 ms 172856 KB 
#include <iostream>
#include <queue>
#include <algorithm>
#include <cassert>
#include <cstring>
#define let const auto
#define rep(name,beg,end) for(auto lim_##name = end,name = beg;name <= lim_##name;name++)
#define per(name,beg,end) for(auto lim_##name = end,name = beg;name >= lim_##name;name--)
#define repn(lim) for(auto REPN_LIM = lim,REPN = 1;REPN <= REPN_LIM;REPN++)
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define trace() debug("Line : %d, Function : %s\n",__LINE__,__FUNCTION__)
using ll = long long;
constexpr int maxn = 2e3 + 10,dx[] = {-1,1,0,0},dy[] = {0,0,-1,1};
namespace mcmf{
	constexpr int maxn = 233,maxm = 2333,inf = 0x3f3f3f3f;
	struct Edge{
		int u,v,cap,cost;
	}edges[maxm];
	int head[maxn],nxt[maxm],tot = 1;
	void addedge(const int u,const int v,const int cap,const int cost){
		// debug("%d %d %d %d\n",u,v,cap,cost);
		edges[++tot] = Edge{u,v,cap,cost};
		nxt[tot] = head[u];
		head[u] = tot;
		edges[++tot] = Edge{v,u,0,-cost};
		nxt[tot] = head[v];
		head[v] = tot;
	}
	std::queue<int> q;
	int a[maxn],d[maxn],pre[maxn];
	bool inq[maxn];
	bool spfa(const int s,const int t,int &flow,int &cost){
		std::fill(a + 1,a + 1 + t,-1);
		std::fill(d + 1,d + 1 + t,-inf);
		q.push(s); inq[s] = true;
		a[s] = 0x3f3f3f3f; d[s] = 0;
		while(!q.empty()){
			let u = q.front(); q.pop(),inq[u] = false;
			for(int i = head[u];i;i = nxt[i]){
				let &[u,v,cap,cost] = edges[i];
				if(cap && d[u] + cost > d[v]){
					d[v] = d[u] + cost;
					a[v] = std::min(cap,a[u]);
					pre[v] = i;
					if(!inq[v])q.push(v),inq[v] = true;
				}
			}
		}
		if(a[t] == -1)return false;
		let f = a[t],c = d[t];
		if(c < 0)return false;
		flow += f;
		cost += f * c;
		for(int i = pre[t];i;i = pre[edges[i].u])
			edges[i].cap -= f,
			edges[i ^ 1].cap += f;
		return true;
	}
	std::pair<int,int> mcmf(const int s,const int t){
		std::pair<int,int> res;
		while(spfa(s,t,res.first,res.second));
		return res;
	}
}
ll sum;
bool valid[maxn][maxn];
int n,k,tot,val[maxn][maxn],encode[maxn][maxn],col[maxn][maxn];
std::vector<std::pair<std::pair<int,int>,std::pair<int,int>>> seq;
bool chk(const int x,const int y){return x >= 1 && x <= n && y >= 1 && y <= n;}
void dfs(const int x,const int y){
	for(int i = 0;i < 4;i++){
		let nx = x + dx[i],ny = y + dy[i];
		if(valid[nx][ny] && col[nx][ny] == -1)col[nx][ny] = col[x][y] ^ 1,dfs(nx,ny);
	}
}
int main(){
// #ifndef ONLINE_JUDGE
// 	std::freopen("fufu.in","r",stdin);
// #endif
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	std::cin >> n >> k;
	rep(i,1,n)
		rep(j,1,n)
			std::cin >> val[i][j],sum += val[i][j];
	seq.reserve(n * n);
	rep(x,1,n - 1)
		rep(y,1,n - 1)
			seq.emplace_back(std::make_pair(x,y),std::make_pair(x,y + 1)),
			seq.emplace_back(std::make_pair(x,y),std::make_pair(x + 1,y));
	std::sort(seq.begin(),seq.end(),[](let &a,let &b){
		return 	val[a.first.first][a.first.second] + val[a.second.first][a.second.second] >
				val[b.first.first][b.first.second] + val[b.second.first][b.second.second];
	});
	// rep(x,1,n)
		// rep(y,1,n)
			// valid[x][y] = true;
	for(int i = 0;i < 7 * k - 6 && i < (int)seq.size();i++){
		let [x1,y1] = seq[i].first;
		let [x2,y2] = seq[i].second;
		valid[x1][y1] = valid[x2][y2] = true;
	}
	// rep(x,1,n)
		// rep(y,1,n)
			// if(valid[x][y])debug("%d %d\n",x,y);
	std::memset(col,-1,sizeof(col));
	rep(x,1,n)
		rep(y,1,n)
			if(valid[x][y] && col[x][y] == -1)
				col[x][y] = 0,
				dfs(x,y);
	int tot = 0;
	rep(x,1,n)
		rep(y,1,n)
			if(valid[x][y])encode[x][y] = ++tot;
	let s = ++tot,t = ++tot;
	rep(x,1,n)
		rep(y,1,n)
			if(valid[x][y]){
				if(col[x][y] == 0){
					mcmf::addedge(s,encode[x][y],1,val[x][y]);
					for(int i = 0;i < 4;i++){
						let nx = x + dx[i],ny = y + dy[i];
						if(col[nx][ny] == 1)
							mcmf::addedge(encode[x][y],encode[nx][ny],1,0);
					}
				}else if(col[x][y] == 1)mcmf::addedge(encode[x][y],t,1,val[x][y]);
			}
	let ss = ++tot;
	mcmf::addedge(ss,s,k,0);
	let [flow,cost] = mcmf::mcmf(ss,t);
	std::cout << sum - cost << "\n";	
	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 91 ms 27896 KB Output is correct
2 Correct 58 ms 27904 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 16456 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2238 ms 172280 KB Output is correct
2 Correct 895 ms 172804 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 16204 KB Output is correct
2 Correct 7 ms 16204 KB Output is correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1072 ms 107132 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 381 ms 59248 KB Output is correct
2 Correct 220 ms 59344 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2214 ms 172536 KB Output is correct
2 Correct 858 ms 169080 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 16688 KB Output is correct
2 Correct 9 ms 16460 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2185 ms 172612 KB Output is correct
2 Correct 870 ms 172792 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 17188 KB Output is correct
2 Correct 9 ms 16992 KB Output is correct

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 16076 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #12
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2191 ms 172656 KB Output is correct
2 Correct 892 ms 172856 KB Output is correct

Subtask #13
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 16912 KB Output is correct
2 Correct 11 ms 16724 KB Output is correct

Subtask #14
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 397 ms 59512 KB Output is correct
2 Correct 226 ms 59236 KB Output is correct

Subtask #15
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 16204 KB Output is correct
2 Correct 7 ms 16172 KB Output is correct

Subtask #16
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2271 ms 172652 KB Output is correct
2 Correct 928 ms 172800 KB Output is correct