# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
979611 | 2024-05-11T08:30:25 Z | vjudge1 | 벽 칠하기 (APIO20_paint) | C++17 | 0 ms | 0 KB |
#include "paint.h" #include<bits/stdc++.h> using namespace std; const int INF = 1e9; ll _ok[600][600]; int eq(vector<int> c, int p, vector<vector<int>> b, int m) { int ok = 1; for(int i = p; i < p + m; ++i) ok &= _ok[i - p][i]; return ok; } void sdvig(vector<vector<int>> &b, int m) { for(int i = 0; i < m - 1; ++i) swap(b[i], b[i + 1]); } int minimumInstructions(int n, int m, int k, vector<int> c, vector<int> a, vector<vector<int>> b) { int i, j; int dp[n + 5] = {}; for(i = 0; i < n; ++i) for(j = 0; j < m; ++j) for(int r : b[j]) _ok[j][i] |= (r == c[i]); for(i = 0; i <= n - m; ++i) { for(int t = 0; t < m && !dp[i]; ++t) { if(eq(c, i, b, m)) dp[i] = 1; sdvig(b, m); } } int ans = 1, cur = 0; while(cur < n - m) { int lst = INF; for(i = cur + 1; i <= cur + m; ++i) if(dp[i]) lst = i; cur = lst; ++ans; } // for(i = 0; i < n; ++i) // cout << dp[i] << ' '; // return; return (cur < INF ? ans : -1); } //int main() //{ //// ios_base::sync_with_stdio(0); //// cin.tie(0), cout.tie(0); //// solve(); //} //8 3 5 //3 3 1 3 4 4 2 2 //3 0 1 2 //2 2 3 //2 3 4