Submission #402085

#	Time	Username	Problem	Language	Result	Execution time	Memory
402085		Collypso	Painting Walls (APIO20_paint)	C++17	40 / 100	1223 ms	524292 KiB

paint

//#include <bits/stdc++.h>
#include <vector>
#include <unordered_map>
#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

using namespace std;

int minimumInstructions(int N, int M, int K, vt<int> C, vt<int> A, vt<vt<int>> B)
{
    vt<vt<int>> master(K);
    for(int i = 0; i < M; i++)
        for(int j = 0; j < A[i]; j++) master[B[i][j]].pb(i);
    vt<unordered_map<int, int>> dp(N);
    vt<int> dpMax(N);
    dpMax[0] = 1;
    for(int m : master[C[0]]) dp[0][m] = 1;
    for(int i = 1; i < N; i++)
    {
        for(int m : master[C[i]])
        {
            int len = min(M, dp[i - 1][(m + M - 1) % M] + 1);
            dp[i][m] = len;
            dpMax[i] = max(dpMax[i], len);
        }
    }
    int ans = 0, pos = -1;
    for(int i = M - 1, d = 1, flag = 0; i < N && d > 0; i++, d--)
    {
        if (dpMax[i] == M) pos = i, flag = 1;
        if ((d == 1 || i == N - 1) && flag) ans++, d = M - (i - pos) + 1, flag = 0;
    }
    if (pos == N - 1) return ans;
    return -1;
}

/**
main()
{
	ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    freopen("input.txt", "r", stdin);
    int N, M, K;
    cin >> N >> M >> K;
    vt<int> C(N), A(M);
    vt<vt<int>> B(M);
    for(int i = 0; i < N; i++) cin >> C[i];
    for(int i = 0; i < M; i++)
    {
        cin >> A[i];
        B[i].resize(A[i]);
        for(int j = 0; j < A[i]; j++) cin >> B[i][j];
    }

    //cout << M << endl;
    int ans = minimumInstructions(N, M, K, C, A, B);
    cout << ans << endl;

    //int ans = minimumInstructions(6, 4, 4, {2, 1, 0, 3, 2, 1}, {3}, {{2}, {1}, {0}, {3}});
    //cout << ans << endl;
}
/**/

Compilation message (stderr)

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

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