oj.uz

Submission #377434

# Submission time Handle Problem Language Result Execution time Memory
377434 2021-03-14T08:10:23 Z NONAME Selotejp (COCI20_selotejp) C++17
110 / 110
 60 ms 512 KB 
#include <bits/stdc++.h>
using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

int n, m;
int dp[2][1 << 11];
char a[1000][10];

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin >> n >> m;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            cin >> a[i][j];
        }
    }

    int tp = 0;
    for (int i : {0, 1}) {
        for (int msk = 0; msk < (1 << m); ++msk) {
            dp[i][msk] = 1e9;
        }
    }
    dp[0][0] = 0;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            int nt = tp ^ 1;
            for (int msk = 0; msk < (1 << m); ++msk) {
                if (!((msk >> j) & 1)) {
                    int c = 0;
                    if ((a[i][j] == '#') && (!j || (a[i][j - 1] == '.') || ((msk >> (j - 1)) & 1))) {
                        c = 1;
                    }
                    dp[nt][msk] = min(dp[tp][msk], dp[tp][msk ^ (1 << j)]) + c;
                } else {
                    if (a[i][j] == '.') {
                        dp[nt][msk] = 1e9;
                    } else {
                        dp[nt][msk] = min(dp[tp][msk], dp[tp][msk ^ (1 << j)] + 1);
                    }
                }
            }
            tp ^= 1;
        }
    }

    int ans = 1e9;
    for (int msk = 0; msk < (1 << m); ++msk) {
        ans = min(ans, dp[tp][msk]);
    }
    cout << ans << "\n";

    return 0;
}

Subtask #1
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 18 ms 364 KB Output is correct
3 Correct 5 ms 364 KB Output is correct
4 Correct 9 ms 492 KB Output is correct
5 Correct 19 ms 364 KB Output is correct
6 Correct 20 ms 364 KB Output is correct
7 Correct 23 ms 364 KB Output is correct
8 Correct 18 ms 364 KB Output is correct
9 Correct 18 ms 364 KB Output is correct
10 Correct 24 ms 364 KB Output is correct

Subtask #2
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 18 ms 364 KB Output is correct
3 Correct 5 ms 364 KB Output is correct
4 Correct 9 ms 492 KB Output is correct
5 Correct 19 ms 364 KB Output is correct
6 Correct 20 ms 364 KB Output is correct
7 Correct 23 ms 364 KB Output is correct
8 Correct 18 ms 364 KB Output is correct
9 Correct 18 ms 364 KB Output is correct
10 Correct 24 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 512 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 5 ms 364 KB Output is correct
21 Correct 10 ms 364 KB Output is correct
22 Correct 17 ms 364 KB Output is correct
23 Correct 60 ms 428 KB Output is correct
24 Correct 19 ms 364 KB Output is correct
25 Correct 23 ms 364 KB Output is correct
26 Correct 22 ms 492 KB Output is correct
27 Correct 22 ms 364 KB Output is correct
28 Correct 24 ms 364 KB Output is correct