oj.uz

Submission #456340

# Submission time Handle Problem Language Result Execution time Memory
456340 2021-08-06T13:29:27 Z SamAnd T-Covering (eJOI19_covering) C++17
100 / 100
 260 ms 26468 KB 
#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
typedef long long ll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
const int N = 1000006;
const int xx[4] = {0, 1, 0, -1};
const int yy[4] = {1, 0, -1, 0};
//const int cc[4] = {'R', 'D', 'L', 'U'};

int n, m;

template <typename T>
void bil(T**& a)
{
    a = new T*[n + 5];
    for (int i = 0; i < n + 5; ++i)
        a[i] = new T[m + 5];
    for (int i = 0; i <= n + 1; ++i)
    {
        for (int j = 0; j <= m + 1; ++j)
        {
            a[i][j] = 0;
        }
    }
}

int** a;

int k;
bool** c;

bool** cc;
vector<pair<int, int> > v;
void dfs(int x, int y)
{
    cc[x][y] = true;
    v.push_back(m_p(x, y));
    for (int i = 0; i < 4; ++i)
    {
        int hx = x + xx[i] * 2;
        int hy = y + yy[i] * 2;
        if (1 <= hx && hx <= n && 1 <= hy && hy <= m)
        {
            if (c[hx][hy] && !cc[hx][hy])
            {
                dfs(hx, hy);
            }
        }
    }
}

void solv()
{
    cin >> n >> m;
    bil(a);
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= m; ++j)
        {
            cin >> a[i][j];
        }
    }

    cin >> k;
    bil(c);
    for (int i = 0; i < k; ++i)
    {
        int x, y;
        cin >> x >> y;
        ++x;
        ++y;
        c[x][y] = true;
    }

    int** u;
    bil(u);
    for (int i = 0; i <= n + 1; ++i)
    {
        for (int j = 0; j <= m + 1; ++j)
        {
            u[i][j] = -1;
        }
    }

    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= m; ++j)
        {
            if (c[i][j] && c[i][j + 1])
            {
                u[i][j] = 2;
                u[i][j + 1] = 0;
            }
            if (c[i][j] && c[i + 1][j])
            {
                u[i][j] = 3;
                u[i + 1][j] = 1;
            }
            if (c[i][j] && c[i + 1][j + 1])
            {
                u[i][j] = 2;
                u[i + 1][j + 1] = 0;
            }
            if (c[i][j] && c[i - 1][j + 1])
            {
                u[i][j] = 2;
                u[i - 1][j + 1] = 0;
            }
        }
    }

    int** q;
    bil(q);
    for (int j = 0; j <= m; ++j)
    {
        q[0][j] = q[n + 1][j] = 1;
    }
    for (int i = 0; i <= n; ++i)
    {
        q[i][0] = q[i][m + 1] = 1;
    }
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= m; ++j)
        {
            if (u[i][j] != -1)
            {
                c[i][j] = false;
                ++q[i][j];
                for (int d = -1; d <= 1; ++d)
                    ++q[i + xx[(u[i][j] + d + 4) % 4]][j + yy[(u[i][j] + d + 4) % 4]];
            }
        }
    }

    for (int i = 0; i <= n + 1; ++i)
    {
        for (int j = 0; j <= m + 1; ++j)
        {
            if (q[i][j] > 1)
            {
                cout << "No\n";
                return;
            }
        }
    }

    int ans = 0;

    bil(cc);
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= m; ++j)
        {
            if (c[i][j] && !cc[i][j])
            {
                v.clear();
                dfs(i, j);
                set<pair<int, int> > s;
                for (int i = 0; i < sz(v); ++i)
                {
                    ++q[v[i].fi][v[i].se];
                    for (int j = 0; j < 4; ++j)
                    {
                        if (!q[v[i].fi + xx[j]][v[i].se + yy[j]])
                            s.insert(m_p(v[i].fi + xx[j], v[i].se + yy[j]));
                    }
                }
                if (sz(s) < sz(v) * 3)
                {
                    cout << "No\n";
                    return;
                }
                if (sz(s) == sz(v) * 3)
                {
                    for (auto it = s.begin(); it != s.end(); ++it)
                        ans += a[it->fi][it->se];
                }
                else
                {
                    int minu = N;
                    for (auto it = s.begin(); it != s.end(); ++it)
                    {
                        ans += a[it->fi][it->se];
                        minu = min(minu, a[it->fi][it->se]);
                    }
                    ans -= minu;
                }
            }
        }
    }

    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= m; ++j)
        {
            if (q[i][j])
                ans += a[i][j];
        }
    }

    cout << ans << "\n";
}

