oj.uz

Submission #656489

# Submission time Handle Problem Language Result Execution time Memory
656489 2022-11-07T15:28:00 Z ParsaS T-Covering (eJOI19_covering) C++17
100 / 100
 194 ms 41092 KB 
// In the name of God
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define mp make_pair
typedef long long ll;
const int N = 1e6 + 5, MOD = 1e9 + 7;
const int di[4] = {0, 0, 1, -1}, dj[4] = {1, -1, 0, 0};
const int dx[2] = {1, -1}, dy[2] = {1, 1};
int n, m, cnt, sum, mn;
pair<int, int> P[N];
set<pair<int, int> > st;
vector<vector<int> > grid, vis, mark, G;

bool valid(int i, int j) {
    return min(i, j) >= 0 && i < n && j < m;
}

bool dfs(int i, int j) {
    bool ok = true;
    if (mark[i][j] == 2) {
        for (int k = 0; k < 4; k++) {
            int x = i + di[k], y = j + dj[k];
            if (valid(x, y) && !vis[x][y] && mark[x][y] == 1) {
                ok &= dfs(x, y);
            }
        }
        return ok;

    }
    G[i][j] = true;
    for (int t = 0; t < 4; t++) {
        int x = i + di[t], y = j + dj[t];
        ok &= valid(x, y) && !mark[x][y];
    }
    if (ok) {
        return true;
    }
    vis[i][j] = true;
    bool res = true;
    for (int t = 0; t < 4; t++) {
        int x = i + di[t], y = j + dj[t];

        if ((!valid(x, y) || mark[x][y]) && ok) {
            return false;
        }
        if (!valid(x, y))
            ok = true;
        else {
            if (mark[x][y] == 1) {
                ok = true;
            }
            else
                mark[x][y] = 2;
            if (!vis[x][y])
                res &= dfs(x, y);
        }
    }
    return res;
}
void dfs2(int i, int j) {
    cnt++;
    G[i][j] = true;
    for (int t = 0; t < 4; t++) {
        if (valid(i + di[t], j + dj[t]) && !G[i + di[t]][j + dj[t]] && !mark[i + di[t]][j + dj[t]]) {
            st.insert(mp(i + di[t], j + dj[t]));
            sum += grid[i + di[t]][j + dj[t]];
            G[i + di[t]][j + dj[t]] = true;
            mn = min(mn, grid[i + di[t]][j + dj[t]]);
        }
        int x = i + 2 * di[t], y = j + 2 * dj[t];
        if (valid(x, y) && mark[x][y] == 1 && !G[x][y]) {
            dfs2(x, y);
        }
    }
}

void solve() {
    cin >> n >> m;
    vector<vector<int> > tmp(n + 3, vector<int>(m + 3));
    vis = tmp;
    mark = G = tmp;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cin >> tmp[i][j];
        }
    }
    grid = tmp;
    int k; cin >> k;

    for (int i = 0; i < k; i++) {
        cin >> P[i].fi >> P[i].se;
        mark[P[i].fi][P[i].se] = 1;
    }
    bool ok = true;
    for (int i = 0; i < k; i++) {
        if (!vis[P[i].fi][P[i].se]) {
            for (int t = 0; t < 4; t++) {
                int x = P[i].fi + di[t], y = P[i].se + dj[t];
                if (!vis[P[i].fi][P[i].se] && (!valid(x, y) || (valid(x, y) && mark[x][y])))
                    ok &= dfs(P[i].fi, P[i].se);
            }
        }
    }
    for (int i = 0; i < k; i++) {
        
        for (int t = 0; t < 2; t++) {
            set<pair<int, int> > S;
            int x = P[i].fi + dx[t], y = P[i].se + dy[t];
            if (valid(x, y) && mark[x][y] == 1) {
                G[x][y] = true;
                G[P[i].fi][P[i].se] = true;
                vis[x][y] = vis[P[i].fi][P[i].se] = true;
                for (int f = 0; f < 4; f++) {
                    S.insert(mp(x + di[f], y + dj[f]));
                    S.insert(mp(P[i].fi + di[f], P[i].se + dj[f]));
                }
                for (auto [a, b] : S) {
                    ok &= valid(a, b) && !mark[a][b];
                    if (!ok)
                        break;
                    mark[a][b] = 2;
                }
                for (auto [a, b] : S) {
                    if (ok)
                        ok &= dfs(a, b);
                }
            }
        }
    }
    int ans = 0;
    for (int i = 0; i < k; i++) {
        int x = P[i].fi, y = P[i].se;
        if (G[x][y] == false) {
            sum = cnt = 0, mn = 1e9 + 5;
            st.clear();
            dfs2(x, y);
            ans += sum;
            assert(st.size() <= 3 * cnt + 1);
            if (st.size() < 3 * cnt) {
                ok = false;
            }
            else if (st.size() == 3 * cnt + 1) {
                ans -= mn;
            }
        }
    }
    if (!ok) {
        cout << "No" << '\n';
        return;
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (mark[i][j])
                ans += grid[i][j];
        }
    }
    cout << ans;

}

