#include #include #include #include #define TDArray std::vector> struct SpinType{ int R, C, S; }; int solution(int, int, std::vector&, TDArray&); int minCal(TDArray&); void spin(int, int, int, TDArray&); int main(int argc, char* argv[]){ int N, M, K; scanf("%d %d %d", &N, &M, &K); TDArray array(N, std::vector(M)); for(int i = 0; i < N; i++){ for(int j = 0; j < M; j++){ scanf("%d ", &array[i][j]); } } std::vector spinArray(K); for(int i = 0; i < K; i++){ scanf("%d %d %d", &spinArray[i].R, &spinArray[i].C, &spinArray[i].S); spinArray[i].R--; spinArray[i].C--; } printf("%d", solution(0, K, spinArray, array)); return 0; } int solution(int depth, int size, std::vector& spinArray, TDArray& array){ static int result = INT_MAX; static int buffer[8] = {0,}; static bool check[8] = {false,}; if(depth == size){ TDArray TArray = array; for(const int& element : buffer){ if(!element){ break; } spin(spinArray[element-1].R, spinArray[element-1].C, spinArray[element-1].S, TArray); } return result = std::min(result, minCal(TArray)); } for(int i = 0; i < size; i++){ if(check[i]){ continue; } buffer[depth] = i+1; check[i] = true; solution(depth+1, size, spinArray, array); check[i] = false; } return result; } int minCal(TDArray& array){ int result = INT_MAX; for(const std::vector& element : array){ int sum = 0; for(const int& num : element){ sum += num; } result = std::min(sum, result); } return result; } void spin(int R, int C, int S, TDArray& array){ if(S == 0){ return; } int buffer = array[R-S][C+S]; for(int i = R-S+1; i <= R+S; i++){ std::swap(buffer, array[i][C+S]); } for(int i = C+S-1; i > C-S; i--){ std::swap(buffer, array[R+S][i]); } for(int i = R+S; i >= R-S; i--){ std::swap(buffer, array[i][C-S]); } for(int i = C-S+1; i <= C+S; i++){ std::swap(buffer, array[R-S][i]); } spin(R, C, S-1, array); }

코드 #5455