제출 #290186

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
290186		fucking_do_it	벽 칠하기 (APIO20_paint)	C++14	28 / 100	1580 ms	275904 KiB

paint

#include "paint.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int inf = 2e4+9,MX = 1e9+9;
int n,m,k;
int a[inf];
vector<int> Cont[inf];
int LCS[inf][2009],dp[inf];
bool valid[inf];
unordered_map<int,int> mp[2009];

bool like(int i,int j){
    return mp[j][ a[i] ];
    int idx = lower_bound(Cont[j].begin(),Cont[j].end(),a[i]) - Cont[j].begin();
    if(idx < Cont[j].size() && Cont[j][idx] == a[i])
        return 1;
    return 0;
}

int minimumInstructions(int N, int M, int K, vector<int> C,
   vector<int> A,vector<vector<int>> B) {

    n = N, m = M,k = K;
    for(int i=1;i<=n;i++)
        a[i] = C[i-1]+1;
    for(int i=1;i<=m;i++){
        for(auto o:B[i-1])
            Cont[i].push_back(o+1),mp[i][o+1] = 1;
        sort(Cont[i].begin(),Cont[i].end());
    }

    for(int i=n;i>=1;i--){
        for(int j=m;j>=1;j--){
            if(like(i,j))
                LCS[i][j] = LCS[i+1][j+1] + 1;
            else
                LCS[i][j] = 0;
        }
    }

    for(int y=1;y <= n-m+1;y++){
        for(int x = 1;x <= m;x++){
            int len1 = m-x+1,i1 = y,j1 = x,tmp1;
            tmp1 = LCS[i1][j1];

            int len2 = x-1,i2 = y+len1,j2 = 1,tmp2 = 0;
            if(len2)
                tmp2 = LCS[i2][j2];

            valid[y] |= (tmp1 >= len1 && tmp2 >= len2);
        }
    }
    for(int i=1;i<=n;i++)
        dp[i] = MX;

    dp[n-m+1] = (valid[n-m+1]?1:MX);

    for(int i=n-m;i>=1;i--)
        for(int j=i+1;j<=i+m && valid[i];j++)
            dp[i] = min(dp[i],dp[j] + 1);

    return ( (dp[1] == MX)?-1:dp[1]);
}

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

paint.cpp: In function 'bool like(int, int)':
paint.cpp:16:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |     if(idx < Cont[j].size() && Cont[j][idx] == a[i])
      |        ~~~~^~~~~~~~~~~~~~~~

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