int32_t main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int tc = 1; //cin >> tc;
    while (tc--) {
        solve();
    }
    return 0;
}

Compilation message

In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from covering.cpp:2:
covering.cpp: In function 'void solve()':
covering.cpp:141:30: warning: comparison of integer expressions of different signedness: 'std::set<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  141 |             assert(st.size() <= 3 * cnt + 1);
      |                    ~~~~~~~~~~^~~~~~~~~~~~~~
covering.cpp:142:27: warning: comparison of integer expressions of different signedness: 'std::set<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  142 |             if (st.size() < 3 * cnt) {
      |                 ~~~~~~~~~~^~~~~~~~~
covering.cpp:145:32: warning: comparison of integer expressions of different signedness: 'std::set<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  145 |             else if (st.size() == 3 * cnt + 1) {
      |                      ~~~~~~~~~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 3 ms 980 KB Output is correct
3 Correct 7 ms 2260 KB Output is correct
4 Correct 22 ms 6356 KB Output is correct
5 Correct 69 ms 20208 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 4 ms 980 KB Output is correct
3 Correct 7 ms 2344 KB Output is correct
4 Correct 20 ms 6364 KB Output is correct
5 Correct 65 ms 20208 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 3 ms 980 KB Output is correct
3 Correct 7 ms 2260 KB Output is correct
4 Correct 19 ms 6356 KB Output is correct
5 Correct 77 ms 20196 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 4 ms 1748 KB Output is correct
4 Correct 3 ms 1108 KB Output is correct
5 Correct 8 ms 3284 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 3 ms 980 KB Output is correct
3 Correct 7 ms 2260 KB Output is correct
4 Correct 22 ms 6356 KB Output is correct
5 Correct 69 ms 20208 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 4 ms 980 KB Output is correct
8 Correct 7 ms 2344 KB Output is correct
9 Correct 20 ms 6364 KB Output is correct
10 Correct 65 ms 20208 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 3 ms 980 KB Output is correct
13 Correct 7 ms 2260 KB Output is correct
14 Correct 19 ms 6356 KB Output is correct
15 Correct 77 ms 20196 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 4 ms 1748 KB Output is correct
19 Correct 3 ms 1108 KB Output is correct
20 Correct 8 ms 3284 KB Output is correct
21 Correct 2 ms 592 KB Output is correct
22 Correct 3 ms 1108 KB Output is correct
23 Correct 9 ms 2708 KB Output is correct
24 Correct 24 ms 6732 KB Output is correct
25 Correct 72 ms 20548 KB Output is correct

Subtask #7
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 3 ms 980 KB Output is correct
3 Correct 7 ms 2260 KB Output is correct
4 Correct 22 ms 6356 KB Output is correct
5 Correct 69 ms 20208 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 4 ms 980 KB Output is correct
8 Correct 7 ms 2344 KB Output is correct
9 Correct 20 ms 6364 KB Output is correct
10 Correct 65 ms 20208 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 3 ms 980 KB Output is correct
13 Correct 7 ms 2260 KB Output is correct
14 Correct 19 ms 6356 KB Output is correct
15 Correct 77 ms 20196 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 4 ms 1748 KB Output is correct
19 Correct 3 ms 1108 KB Output is correct
20 Correct 8 ms 3284 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 328 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 2 ms 592 KB Output is correct
27 Correct 3 ms 1108 KB Output is correct
28 Correct 9 ms 2708 KB Output is correct
29 Correct 24 ms 6732 KB Output is correct
30 Correct 72 ms 20548 KB Output is correct
31 Correct 194 ms 41092 KB Output is correct
32 Correct 75 ms 21964 KB Output is correct
33 Correct 81 ms 27772 KB Output is correct
34 Correct 70 ms 21700 KB Output is correct
35 Correct 120 ms 35660 KB Output is correct