From c5fcf7179a83ef65c86c6a4a390029149e518649 Mon Sep 17 00:00:00 2001 From: Franciszek Malinka Date: Tue, 5 Oct 2021 21:49:54 +0200 Subject: Duzy commit ze smieciami --- Semestr 4/aisd/pracownia3/rozw.cpp | 102 ------------------------------------- 1 file changed, 102 deletions(-) delete mode 100644 Semestr 4/aisd/pracownia3/rozw.cpp (limited to 'Semestr 4/aisd/pracownia3/rozw.cpp') diff --git a/Semestr 4/aisd/pracownia3/rozw.cpp b/Semestr 4/aisd/pracownia3/rozw.cpp deleted file mode 100644 index 7f1a307..0000000 --- a/Semestr 4/aisd/pracownia3/rozw.cpp +++ /dev/null @@ -1,102 +0,0 @@ -#include -using namespace std; - -const int MAXP = 105; -const int MAXN = 5005; - -int n, p, m; -unordered_set banned; -vector> propagate; -int dp[2][1024 + 10]; - -inline int char_to_bit(char c) { - return c == '.' ? 0 : 1; -} - -void input() { - scanf("%d%d%d", &n, &p, &m); - for (int i = 0; i < p; i++) { - char s[5]; - int value = 0, d = 1; - for (int k = 0; k < 3; k++) { - scanf("%s", s); - value += (char_to_bit(s[0]) + char_to_bit(s[1]) * 2 + char_to_bit(s[2]) * 4) * d; - d *= 8; - } - banned.insert(value); - } -} - -pair> get_pieces_values(int db, int sb) { - int tab[5][3]; - for (int i = 0; i < 5; i++) { - tab[i][0] = (db >> (i*2)) & 1; - tab[i][1] = (db >> (i*2 + 1)) & 1; - tab[i][2] = (sb >> i) & 1; - } - int res[3]; - for (int k = 0; k < 3; ++k) { - int value = 0, d = 1; - for (int i = k; i < k + 3; ++i) { - value += (tab[i][0] + tab[i][1] * 2 + tab[i][2] * 4) * d; - d *= 8; - } - res[k] = value; - } - return {res[0], {res[1], res[2]}}; -} - -int combine(int db, int sb) { - int res = (db >> 1) & 0x155; - for (int i = 0; i < 5; i++) { - res |= ((sb >> i) & 1) << (2*i + 1); - } - return res; -} - -void preproces() { - const int db = (1<<10); // double bar - const int sb = (1<<5); // single bar - - for (int db_mask = 0; db_mask < db; ++db_mask) { - for (int sb_mask = 0; sb_mask < sb; ++sb_mask) { - auto pieces = get_pieces_values(db_mask, sb_mask); - if (banned.count(pieces.first) || banned.count(pieces.second.first) || banned.count(pieces.second.second)) - continue; - int db2_mask = combine(db_mask, sb_mask); - propagate.push_back({db_mask, db2_mask}); - } - } -} - -int compute_dp() { - int K = 1; - for (int i = 0; i < 1024; i++) { - dp[0][i] = 1; - } - for (int i = 2; i < n; i++) { - for (auto pp: propagate) { - int p1 = pp.first, p2 = pp.second; - dp[K][p2] += dp[K^1][p1]; - dp[K][p2] %= m; - } - K ^= 1; - for (int j = 0; j < 1024; ++j) { - dp[K][j] = 0; - } - } - - K ^= 1; - int result = 0; - for (int i = 0; i < 1024; i++) { - result += dp[K][i]; - result %= m; - } - return result; -} - -int main() { - input(); - preproces(); - printf("%d\n", compute_dp()); -} \ No newline at end of file -- cgit v1.2.3