# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
399624 | Collypso | Painting Walls (APIO20_paint) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int) (x).size()
#pragma GCC optimize ("O3")
#pragma GCC optimize ("O2")
//#define endl '\n'
#define int long long
#define intt int
using namespace std;
intt minimumInstructions(intt N, intt M, intt K, vt<intt> C, vt<intt> A, vt<vt<intt>> B)
{
vt<int> dp(N);
for(int i = 0; i <= N - M; i++)
{
if (i > 0 && dp[i - 1] == 0) continue;
for(int master = 0; master < M; master++)
{
int m = master;
for(int j = i; j < N; j++, m = (m + 1) % M)
{
int tmp1 = lower_bound(all(B[m]), C[j]) - B[m].begin();
if (B[m][tmp1] != C[j]) break;
if ((j - i + 1) >= M)
{
int tmp2 = i > 0 ? dp[i - 1] : 0;
int tmp3 = ((j - i + M) / M + tmp2);
dp[j] = dp[j] ? min(dp[j], tmp3) : tmp3;
}
}
}
}
if (dp[N - 1]) return dp[N - 1];
return -1;
}
/**
main()
{
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int ans = minimumInstructions(6, 4, 4, {2, 1, 0, 3, 2, 1}, {3}, {{2}, {1}, {0}, {3}});
cout << ans << endl;
}
/**/