Submission #870741

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
870741	2023-11-09T02:53:56 Z	marvinthang	Painting Walls (APIO20_paint)	C++17	0 / 100	0 ms	432 KB

paint

/*************************************
*    author: marvinthang             *
*    created: 09.11.2023 09:30:12    *
*************************************/

#include "paint.h"
#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i-- > 0; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }

// end of template

const int INF = 1e9;

int minimumInstructions(int N, int M, int K, vector <int> C, vector <int> A, vector <vector <int>> B) {
    vector <vector <int>> List(K);
    REP(i, M) REP(j, A[i]) List[B[i][j]].push_back(i);
    vector <int> dp(N + 1, INF);
    dp[0] = 0;
    vector <int> max_len(M), nxt(M);
    vector <bool> exist(M);
    int last = 0;
    deque <int> dq;
    dq.push_back(0);
    REP(i, N) {
        for (int j: List[C[i]]) {
            int prv = j ? j - 1 : M - 1;
            nxt[j] = exist[prv] ? max_len[prv] + 1 : 1;
        }
        if (i) for (int j: List[C[i - 1]]) exist[j] = false;
        bool ok = false;
        for (int j: List[C[i]]) {
            exist[j] = true;
            max_len[j] = nxt[j];
            if (max_len[j] >= M) {
                ok = true;
            }
        }
        if (dq.front() <= i - M) dq.pop_front();
        if (ok) dp[i + 1] = dp[dq.front()] + 1;
        while (!dq.empty() && dp[dq.back()] >= dp[i + 1]) dq.pop_back();
        dq.push_back(i + 1);
    }
    return dp[N] == INF ? -1 : dp[N];
}

Compilation message

paint.cpp: In function 'int minimumInstructions(int, int, int, std::vector<int>, std::vector<int>, std::vector<std::vector<int> >)':
paint.cpp:55:9: warning: unused variable 'last' [-Wunused-variable]
   55 |     int last = 0;
      |         ^~~~

Subtask #1
0 / 12.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	432 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Incorrect	348 KB	Output isn't correct
10	Halted	0 KB	-

Subtask #2
0 / 15.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	432 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Incorrect	348 KB	Output isn't correct
10	Halted	0 KB	-

Subtask #3
0 / 13.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	432 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Incorrect	348 KB	Output isn't correct
10	Halted	0 KB	-

Subtask #4
0 / 23.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	432 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Incorrect	348 KB	Output isn't correct
10	Halted	0 KB	-

Subtask #5
0 / 37.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	432 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Incorrect	348 KB	Output isn't correct
10	Halted	0 KB	-

Submission #870741

Compilation message

Subtask #1 0 / 12.0

Subtask #2 0 / 15.0

Subtask #3 0 / 13.0

Subtask #4 0 / 23.0

Subtask #5 0 / 37.0

Subtask #1
0 / 12.0

Subtask #2
0 / 15.0

Subtask #3
0 / 13.0

Subtask #4
0 / 23.0

Subtask #5
0 / 37.0