Submission #399356

#	Time	Username	Problem	Language	Result	Execution time	Memory
399356		Collypso	Painting Walls (APIO20_paint)	C++17	0 / 100	1 ms	208 KiB

paint

#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()
#define print(x) cout << x << endl
#pragma GCC optimize ("O3")
#pragma GCC optimize ("O2")
//#define endl '\n'
//#define int long long

using namespace std;

int minimumInstructions(int N, int M, int K, vt<int> C, vt<int> A, vt<vt<int>> B)
{
    vt<int> dp(N);

    int i = 0;
    while(i <= N - M)
    {
        if (i > 0 && !dp[i - 1])
        {
            i++;
            continue;
        }
        for(int master = 0; master < M; master++)
        {
            int m = master;
            int j = i;
            while(j < N)
            {
                int tmp = lower_bound(all(B[m]), C[j]) - B[m].begin();
                if (B[m][tmp] != C[j]) break;
                m = (m + 1) % M;
                j++;
            }
            j--;
            //cout << j << endl;
            if (j - i + 1 < M)
            {
                i++;
                continue;
            }
            int tmp = i > 0 ? dp[i - 1] : 0;
            dp[j] = !dp[j] ? (j - i + M) / M + tmp : min(dp[j], (j - i + M) / M + tmp);

        }
        //cout << endl;
        i++;
    }

    //for(int x : dp) cout << x << " ";
    //cout << endl;

    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}});
    print(ans);
}
/**/

Compilation message (stderr)

paint.cpp:68:1: warning: "/*" within comment [-Wcomment]
   68 | /**/
      |

• Subtask 1: 0 / 12
• Subtask 2: 0 / 15
• Subtask 3: 0 / 13
• Subtask 4: 0 / 23
• Subtask 5: 0 / 37