제출 #401738

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
401738		Collypso	벽 칠하기 (APIO20_paint)	C++17	28 / 100	1595 ms	12020 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()
#pragma GCC optimize ("O3")
#pragma GCC optimize ("O2")
//#define endl '\n'
//#define int long long

using namespace std;

bool exists(vt<int>& master, int m)
{
    auto it = lower_bound(all(master), m);
    if (it == master.end()) return 0;
    return (*it == m);
}

int minimumInstructions(int N, int M, int K, vt<int> C, vt<int> A, vt<vt<int>> B)
{
    vt<int> dp(N, INT_MAX);
    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);
    for(int i = 0; i <= N - M; i++)
    {
        if (i > 0 && dp[i] == INT_MAX && dp[i - 1] == INT_MAX) continue;
        for(int m : master[C[i]])
        {
            int l = 0;
            while(l < M && exists(master[C[i + l]], (m + l) % M)) l++;
            if (l != M) continue;
            int tmp = (i > 0 && (dp[i - 1] != INT_MAX)) ? dp[i - 1] + 1 : 1;
            for(l = 0; l < M; l++) dp[i + l] = min(dp[i + l], tmp);
        }
    }
    if (dp[N - 1] == INT_MAX) return -1;
    return dp[N - 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;
}
/**/

컴파일 시 표준 에러 (stderr) 메시지

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

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