oj.uz

Submission #448319

# Submission time Handle Problem Language Result Execution time Memory
448319 2021-07-29T17:34:09 Z prvocislo T-Covering (eJOI19_covering) C++17
100 / 100
 148 ms 21660 KB 
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

const int dx[4] = { 0, -1, 0, 1 };
const int dy[4] = { -1, 0, 1, 0 };
int m, n; // pocet riadkov, pocet stlpcov
vector<vector<int> > w;
vector<vector<bool> > ce, vis;
bool valid(int x, int y) 
{ 
    return x >= 0 && y >= 0 && x < m && y < n; 
}
void dfs(int x, int y, int& c, int& f, vector<int> &v)
{
    if (ce[x][y]) c++;
    else f++, v.push_back(w[x][y]);
    vis[x][y] = true;
    for (int i = 0; i < 4; i++)
    {
        int xi = x + dx[i], yi = y + dy[i];
        if (valid(xi, yi) && !vis[xi][yi] && (ce[x][y] || ce[xi][yi])) 
            dfs(xi, yi, c, f, v);
    }
}
void no() 
{ 
    cout << "No\n"; exit(0);
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> m >> n;
    w.assign(m, vector<int>(n, 0)), ce.assign(m, vector<bool>(n, false)), vis.assign(m, vector<bool>(n, false));
    for (int i = 0; i < m; i++) for (int j = 0; j < n; j++) cin >> w[i][j];
    int k;
    cin >> k;
    int ans = 0;
    for (int i = 0, r, c; i < k; i++) cin >> r >> c, ce[r][c] = true, ans += w[r][c];
    for (int i = 0; i < m; i++) for (int j = 0; j < n; j++) if (ce[i][j] && !vis[i][j])
    {
        int c = 0, f = 0; vector<int> v;
        dfs(i, j, c, f, v);
        if (c * 3 > f) no();
        swap(v.back(), *min_element(v.begin(), v.end()));
        for (int i = 0; i < c * 3; i++) ans += v[i];
    }
    cout << ans << "\n";
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 3 ms 588 KB Output is correct
3 Correct 10 ms 1152 KB Output is correct
4 Correct 27 ms 2804 KB Output is correct
5 Correct 90 ms 8312 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 3 ms 588 KB Output is correct
3 Correct 9 ms 1144 KB Output is correct
4 Correct 27 ms 2764 KB Output is correct
5 Correct 90 ms 8308 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 5 ms 588 KB Output is correct
3 Correct 11 ms 1228 KB Output is correct
4 Correct 27 ms 2804 KB Output is correct
5 Correct 108 ms 8304 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 5 ms 648 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 9 ms 1100 KB Output is correct

Subtask #5
15.0 / 15.0

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

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 3 ms 588 KB Output is correct
3 Correct 10 ms 1152 KB Output is correct
4 Correct 27 ms 2804 KB Output is correct
5 Correct 90 ms 8312 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 3 ms 588 KB Output is correct
8 Correct 9 ms 1144 KB Output is correct
9 Correct 27 ms 2764 KB Output is correct
10 Correct 90 ms 8308 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 5 ms 588 KB Output is correct
13 Correct 11 ms 1228 KB Output is correct
14 Correct 27 ms 2804 KB Output is correct
15 Correct 108 ms 8304 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 5 ms 648 KB Output is correct
19 Correct 3 ms 460 KB Output is correct
20 Correct 9 ms 1100 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 4 ms 588 KB Output is correct
23 Correct 12 ms 1128 KB Output is correct
24 Correct 28 ms 2928 KB Output is correct
25 Correct 90 ms 8312 KB Output is correct

Subtask #7
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 3 ms 588 KB Output is correct
3 Correct 10 ms 1152 KB Output is correct
4 Correct 27 ms 2804 KB Output is correct
5 Correct 90 ms 8312 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 3 ms 588 KB Output is correct
8 Correct 9 ms 1144 KB Output is correct
9 Correct 27 ms 2764 KB Output is correct
10 Correct 90 ms 8308 KB Output is correct
11 Correct 1 ms 324 KB Output is correct
12 Correct 5 ms 588 KB Output is correct
13 Correct 11 ms 1228 KB Output is correct
14 Correct 27 ms 2804 KB Output is correct
15 Correct 108 ms 8304 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 5 ms 648 KB Output is correct
19 Correct 3 ms 460 KB Output is correct
20 Correct 9 ms 1100 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 0 ms 312 KB Output is correct
24 Correct 0 ms 312 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 2 ms 332 KB Output is correct
27 Correct 4 ms 588 KB Output is correct
28 Correct 12 ms 1128 KB Output is correct
29 Correct 28 ms 2928 KB Output is correct
30 Correct 90 ms 8312 KB Output is correct
31 Correct 148 ms 21660 KB Output is correct
32 Correct 88 ms 9468 KB Output is correct
33 Correct 105 ms 13800 KB Output is correct
34 Correct 89 ms 8960 KB Output is correct
35 Correct 135 ms 20964 KB Output is correct