oj.uz

답안 #1109443

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1109443 2024-11-06T17:40:28 Z TIN Domino (COCI15_domino) C++17
60 / 160
 373 ms 524288 KB 
#include <bits/stdc++.h>

using namespace std;

#define FNAME "test"

typedef long long ll;

const ll oo = 1e18 + 1;

struct Edge {
	int from, to, cap;
	ll cost;

	Edge(int from, int to, int cap, ll cost) : from(from), to(to), cap(cap), cost(cost) {}
};

struct MinFlow {
	int n, k, s, t;

	vector<vector<int>> adj;
	vector<vector<ll>> cap;
	vector<vector<ll>> cost;

	MinFlow(int _n, int _k, int _s, int _t) {
		n  = _n;
		k = _k;
		s = _s;
		t = _t;
		adj.assign(n, vector<int>());
		cost.assign(n, vector<ll>(n, 0));
		cap.assign(n, vector<ll>(n, 0));
	}

	void addEdge(Edge e) {
		adj[e.from].push_back(e.to);
		adj[e.to].push_back(e.from);
		cost[e.from][e.to] = e.cost;
		cost[e.to][e.from] = -e.cost;
		cap[e.from][e.to] = e.cap;
	}

	void shortest_paths(int v0, vector<ll>& d, vector<int>& p) {
		d.assign(n, oo);
		d[v0] = 0;
		vector<bool> inq(n, false);
		queue<int> q;
		q.push(v0);
		p.assign(n, -1);
		while (!q.empty()) {
			int u = q.front(); q.pop();
			inq[u] = false;
			for (int v : adj[u]) {
				if (cap[u][v] > 0 && d[v] > d[u] + cost[u][v]) {
					d[v] = d[u] + cost[u][v];
					p[v] = u;
					if (!inq[v]) {
						inq[v] = true;
						q.push(v);
					}
				}
			}
		}
	}

	ll min_cost_flow() {
		ll flow = 0;
		ll cost = 0;
		vector<ll> d;
		vector<int> p;
		while (flow < k) {
			shortest_paths(s, d, p);
			if (d[t] == oo) break;
			ll f = k - flow;
			int cur = t;
			while (cur != s) {
				f = min(f, cap[p[cur]][cur]);
				cur = p[cur];
			}
			flow += f;
			cost += 1LL * f * d[t];
			cur = t;
			while (cur != s) {
				cap[p[cur]][cur] -= f;
				cap[cur][p[cur]] += f;
				cur = p[cur];
			}
		}
		if (flow < k) return -1;
		return cost;
	}
};

int n, k;
ll sum, ans;

void Task() {
	ios_base::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cout << fixed << setprecision(9);
	if (fopen(FNAME".inp","r")) {
		freopen(FNAME".inp","r",stdin);
		freopen(FNAME".out","w",stdout);
	}
}

void Solve() {
	//Your Code
	cin >> n >> k;
	MinFlow calc(n * n + 5, k, 0, n * n + 1);
	sum = 0;
	for (int i  = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			ll x;
			cin >> x;
			sum += x;
			int id = (i - 1) * n + j;
			if ((i + 1 + j) & 1) {
				calc.addEdge(Edge(0, id, 1, -x));
				if (i < n) calc.addEdge(Edge(id, id + n, 1, 0));
				if (j < n) calc.addEdge(Edge(id, id + 1, 1, 0));
			} else {
				calc.addEdge(Edge(id, n * n + 1, 1, -x));
				if (i < n) calc.addEdge(Edge(id + n, id, 1, 0));
				if (j < n) calc.addEdge(Edge(id + 1, id, 1, 0));
			}
		}
	}
	ans = calc.min_cost_flow();
	cout << sum + ans << '\n';
}

int main() {
	Task();
	Solve();
	cerr << "\nTime run: " << 1000*clock()/CLOCKS_PER_SEC << "ms";
	return 37^37;
}

Compilation message

domino.cpp: In function 'void Task()':
domino.cpp:102:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  102 |   freopen(FNAME".inp","r",stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
domino.cpp:103:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  103 |   freopen(FNAME".out","w",stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 363 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 67 ms 98888 KB Output is correct
2 Correct 74 ms 98888 KB Output is correct

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 200 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 848 KB Output is correct
2 Correct 1 ms 848 KB Output is correct

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 209 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 202 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 196 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 98872 KB Output is correct
2 Correct 64 ms 98836 KB Output is correct

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 198 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 373 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #11
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct

Subtask #12
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 219 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #13
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 252 ms 377672 KB Output is correct
2 Correct 259 ms 377672 KB Output is correct

Subtask #14
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 193 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #15
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct

Subtask #16
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 207 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -