#include <bits/stdc++.h> using namespace std; stack<pair<int, int>> fields_to_check; vector<vector<bool>> board; //vector<vector<bool>> board_temp; queue<pair<int, int>> fields_modified; unordered_set<int> blocks_able_to_remove; unordered_set<int> curr_extra_blocks_able_to_remove; unordered_set<int> curr_extra_blocks_unable_to_remove; unordered_set<int> fields_with_true; int n,m; pair<int, int> decode_int_coords(int &coords) { return { coords / board[0].size(), coords % board[0].size() }; } int encode_coords(pair<int, int> &coords) { return coords.first * board[0].size() + coords.second; } bool is_removable_before(pair<int, int> coords) { return blocks_able_to_remove.find(encode_coords(coords)) != blocks_able_to_remove.end(); } bool is_in_curr_blocks_able(pair<int, int> coords) { return curr_extra_blocks_able_to_remove.find(encode_coords(coords)) != curr_extra_blocks_able_to_remove.end(); } bool is_in_curr_unable_blocks(pair<int, int> coords) { return curr_extra_blocks_unable_to_remove.find(encode_coords(coords)) != curr_extra_blocks_unable_to_remove.end(); } void rollout_board() { while(!fields_modified.empty()) { pair<int, int> cords = fields_modified.front(); fields_modified.pop(); board[cords.first][cords.second] = true; } } int get_result(pair<int,int> changed_field = {-1, -1}) { //int iterations = 0; curr_extra_blocks_able_to_remove.clear(); curr_extra_blocks_unable_to_remove.clear(); int encoded_coords; bool is_block_removable_previously; while(!fields_to_check.empty()) { pair<int, int> coords = fields_to_check.top(); fields_to_check.pop(); encoded_coords = encode_coords(coords); is_block_removable_previously = blocks_able_to_remove.find(encoded_coords) != blocks_able_to_remove.end(); //++iterations; if( ((board[coords.first + 1][coords.second] || board[coords.first - 1][coords.second]) == false) || ((board[coords.first][coords.second + 1] || board[coords.first][coords.second - 1]) == false) || (coords == changed_field && !board[coords.first][coords.second])) { if(coords == changed_field && !board[coords.first][coords.second]) { changed_field = {-1, -1}; } if(board[coords.first][coords.second]) { board[coords.first][coords.second] = false; fields_modified.push(coords); //blocks_able_to_remove.insert(encoded_coords); curr_extra_blocks_able_to_remove.insert(encoded_coords); } // to ze jestesmy w tym ifie swiadczy o tym, ze blok na coords jestesmy juz w stanie usunac Algosia if(board[coords.first][coords.second + 1] && !is_removable_before({coords.first, coords.second + 1})) { fields_to_check.push({coords.first, coords.second + 1}); } if(board[coords.first][coords.second - 1] && !is_removable_before({coords.first, coords.second - 1})) { fields_to_check.push({coords.first, coords.second - 1}); } if(board[coords.first + 1][coords.second] && !is_removable_before({coords.first + 1, coords.second})) { fields_to_check.push({coords.first + 1, coords.second}); } if(board[coords.first - 1][coords.second] && !is_removable_before({coords.first - 1, coords.second})) { fields_to_check.push({coords.first - 1, coords.second}); } } else { bool should_come_back = false; if(board[coords.first][coords.second] && (is_block_removable_previously || changed_field == coords) && !(is_in_curr_unable_blocks(coords) || is_in_curr_blocks_able(coords))) { //blocks_able_to_remove.erase(encoded_coords); if(curr_extra_blocks_able_to_remove.find(encoded_coords) == curr_extra_blocks_able_to_remove.end() && changed_field != coords) { curr_extra_blocks_unable_to_remove.insert(encoded_coords); } if(changed_field == coords) { changed_field = {0, 0}; } /*should_come_back = (board[coords.first][coords.second + 1] && is_removable_before({coords.first, coords.second + 1})) || (board[coords.first][coords.second - 1] && is_removable_before({coords.first, coords.second - 1})) || (board[coords.first + 1][coords.second] && is_removable_before({coords.first + 1, coords.second})) || (board[coords.first - 1][coords.second] && is_removable_before({coords.first - 1, coords.second})); if(should_come_back) { fields_to_check.push(coords); }*/ if(board[coords.first][coords.second + 1] && is_removable_before({coords.first, coords.second + 1})) { fields_to_check.push({coords.first, coords.second + 1}); } if(board[coords.first][coords.second - 1] && is_removable_before({coords.first, coords.second - 1})) { fields_to_check.push({coords.first, coords.second - 1}); } if(board[coords.first + 1][coords.second] && is_removable_before({coords.first + 1, coords.second})) { fields_to_check.push({coords.first + 1, coords.second}); } if(board[coords.first - 1][coords.second] && is_removable_before({coords.first - 1, coords.second})) { fields_to_check.push({coords.first - 1, coords.second}); } } } } //cout << "ok" << endl; for(auto const it : curr_extra_blocks_unable_to_remove) { blocks_able_to_remove.erase(it); } for(auto const it : curr_extra_blocks_able_to_remove) { blocks_able_to_remove.insert(it); } rollout_board(); //cout << "iteracji: " << iterations << endl; return blocks_able_to_remove.size(); } int main() { char buffer[100]; int k, q; bool brute_force = false; fgets(buffer, sizeof(buffer), stdin); sscanf(buffer, " %d %d %d %d ", &n, &m, &k, &q); vector<pair<int, int>> k_pairs(k); vector<pair<int, int>> q_pairs(q); board.resize(n + 2, vector<bool>(m + 2, false)); /*pair<int, int> p1 {1, 2}; pair<int, int> p2 {2, 1}; cout << encode_coords(p1) << " " << encode_coords(p2) << endl;*/ for (int i = 0; i < k; i++) { fgets(buffer, sizeof(buffer), stdin); sscanf(buffer, "%d %d", &k_pairs[i].first, &k_pairs[i].second); board[k_pairs[i].first][k_pairs[i].second] = true; //board_temp[k_pairs[i].first][k_pairs[i].second] = true; fields_to_check.push(k_pairs[i]); if(brute_force) { fields_with_true.insert(encode_coords(k_pairs[i])); } } int result = get_result(); printf("%d\n", result); for (int i = 0; i < q; i++) { fgets(buffer, sizeof(buffer), stdin); sscanf(buffer, "%d %d", &q_pairs[i].first, &q_pairs[i].second); board[q_pairs[i].first][q_pairs[i].second] = !board[q_pairs[i].first][q_pairs[i].second]; if(brute_force) { if(board[q_pairs[i].first][q_pairs[i].second]) { fields_with_true.insert(encode_coords(q_pairs[i])); } else { fields_with_true.erase(encode_coords(q_pairs[i])); } for(auto it : fields_with_true) { fields_to_check.push(decode_int_coords(it)); } printf("%d\n", get_result()); continue; } if(!board[q_pairs[i].first][q_pairs[i].second]) { // tu usuniety klocek zostal fields_to_check.push(q_pairs[i]); //++previous_result; if(is_removable_before(q_pairs[i])) { blocks_able_to_remove.erase(encode_coords(q_pairs[i])); } result = get_result(q_pairs[i]); } else { // tu dolozony klocek na coords /*pair<int, int> coords = q_pairs[i]; bool removable_sec1, removable_sec_minus1, removable_fir1, removable_fir_minus1; if(board[q_pairs[i].first][q_pairs[i].second + 1] && is_removable_before({coords.first, coords.second + 1})) { fields_to_check.push({q_pairs[i].first, q_pairs[i].second + 1}); } if(board[q_pairs[i].first][q_pairs[i].second - 1] && is_removable_before({coords.first, coords.second - 1})) { fields_to_check.push({q_pairs[i].first, q_pairs[i].second - 1}); } if(board[q_pairs[i].first + 1][q_pairs[i].second] && is_removable_before({coords.first + 1, coords.second})) { fields_to_check.push({q_pairs[i].first + 1, q_pairs[i].second}); } if(board[q_pairs[i].first - 1][q_pairs[i].second] && is_removable_before({coords.first - 1, coords.second})) { fields_to_check.push({q_pairs[i].first - 1, q_pairs[i].second}); } removable_sec1 = !board[q_pairs[i].first][q_pairs[i].second + 1] || is_removable_before({coords.first, coords.second + 1}); removable_sec_minus1 = !board[q_pairs[i].first][q_pairs[i].second - 1] || is_removable_before({coords.first, coords.second - 1}); removable_fir1 = !board[q_pairs[i].first + 1][q_pairs[i].second] || is_removable_before({coords.first + 1, coords.second}); removable_fir_minus1 = !board[q_pairs[i].first - 1][q_pairs[i].second] || is_removable_before({coords.first - 1, coords.second}); if( (removable_fir1 && removable_fir_minus1) || (removable_sec1 && removable_sec_minus1) ) { blocks_able_to_remove.insert(encode_coords(q_pairs[i])); }*/ fields_to_check.push(q_pairs[i]); result = get_result(q_pairs[i]); } //cout << "ok" << endl; printf("%d\n", result); } return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 | #include <bits/stdc++.h> using namespace std; stack<pair<int, int>> fields_to_check; vector<vector<bool>> board; //vector<vector<bool>> board_temp; queue<pair<int, int>> fields_modified; unordered_set<int> blocks_able_to_remove; unordered_set<int> curr_extra_blocks_able_to_remove; unordered_set<int> curr_extra_blocks_unable_to_remove; unordered_set<int> fields_with_true; int n,m; pair<int, int> decode_int_coords(int &coords) { return { coords / board[0].size(), coords % board[0].size() }; } int encode_coords(pair<int, int> &coords) { return coords.first * board[0].size() + coords.second; } bool is_removable_before(pair<int, int> coords) { return blocks_able_to_remove.find(encode_coords(coords)) != blocks_able_to_remove.end(); } bool is_in_curr_blocks_able(pair<int, int> coords) { return curr_extra_blocks_able_to_remove.find(encode_coords(coords)) != curr_extra_blocks_able_to_remove.end(); } bool is_in_curr_unable_blocks(pair<int, int> coords) { return curr_extra_blocks_unable_to_remove.find(encode_coords(coords)) != curr_extra_blocks_unable_to_remove.end(); } void rollout_board() { while(!fields_modified.empty()) { pair<int, int> cords = fields_modified.front(); fields_modified.pop(); board[cords.first][cords.second] = true; } } int get_result(pair<int,int> changed_field = {-1, -1}) { //int iterations = 0; curr_extra_blocks_able_to_remove.clear(); curr_extra_blocks_unable_to_remove.clear(); int encoded_coords; bool is_block_removable_previously; while(!fields_to_check.empty()) { pair<int, int> coords = fields_to_check.top(); fields_to_check.pop(); encoded_coords = encode_coords(coords); is_block_removable_previously = blocks_able_to_remove.find(encoded_coords) != blocks_able_to_remove.end(); //++iterations; if( ((board[coords.first + 1][coords.second] || board[coords.first - 1][coords.second]) == false) || ((board[coords.first][coords.second + 1] || board[coords.first][coords.second - 1]) == false) || (coords == changed_field && !board[coords.first][coords.second])) { if(coords == changed_field && !board[coords.first][coords.second]) { changed_field = {-1, -1}; } if(board[coords.first][coords.second]) { board[coords.first][coords.second] = false; fields_modified.push(coords); //blocks_able_to_remove.insert(encoded_coords); curr_extra_blocks_able_to_remove.insert(encoded_coords); } // to ze jestesmy w tym ifie swiadczy o tym, ze blok na coords jestesmy juz w stanie usunac Algosia if(board[coords.first][coords.second + 1] && !is_removable_before({coords.first, coords.second + 1})) { fields_to_check.push({coords.first, coords.second + 1}); } if(board[coords.first][coords.second - 1] && !is_removable_before({coords.first, coords.second - 1})) { fields_to_check.push({coords.first, coords.second - 1}); } if(board[coords.first + 1][coords.second] && !is_removable_before({coords.first + 1, coords.second})) { fields_to_check.push({coords.first + 1, coords.second}); } if(board[coords.first - 1][coords.second] && !is_removable_before({coords.first - 1, coords.second})) { fields_to_check.push({coords.first - 1, coords.second}); } } else { bool should_come_back = false; if(board[coords.first][coords.second] && (is_block_removable_previously || changed_field == coords) && !(is_in_curr_unable_blocks(coords) || is_in_curr_blocks_able(coords))) { //blocks_able_to_remove.erase(encoded_coords); if(curr_extra_blocks_able_to_remove.find(encoded_coords) == curr_extra_blocks_able_to_remove.end() && changed_field != coords) { curr_extra_blocks_unable_to_remove.insert(encoded_coords); } if(changed_field == coords) { changed_field = {0, 0}; } /*should_come_back = (board[coords.first][coords.second + 1] && is_removable_before({coords.first, coords.second + 1})) || (board[coords.first][coords.second - 1] && is_removable_before({coords.first, coords.second - 1})) || (board[coords.first + 1][coords.second] && is_removable_before({coords.first + 1, coords.second})) || (board[coords.first - 1][coords.second] && is_removable_before({coords.first - 1, coords.second})); if(should_come_back) { fields_to_check.push(coords); }*/ if(board[coords.first][coords.second + 1] && is_removable_before({coords.first, coords.second + 1})) { fields_to_check.push({coords.first, coords.second + 1}); } if(board[coords.first][coords.second - 1] && is_removable_before({coords.first, coords.second - 1})) { fields_to_check.push({coords.first, coords.second - 1}); } if(board[coords.first + 1][coords.second] && is_removable_before({coords.first + 1, coords.second})) { fields_to_check.push({coords.first + 1, coords.second}); } if(board[coords.first - 1][coords.second] && is_removable_before({coords.first - 1, coords.second})) { fields_to_check.push({coords.first - 1, coords.second}); } } } } //cout << "ok" << endl; for(auto const it : curr_extra_blocks_unable_to_remove) { blocks_able_to_remove.erase(it); } for(auto const it : curr_extra_blocks_able_to_remove) { blocks_able_to_remove.insert(it); } rollout_board(); //cout << "iteracji: " << iterations << endl; return blocks_able_to_remove.size(); } int main() { char buffer[100]; int k, q; bool brute_force = false; fgets(buffer, sizeof(buffer), stdin); sscanf(buffer, " %d %d %d %d ", &n, &m, &k, &q); vector<pair<int, int>> k_pairs(k); vector<pair<int, int>> q_pairs(q); board.resize(n + 2, vector<bool>(m + 2, false)); /*pair<int, int> p1 {1, 2}; pair<int, int> p2 {2, 1}; cout << encode_coords(p1) << " " << encode_coords(p2) << endl;*/ for (int i = 0; i < k; i++) { fgets(buffer, sizeof(buffer), stdin); sscanf(buffer, "%d %d", &k_pairs[i].first, &k_pairs[i].second); board[k_pairs[i].first][k_pairs[i].second] = true; //board_temp[k_pairs[i].first][k_pairs[i].second] = true; fields_to_check.push(k_pairs[i]); if(brute_force) { fields_with_true.insert(encode_coords(k_pairs[i])); } } int result = get_result(); printf("%d\n", result); for (int i = 0; i < q; i++) { fgets(buffer, sizeof(buffer), stdin); sscanf(buffer, "%d %d", &q_pairs[i].first, &q_pairs[i].second); board[q_pairs[i].first][q_pairs[i].second] = !board[q_pairs[i].first][q_pairs[i].second]; if(brute_force) { if(board[q_pairs[i].first][q_pairs[i].second]) { fields_with_true.insert(encode_coords(q_pairs[i])); } else { fields_with_true.erase(encode_coords(q_pairs[i])); } for(auto it : fields_with_true) { fields_to_check.push(decode_int_coords(it)); } printf("%d\n", get_result()); continue; } if(!board[q_pairs[i].first][q_pairs[i].second]) { // tu usuniety klocek zostal fields_to_check.push(q_pairs[i]); //++previous_result; if(is_removable_before(q_pairs[i])) { blocks_able_to_remove.erase(encode_coords(q_pairs[i])); } result = get_result(q_pairs[i]); } else { // tu dolozony klocek na coords /*pair<int, int> coords = q_pairs[i]; bool removable_sec1, removable_sec_minus1, removable_fir1, removable_fir_minus1; if(board[q_pairs[i].first][q_pairs[i].second + 1] && is_removable_before({coords.first, coords.second + 1})) { fields_to_check.push({q_pairs[i].first, q_pairs[i].second + 1}); } if(board[q_pairs[i].first][q_pairs[i].second - 1] && is_removable_before({coords.first, coords.second - 1})) { fields_to_check.push({q_pairs[i].first, q_pairs[i].second - 1}); } if(board[q_pairs[i].first + 1][q_pairs[i].second] && is_removable_before({coords.first + 1, coords.second})) { fields_to_check.push({q_pairs[i].first + 1, q_pairs[i].second}); } if(board[q_pairs[i].first - 1][q_pairs[i].second] && is_removable_before({coords.first - 1, coords.second})) { fields_to_check.push({q_pairs[i].first - 1, q_pairs[i].second}); } removable_sec1 = !board[q_pairs[i].first][q_pairs[i].second + 1] || is_removable_before({coords.first, coords.second + 1}); removable_sec_minus1 = !board[q_pairs[i].first][q_pairs[i].second - 1] || is_removable_before({coords.first, coords.second - 1}); removable_fir1 = !board[q_pairs[i].first + 1][q_pairs[i].second] || is_removable_before({coords.first + 1, coords.second}); removable_fir_minus1 = !board[q_pairs[i].first - 1][q_pairs[i].second] || is_removable_before({coords.first - 1, coords.second}); if( (removable_fir1 && removable_fir_minus1) || (removable_sec1 && removable_sec_minus1) ) { blocks_able_to_remove.insert(encode_coords(q_pairs[i])); }*/ fields_to_check.push(q_pairs[i]); result = get_result(q_pairs[i]); } //cout << "ok" << endl; printf("%d\n", result); } return 0; } |