oj.uz

Submission #285569

# Submission time Handle Problem Language Result Execution time Memory
285569 2020-08-29T09:07:06 Z alextodoran T-Covering (eJOI19_covering) C++17
25 / 100
 110 ms 12412 KB 
/**
 ____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|

**/

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int K_MAX = 1000002;

struct Cell
{
    int a, b;
};

int n, m;

vector <vector <int> > ma;

int k;

Cell v[K_MAX];

vector <vector <bool> > special;

bool inside (Cell c)
{
    return (1 <= c.a && c.a <= n && 1 <= c.b && c.b <= m);
}

vector <vector <int> > pos;

vector <vector <bool> > visited;

int da[] = {-1, 0, 1, 0}, db[] = {0, 1, 0, -1};

bool dfs (int a, int b)
{
    visited[a][b] = true;
    for(int d = 0; d < 4; d++)
        if(d != (pos[a][b] + 2) % 4)
        {
            int a1 = a + da[d] * 2, b1 = b + db[d] * 2;
            if(inside(Cell{a1, b1}) == false || special[a1][b1] == false)
                continue;
            if(pos[a1][b1] != -1 && pos[a1][b1] != d)
                return false;
            if(visited[a1][b1] == true)
                continue;
            pos[a1][b1] = d;
            if(dfs(a1, b1) == false)
                return false;
        }
    return true;
}

int mi;
int cntu, cnte;

