oj.uz

Submission #1100880

# Submission time Handle Problem Language Result Execution time Memory
1100880 2024-10-14T23:53:10 Z huantran Selotejp (COCI20_selotejp) C++17
0 / 110
 17 ms 536 KB 
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string.h>
#include <vector>
#include <math.h>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <numeric>
#include <random>
#include <chrono>
#include <fstream>
#include <stack>
#include <cmath>
#define bit(x, i) (((x) >> (i)) & 1LL)
#define rand rd
#define PI acos(-1)

using namespace std;
typedef long long int ll;
const int maxn = 1e5 + 5;
const ll mod = 998244353;
const int inf = 1e9 + 7;
const ll base = 1e5 + 7;
using pll = pair<ll, ll>;

const string NAME = "LOCO";
const int NTEST = 100;

mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());

ll Rand(ll l, ll r) {
    return l + rd() % (r - l + 1);
}

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

    int n, m;   
    cin >> n >> m;

    vector<int> dp(1 << m, inf);
    vector<vector<char>> adj(n, vector<char>(m));

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

    dp[0] = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            for (int mask = 0; mask < (1 << m); mask++) {
                if (bit(mask, j) == 0) {
                    if ((j == 0 || (bit(mask, j - 1) == 1) || adj[i][j - 1] == '.') && adj[i][j] == '#')
                        dp[mask] = min(dp[mask], dp[mask ^ (1 << j)]) + 1;
                    else 
                        dp[mask] = min(dp[mask], dp[mask ^ (1 << j)]);
                }
                else {
                    if ((i == 0 || adj[i - 1][j] == '.') && adj[i][j] == '#')
                        dp[mask] = min(dp[mask ^ (1 << j)], dp[mask]) + 1;
                    else {
                        dp[mask] = min(dp[mask], dp[mask ^ (1 << j)]);
                    }
                }
                // cout << mask << ' ' << dp[mask] << '\n';
            }
            // cout << "Check: " << j << ' ' << *min_element(dp.begin(), dp.end()) << ' ' << dp[0] << '\n';
        }
        // cout << "Check: " << *min_element(dp.begin(), dp.end()) << '\n';
    }

    int ans = inf;
    for (int i = 0; i < (1 << m); i++) 
        ans = min(ans, dp[i]);

    cout << ans;
}

Subtask #1
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 16 ms 536 KB Output is correct
3 Correct 4 ms 336 KB Output is correct
4 Correct 8 ms 504 KB Output is correct
5 Correct 17 ms 340 KB Output is correct
6 Incorrect 17 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 35.0

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

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 16 ms 536 KB Output is correct
3 Correct 4 ms 336 KB Output is correct
4 Correct 8 ms 504 KB Output is correct
5 Correct 17 ms 340 KB Output is correct
6 Incorrect 17 ms 348 KB Output isn't correct
7 Halted 0 ms 0 KB -