#include #include #include #include #include #include #include #include #include #include #include using namespace std; const int INT_INF = 2147483647; const int CHAR_INF = 127; const int prim = 1000000007; //struct Node { // int key; // Node* parent; // Node* leftChild, * rightChild; //}; // //void preOrder(Node* x, string& res) { // res += to_string(x->key); // preOrder(x->leftChild, res); // preOrder(x->rightChild, res); //} // //void inOrder(Node* x, string& res) { // inOrder(x->leftChild, res); // res += to_string(x->key); // inOrder(x->rightChild, res); //} // //void postOrder(Node* x, string& res) { // postOrder(x->leftChild, res); // postOrder(x->rightChild, res); // res += to_string(x->key); //} void moveRowLeft(vector& row, const int n) { vector new_row; queue q; for (int i = 0; i < n; i++) { if (row[i] != 0) { if (q.empty() || row[i] != q.back()) q.push(row[i]); else if (row[i] == q.back()) { while (!q.empty()) { new_row.push_back(q.front()); q.pop(); } new_row.back() *= 2; } } } while (!q.empty()) { new_row.push_back(q.front()); q.pop(); } new_row.resize(n); row = new_row; } void moveRowRight(vector& row, const int n) { vector new_row; queue q; for (int i = n-1; i >=0; i--) { if (row[i] != 0) { if (q.empty() || row[i] != q.back()) q.push(row[i]); else if (row[i] == q.back()) { while (!q.empty()) { new_row.push_back(q.front()); q.pop(); } new_row.back() *= 2; } } } while (!q.empty()) { new_row.push_back(q.front()); q.pop(); } new_row.resize(n); reverse(new_row.begin(), new_row.end()); row = new_row; } void moveRowUp(vector>& game, const int col, const int n) { vector new_col; queue q; for (int i = 0; i < n; i++) { if (game[i][col] != 0) { if (q.empty() || game[i][col] != q.front()) q.push(game[i][col]); else if (game[i][col] == q.back()) { while (!q.empty()) { new_col.push_back(q.front()); q.pop(); } new_col.back() *= 2; } } } while (!q.empty()) { new_col.push_back(q.front()); q.pop(); } new_col.resize(n); for (int i = 0; i < n; i++) game[i][col] = new_col[i]; } void moveRowDown(vector>& game, const int col, const int n) { vector new_col; queue q; for (int i = n - 1; i >= 0; i--) { if (game[i][col] != 0) { if (q.empty() || game[i][col] != q.front()) q.push(game[i][col]); else if (game[i][col] == q.back()) { while (!q.empty()) { new_col.push_back(q.front()); q.pop(); } new_col.back() *= 2; } } } while (!q.empty()) { new_col.push_back(q.front()); q.pop(); } new_col.resize(n); reverse(new_col.begin(), new_col.end()); for (int i = 0; i < n; i++) game[i][col] = new_col[i]; } void solve(vector>& game, int& mx, const int n, const int it = 5) { if (it == 0) { for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (mx > game1 = game, game2 = game, game3 = game, game4 = game; for (int i = 0; i < n; i++) { moveRowLeft(game1[i], n); moveRowRight(game2[i], n); moveRowUp(game3, i, n); moveRowDown(game4, i, n); } solve(game3, mx, n, it - 1); solve(game1, mx, n, it - 1); solve(game2, mx, n, it - 1); solve(game4, mx, n, it - 1); } } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; vector> game(n, vector(n)); for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { cin >> game[i][j]; } } int mx = 0; solve(game, mx, n); cout << mx; }

제출 #117412

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: