Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #define pragma
- #ifdef pragma
- #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
- //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
- #endif // pragma
- #include<bits/stdc++.h>
- #include <ext/pb_ds/assoc_container.hpp>
- #include <ext/pb_ds/tree_policy.hpp>
- #define ll long long
- #define all(x) begin(x), end(x)
- #define pb push_back
- #define x first
- #define y second
- #define int long long
- #define zero(two) memset(two, 0, sizeof(two))
- using namespace std;
- using namespace __gnu_pbds;
- typedef vector<int> vi;
- typedef vector<bool> vb;
- typedef pair<int, int> pii;
- typedef long double ld;
- typedef vector<vi> matrix;
- template<typename T>
- using kawaii_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
- const ld PI = atan2(0, -1);
- void seriy() {
- ios::sync_with_stdio(0);
- cin.tie(0);
- cout.tie(0);
- cout << fixed << setprecision(10);
- #if _offline
- freopen("input.txt", "r", stdin);
- freopen("output.txt", "w", stdout);
- #endif
- }
- const int MAXN = 1e5 + 10;
- const int ALPH = 26;
- const int INF = 1e18 + 7;
- const int MAXLOG = 20;
- const int MOD = 998244353;
- const int BASE = 47;
- struct edge {
- int u, v, w;
- };
- vector<vector<pii>> g;
- vi pr, sz;
- vb used;
- vi ch, ch2, p;
- int n, m, t;
- int get(int a) {
- if(pr[a] == a) return a;
- return pr[a] = get(pr[pr[a]]);
- }
- void unite(int a, int b) {
- a = get(a);
- b = get(b);
- if(a != b) {
- if(sz[a] < sz[b]) {
- swap(a, b);
- }
- pr[b] = a;
- sz[a] += sz[b];
- }
- }
- int bfs(int u) {
- used[u] = 1;
- set<pii> q;
- q.insert({0, u});
- int cnt = 0, mx = 0;
- while(q.size()) {
- pii fr = *q.begin();
- q.erase(q.begin());
- // cerr << fr.x << " " << fr.y << '\n';
- mx = max(mx, fr.x);
- used[fr.y] = 1;
- ch.pb(fr.y);
- ch2.pb(fr.y);
- cnt++;
- if(cnt == t) {
- break;
- }
- for(auto v : g[fr.y]) {
- // cerr << fr.y << " " << v.x << " " << p[fr.y] << '\n';
- if(v.x != p[fr.y]) {
- q.insert({max(fr.x, v.y), v.x});
- p[v.x] = fr.y;
- ch2.pb(v.x);
- }
- }
- }
- // cerr << mx << '\n';
- // cerr << '\n';
- return mx;
- }
- bool cmp(edge a, edge b) {
- return a.w < b.w;
- }
- signed main() {
- seriy();
- cin >> n >> m >> t;
- int h[n][m];
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < m; j++) {
- cin >> h[i][j];
- }
- }
- g.resize(n * m);
- sz.resize(n * m, 1);
- pr.resize(n * m);
- for(int i = 0; i < n * m; i++) {
- pr[i] = i;
- }
- int dx[4] = {-1, 1, 0, 0};
- int dy[4] = {0, 0, -1, 1};
- vector<edge> edges;
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < m; j++) {
- for(int k = 0; k < 4; k++) {
- int tox = i + dx[k];
- int toy = j + dy[k];
- if(tox > -1 && tox < n && toy > -1 && toy < m) {
- edges.pb({i * m + j, tox * m + toy, abs(h[i][j] - h[tox][toy])});
- }
- }
- }
- }
- sort(all(edges), cmp);
- vector<pii> ed;
- for(auto i : edges) {
- if(get(i.u) != get(i.v)) {
- unite(i.u, i.v);
- g[i.u].pb({i.v, i.w});
- g[i.v].pb({i.u, i.w});
- ed.pb({i.u, i.v});
- ed.pb({i.v, i.u});
- }
- }
- // for(auto i : g[3]) {
- // cerr << i.y << " ";
- // }
- // cerr << '\n';
- used.resize(g.size());
- p.resize(g.size(), -1);
- vi ans(g.size(), INF);
- for(auto j : ed) {
- int i = j.x;
- if(!used[i]) {
- // cerr << i << '\n';
- int kek = bfs(i);
- while(ch.size()) {
- // cerr << ch.back() << " " << ans[ch.back()] << " " << kek << '\n';
- ans[ch.back()] = min(ans[ch.back()], kek);
- ch.pop_back();
- }
- while(ch2.size()) {
- p[ch2.back()] = -1;
- ch2.pop_back();
- }
- // cerr << '\n';
- // for(int i = 0; i < n; i++) {
- // for(int j = 0; j < m; j++) {
- // cerr << ans[i * m + j] << " ";
- // }
- // cerr << '\n';
- // }
- // cerr << '\n';
- }
- }
- int res = 0;
- for(int i = 0; i < n; i++) {
- for(int j = 0; j < m; j++) {
- int tmp;
- cin >> tmp;
- cerr << ans[i * m + j] << " ";
- if(tmp) {
- // cerr << ans[i * m + j] << " ";
- res += ans[i * m + j];
- }
- }
- cerr << '\n';
- }
- cout << res;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement