oj.uz

답안 #1100648

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1100648 2024-10-14T11:32:49 Z huyngo Selotejp (COCI20_selotejp) C++17
0 / 110
 1 ms 336 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using i64 = long long;

void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char* x) { cerr << '"' << x << '"'; }
void __print(const string& x) { cerr << '"' << x << '"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template<typename T, typename V> void __print(const pair<T, V>& x) { cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}'; }
template<typename T> void __print(const T& x) { int f = 0; cerr << '{'; for (auto& i : x) cerr << (f++ ? "," : ""), __print(i); cerr << "}"; }
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) { __print(t); if (sizeof...(v)) cerr << ", "; _print(v...); }
#define dbg(x...) cerr << "[" << #x << "] = ["; _print(x)
#define ln "\n"
#define fastIO() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define all(x) (x).begin(), (x).end()
#define rep(i, a, b) for(int i = a; i <= b; ++i)
#define ar array

int Bit(int mask, int b) { return (mask >> b) & 1; }
const ll base = 311, MOD = 998244353, M = 1e9 + 7, INF = 1e18;
const int mxN = 1e6 + 5;

int n, m;

int32_t main() {
    fastIO();
    cin >> n >> m;
    vector<string> a(n);
    for (int i = 0; i < n; ++i) cin >> a[i];
    int inf = 1e9;
    vector<vector<int>> dp(n + 1, vector<int>(1 << m, inf));
    dp[0][0] = 0;

    rep(r, 0, n - 1) {
        rep(msk, 0, (1 << m) - 1) {
            if (dp[r][msk] == inf) continue;

            int cost = 0;
            int new_mask = msk;

            for (int j = 0, l; j < m; ) {
                l = j;
                if (a[r][j] == '#' && !Bit(msk, j)) {
                    while (l + 1 < m && a[r][l + 1] == '#' && !Bit(msk, l + 1))
                        ++l;
                    ++cost;
                }
                j = l + 1;
            }

            rep(j, 0, m - 1)
                if (a[r][j] != '#' && Bit(msk, j))
                    new_mask ^= (1 << j);

            dp[r + 1][new_mask] = min(dp[r + 1][new_mask], dp[r][msk] + cost);

            cost = 0;
            new_mask = msk;
            rep(j, 0, m - 1) {
                if (a[r][j] == '#' && !Bit(msk, j)) {
                    cost++;
                    new_mask |= (1 << j);
                }
                if (a[r][j] != '#' && Bit(msk, j))
                    new_mask ^= (1 << j);
            }

            dp[r + 1][new_mask] = min(dp[r + 1][new_mask], dp[r][msk] + cost);
        }
    }

    cout << *min_element(all(dp[n]));
    return 0;
}

Subtask #1
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 336 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Incorrect 1 ms 336 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 336 KB Output isn't correct
2 Halted 0 ms 0 KB -