int main()
{
    #ifdef SOMETHING
    freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    #endif // SOMETHING
    ios_base::sync_with_stdio(false), cin.tie(0);

    int tt = 1;
    //cin >> tt;
    while (tt--)
    {
        solv();
    }
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 460 KB Output is correct
2 Correct 4 ms 716 KB Output is correct
3 Correct 11 ms 1740 KB Output is correct
4 Correct 33 ms 4476 KB Output is correct
5 Correct 101 ms 14128 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 460 KB Output is correct
2 Correct 3 ms 716 KB Output is correct
3 Correct 10 ms 1740 KB Output is correct
4 Correct 30 ms 4476 KB Output is correct
5 Correct 100 ms 14248 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 460 KB Output is correct
2 Correct 5 ms 716 KB Output is correct
3 Correct 12 ms 2140 KB Output is correct
4 Correct 31 ms 5368 KB Output is correct
5 Correct 102 ms 15056 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 6 ms 1212 KB Output is correct
4 Correct 4 ms 844 KB Output is correct
5 Correct 11 ms 1928 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 460 KB Output is correct
2 Correct 4 ms 716 KB Output is correct
3 Correct 11 ms 1740 KB Output is correct
4 Correct 33 ms 4476 KB Output is correct
5 Correct 101 ms 14128 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 3 ms 716 KB Output is correct
8 Correct 10 ms 1740 KB Output is correct
9 Correct 30 ms 4476 KB Output is correct
10 Correct 100 ms 14248 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 5 ms 716 KB Output is correct
13 Correct 12 ms 2140 KB Output is correct
14 Correct 31 ms 5368 KB Output is correct
15 Correct 102 ms 15056 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 6 ms 1212 KB Output is correct
19 Correct 4 ms 844 KB Output is correct
20 Correct 11 ms 1928 KB Output is correct
21 Correct 2 ms 396 KB Output is correct
22 Correct 4 ms 804 KB Output is correct
23 Correct 11 ms 2124 KB Output is correct
24 Correct 32 ms 5356 KB Output is correct
25 Correct 103 ms 15044 KB Output is correct

Subtask #7
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 460 KB Output is correct
2 Correct 4 ms 716 KB Output is correct
3 Correct 11 ms 1740 KB Output is correct
4 Correct 33 ms 4476 KB Output is correct
5 Correct 101 ms 14128 KB Output is correct
6 Correct 2 ms 460 KB Output is correct
7 Correct 3 ms 716 KB Output is correct
8 Correct 10 ms 1740 KB Output is correct
9 Correct 30 ms 4476 KB Output is correct
10 Correct 100 ms 14248 KB Output is correct
11 Correct 2 ms 460 KB Output is correct
12 Correct 5 ms 716 KB Output is correct
13 Correct 12 ms 2140 KB Output is correct
14 Correct 31 ms 5368 KB Output is correct
15 Correct 102 ms 15056 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 6 ms 1212 KB Output is correct
19 Correct 4 ms 844 KB Output is correct
20 Correct 11 ms 1928 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 2 ms 396 KB Output is correct
27 Correct 4 ms 804 KB Output is correct
28 Correct 11 ms 2124 KB Output is correct
29 Correct 32 ms 5356 KB Output is correct
30 Correct 103 ms 15044 KB Output is correct
31 Correct 260 ms 26468 KB Output is correct
32 Correct 100 ms 16188 KB Output is correct
33 Correct 115 ms 20000 KB Output is correct
34 Correct 110 ms 16084 KB Output is correct
35 Correct 151 ms 25880 KB Output is correct