Submission #552978

#	Time	Username	Problem	Language	Result	Execution time	Memory
552978		Itamar	Painting Walls (APIO20_paint)	C++14	0 / 100	0 ms	212 KiB

paint

#include "paint.h"

#include <cassert>
#include <cstdio>
#pragma warning(disable : 4996)
#include <map>
#include <iostream>
using namespace std;
#include <vector>
#include <queue>
#include <set>
#include <algorithm>
#define ll long long
#define vi vector<int> 
#define vll vector<ll>
#define pi pair<int,int> 
#define pll pair<ll,ll>

int minimumInstructions(
    int N, int M, int K, std::vector<int> C,
    std::vector<int> A, std::vector<std::vector<int>> B) {
    
    vi com(K,-1);
    for (int i = 0; i < M; i++) {
        for (int j = 0; j < A[i]; j++) {
            com[B[i][j]] = i;
        }
    }
    vector<bool> las(N);
   
    for (int i = 0; i < N-1; i++) {
        if (com[C[i]] == -1)
            return -1;
        if (com[C[i + 1]] != (com[C[i]] + 1) % M) {
            las[i] = 1;
        }
    }
    int sum = 0;
    las[N - 1] = 1;
    int last = -1;
    for (int i = 0; i < N; i++) {
        if (las[i]) {
            if (i - last < M)
                return -1;
            sum += (i - last+M-1) / M;
            last = i;
        }
    }
    return sum;
}
/*
int main() {
    int N, M, K;
    assert(3 == scanf("%d %d %d", &N, &M, &K));

    std::vector<int> C(N);
    for (int i = 0; i < N; ++i) {
        assert(1 == scanf("%d", &C[i]));
    }

    std::vector<int> A(M);
    std::vector<std::vector<int>> B(M);
    for (int i = 0; i < M; ++i) {
        assert(1 == scanf("%d", &A[i]));
        B[i].resize(A[i]);
        for (int j = 0; j < A[i]; ++j) {
            assert(1 == scanf("%d", &B[i][j]));
        }
    }

    int minimum_instructions = minimumInstructions(N, M, K, C, A, B);
    printf("%d\n", minimum_instructions);

    return 0;
}*/

Compilation message (stderr)

paint.cpp:5: warning: ignoring '#pragma warning ' [-Wunknown-pragmas]
    5 | #pragma warning(disable : 4996)
      |

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