void dfs1 (int a, int b)
{
    visited[a][b] = true;
    cntu++;
    for(int d = 0; d < 4; d++)
    {
        if(inside(Cell{a + da[d], b + db[d]}) == true)
            mi = min(mi, ma[a + da[d]][b + db[d]]);
        int a1 = a + da[d] * 2, b1 = b + db[d] * 2;
        if(inside(Cell{a1, b1}) == false || special[a1][b1] == false)
            continue;
        cnte++;
        if(visited[a1][b1] == true)
            continue;
        dfs1(a1, b1);
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> m;
    ma.resize(n + 2);
    for(int i = 0; i <= n + 1; i++)
        ma[i].resize(m + 2);
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= m; j++)
            cin >> ma[i][j];
    cin >> k;
    for(int i = 1; i <= k; i++)
    {
        cin >> v[i].a >> v[i].b;
        v[i].a++;
        v[i].b++;
    }
    special.resize(n + 2);
    for(int i = 0; i <= n + 1; i++)
        special[i].resize(m + 2);
    for(int i = 1; i <= k; i++)
        special[v[i].a][v[i].b] = true;
    pos.resize(n + 2);
    for(int i = 0; i <= n + 1; i++)
        pos[i].resize(m + 2);
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= m; j++)
            pos[i][j] = -1;
    visited.resize(n + 2);
    for(int i = 0; i <= n + 1; i++)
        visited[i].resize(m + 2);
    for(int i = 1; i <= k; i++)
    {
        if((v[i].a == 1 || v[i].a == n) && (v[i].b == 1 || v[i].b == m))
        {
            cout << "No\n";
            return 0;
        }
        if(v[i].a == 1)
            pos[v[i].a][v[i].b] = 2;
        if(v[i].a == n)
            pos[v[i].a][v[i].b] = 0;
        if(v[i].b == 1)
            pos[v[i].a][v[i].b] = 1;
        if(v[i].b == m)
            pos[v[i].a][v[i].b] = 3;
        int aux = pos[v[i].a][v[i].b];
        int cnt = 0;
        if(inside(Cell{v[i].a - 1, v[i].b}) == true && special[v[i].a - 1][v[i].b] == true)
        {
            pos[v[i].a][v[i].b] = 2;
            cnt++;
        }
        if(inside(Cell{v[i].a + 1, v[i].b}) == true && special[v[i].a + 1][v[i].b] == true)
        {
            pos[v[i].a][v[i].b] = 0;
            cnt++;
        }
        if(inside(Cell{v[i].a, v[i].b - 1}) == true && special[v[i].a][v[i].b - 1] == true)
        {
            pos[v[i].a][v[i].b] = 1;
            cnt++;
        }
        if(inside(Cell{v[i].a, v[i].b + 1}) == true && special[v[i].a][v[i].b + 1] == true)
        {
            pos[v[i].a][v[i].b] = 3;
            cnt++;
        }
        if(cnt > 1 || (aux != -1 && pos[v[i].a][v[i].b] != aux))
        {
            cout << "No\n";
            return 0;
        }
    }
    for(int i = 1; i <= k; i++)
        if(pos[v[i].a][v[i].b] != -1 && visited[v[i].a][v[i].b] == false)
        {
            if(dfs(v[i].a, v[i].b) == false)
            {
                cout << "No\n";
                return 0;
            }
        }
    for(int i = 1; i <= k; i++)
        if(visited[v[i].a][v[i].b] == false)
        {
            if(inside(Cell{v[i].a - 1, v[i].b - 1}) == true && special[v[i].a - 1][v[i].b - 1] == true)
                pos[v[i].a][v[i].b] = 2;
            if(inside(Cell{v[i].a - 1, v[i].b + 1}) == true && special[v[i].a - 1][v[i].b + 1] == true)
                pos[v[i].a][v[i].b] = 2;
            int aux = pos[v[i].a][v[i].b];
            if(inside(Cell{v[i].a + 1, v[i].b - 1}) == true && special[v[i].a + 1][v[i].b - 1] == true)
                pos[v[i].a][v[i].b] = 0;
            if(inside(Cell{v[i].a + 1, v[i].b + 1}) == true && special[v[i].a + 1][v[i].b + 1] == true)
                pos[v[i].a][v[i].b] = 0;
            if(aux != -1 && aux != pos[v[i].a][v[i].b])
            {
                cout << "No\n";
                return 0;
            }
        }
    for(int i = 1; i <= k; i++)
        if(pos[v[i].a][v[i].b] != -1 && visited[v[i].a][v[i].b] == false)
        {
            if(dfs(v[i].a, v[i].b) == false)
            {
                cout << "No\n";
                return 0;
            }
        }
    int ans = 0;
    for(int i = 1; i <= k; i++)
        if(visited[v[i].a][v[i].b] == false)
        {
            cntu = cnte = 0;
            mi = INT_MAX;
            dfs1(v[i].a, v[i].b);
            if(cnte == cntu - 1)
                ans -= mi;
            else if(cnte > cntu)
            {
                cout << "No\n";
                return 0;
            }
        }
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= m; j++)
        {
            if(special[i][j])
            {
                ans += ma[i][j];
                continue;
            }
            bool ok = false;
            for(int d = 0; d < 4; d++)
            {
                int i1 = i + da[d], j1 = j + db[d];
                if(inside(Cell{i1, j1}) == false)
                    continue;
                if(special[i1][j1] == true)
                    ok = true;
            }
            if(ok == true)
                ans += ma[i][j];
        }
    cout << ans << "\n";
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 4 ms 640 KB Output is correct
3 Correct 10 ms 1152 KB Output is correct
4 Correct 30 ms 2944 KB Output is correct
5 Correct 110 ms 8824 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 3 ms 640 KB Output is correct
3 Correct 11 ms 1536 KB Output is correct
4 Correct 32 ms 4096 KB Output is correct
5 Correct 98 ms 12412 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 4 ms 640 KB Output is correct
3 Correct 11 ms 1536 KB Output is correct
4 Correct 31 ms 4096 KB Output is correct
5 Correct 98 ms 12408 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Incorrect 1 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 4 ms 640 KB Output is correct
3 Correct 10 ms 1152 KB Output is correct
4 Correct 30 ms 2944 KB Output is correct
5 Correct 110 ms 8824 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 3 ms 640 KB Output is correct
8 Correct 11 ms 1536 KB Output is correct
9 Correct 32 ms 4096 KB Output is correct
10 Correct 98 ms 12412 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 4 ms 640 KB Output is correct
13 Correct 11 ms 1536 KB Output is correct
14 Correct 31 ms 4096 KB Output is correct
15 Correct 98 ms 12408 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Incorrect 1 ms 384 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #7
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 4 ms 640 KB Output is correct
3 Correct 10 ms 1152 KB Output is correct
4 Correct 30 ms 2944 KB Output is correct
5 Correct 110 ms 8824 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 3 ms 640 KB Output is correct
8 Correct 11 ms 1536 KB Output is correct
9 Correct 32 ms 4096 KB Output is correct
10 Correct 98 ms 12412 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 4 ms 640 KB Output is correct
13 Correct 11 ms 1536 KB Output is correct
14 Correct 31 ms 4096 KB Output is correct
15 Correct 98 ms 12408 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Incorrect 1 ms 384 KB Output isn't correct
18 Halted 0 ms 0 KB -