oj.uz

Submission #875908

# Submission time Handle Problem Language Result Execution time Memory
875908 2023-11-20T18:00:57 Z serifefedartar Domino (COCI15_domino) C++17
160 / 160
 1227 ms 392616 KB 
#include <bits/stdc++.h>
using namespace std;

#define fast ios::sync_with_stdio(0);cin.tie(0);
#define s second
#define f first
typedef long long ll;
const ll MOD = 998244353;
const ll LOGN = 20; 
const ll MAXN = 5e6 + 101;

struct Edge {
	int to;
	short cost;
	char cap;
	Edge(int _to, short _cost, char _cap) : to(_to), cost(_cost), cap(_cap) { }
}; 

struct Flow {
	vector<Edge> edges;
	vector<int> from, nxt, boss;
	vector<short> dist;
	int n_, Q, source, terminal;
	Flow(int n) {
		Q = -1;
		n_ = n;
		dist = vector<short>(n);
		boss = vector<int>(n, -1);
		from = vector<int>(n);
	}
	void addEdge(int from, int to, int cost, int cap) {
		Q++;
		edges.push_back(Edge(to, cost, cap));
		nxt.push_back(boss[from]);
		boss[from] = Q;
		Q++;
		edges.push_back(Edge(from, -cost, 0));
		nxt.push_back(boss[to]); 
		boss[to] = Q;
	}
	bool SPFA() {
		queue<int> q;
		vector<bool> que(n_, 0); 
		for (int i = 0; i < dist.size(); i++)
			dist[i] = 10000;

		dist[source] = 0;
		que[source] = 1;
		q.push(source);
		while (!q.empty()) {
			int node = q.front();
			q.pop();
			que[node] = false;

			for (int u = boss[node]; u >= 0; u = nxt[u]) {
				if (edges[u].cap && dist[edges[u].to] > edges[u].cost + dist[node]) {
					dist[edges[u].to] = edges[u].cost + dist[node];
					from[edges[u].to] = u;
					if (!que[edges[u].to]) {
						q.push(edges[u].to);
						que[edges[u].to] = true;
					}
				}
			}
		}
		return (dist[terminal] != 10000);
	}
	ll minCost() {
		ll cost = 0;
		while (SPFA()) {
			cost += dist[terminal];
			int now = terminal;

			while (now != source) {
				int edge_id = from[now];
				int from = edges[edge_id ^ 1].to;
				now = from;
				edges[edge_id].cap--;
				edges[edge_id ^ 1].cap++;
			}
		}
		return cost;
	}
};

short grid[2005][2005];
int main() {
	fast
	int N, K;
	cin >> N >> K;

	ll ans = 0;
	for (int i = 0; i < N; i++) {
		for (int j = 1; j <= N; j++) {
			cin >> grid[i][j];
			ans += grid[i][j];
		}
	}

	Flow F = Flow(N * N + 10);
	F.addEdge(N * N + 2, 0, 0, K);
	for (int i = 0; i < N; i++) {
		for (int j = 1; j <= N; j++) {
			if ((i + 1 + j) % 2)
				F.addEdge(0, i * N + j, -grid[i][j], 1);
		}
	}
	for (int i = 0; i < N; i++) {
		for (int j = 1; j <= N; j++) {
			if ((i + 1 + j) % 2) {
				if (j != N)
					F.addEdge(i * N + j, i * N + j + 1, 0, 1);
				if (i != N - 1)
					F.addEdge(i * N + j, (i+1) * N + j, 0, 1);
				if (j != 1)
					F.addEdge(i * N + j, i * N + j - 1, 0, 1);
				if (i != 0)
					F.addEdge(i * N + j, (i-1) * N + j, 0, 1);
			}
		}
	}
	for (int i = 0; i < N; i++) {
		for (int j = 1; j <= N; j++) {
			if ((i + 1 + j) % 2 == 0)
				F.addEdge(i * N + j, N * N + 1, -grid[i][j], 1);
		}
	}
	F.source = N * N + 2, F.terminal = N * N + 1;

	ans += F.minCost();
	cout << ans << "\n";
}

Compilation message

domino.cpp: In member function 'bool Flow::SPFA()':
domino.cpp:44:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<short int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |   for (int i = 0; i < dist.size(); i++)
      |                   ~~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 33576 KB Output is correct
2 Correct 40 ms 33836 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2904 KB Output is correct
2 Correct 1 ms 2772 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 764 ms 391040 KB Output is correct
2 Correct 651 ms 392616 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 444 KB Output is correct
2 Correct 1 ms 500 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 448 ms 199396 KB Output is correct
2 Correct 389 ms 199048 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 223 ms 116780 KB Output is correct
2 Correct 198 ms 116084 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 970 ms 391948 KB Output is correct
2 Correct 824 ms 388992 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2904 KB Output is correct
2 Correct 1 ms 2972 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1054 ms 391304 KB Output is correct
2 Correct 903 ms 392332 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 3796 KB Output is correct
2 Correct 3 ms 3796 KB Output is correct

Subtask #11
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #12
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1150 ms 390956 KB Output is correct
2 Correct 964 ms 392256 KB Output is correct

Subtask #13
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3028 KB Output is correct
2 Correct 2 ms 3032 KB Output is correct

Subtask #14
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 312 ms 115384 KB Output is correct
2 Correct 267 ms 116028 KB Output is correct

Subtask #15
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #16
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1227 ms 391908 KB Output is correct
2 Correct 1028 ms 392476 KB Output is correct