제출 #597379

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
597379		Ozy	벽 칠하기 (APIO20_paint)	C++17	0 / 100	2 ms	3540 KiB

paint

#include "paint.h"
#include<bits/stdc++.h>
using namespace std;
#define lli int
#define rep(i,a,b) for (int i = (a); i <= (b); i++)
#define repa(i,a,b) for (int i = (a); i >= (b); i--)
#define debug(a) cout << #a << " = " << a << endl
#define debugsl(a) cout << #a << " = " << a << ", "

#define MAX 20000
#define MK 100000

lli n,m,k,res,pos,mejor,dif,a,last;
//valores de 0 a m
map<int, int> lejos[MAX+2];
bitset<MK> tabla[2002];
vector<int> contratistas[MK];
lli top[MAX+2];
//checar memoria

int minimumInstructions(int N, int M, int K, std::vector<int> C,std::vector<int> A, std::vector<std::vector<int>> B) {
    n = N;
    m = M;
    k = K;

    rep(i,0,m-1) {
        rep(j,0,A[i]-1) {
            tabla[i][B[i][j]] = 1;
            contratistas[B[i][j]].push_back(i);
        }
    }

    rep(j,0,m-1) lejos[n][j] = 0;

    repa(i,n-1,0) {
        top[i] = 0;
        for(auto cont : contratistas[C[i]]) {
            lejos[i][cont] = min(m, lejos[i+i].count((cont + 1)%m) ? lejos[i+1][(cont+1)%m] + 1 : 0);
            top[i] = max(top[i], lejos[i][cont]);
        }
    }

    if (top[0] < m) return -1;
    pos = m;
    last = 0;
    res = 1;

    rep(i,1,n-1) {
        if (top[i] == m) last = i;
        if (i == pos) {
            pos = last + m;
            res++;
        }
    }

    if (pos < n) return -1;
    else return res;
}

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