Submission #395218

#	Time	Username	Problem	Language	Result	Execution time	Memory
395218		abc864197532	Painting Walls (APIO20_paint)	C++17	63 / 100	1626 ms	407352 KiB

paint

#include <bits/stdc++.h>
// #include "grader_paint.cpp"
using namespace std;
#define lli long long int
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define test(x) cout << "Line(" << __LINE__ << ") " #x << ' ' << x << endl
#define printv(x) {\
	for (auto i : x) cout << i << ' ';\
	cout << endl;\
}
#define pii pair <int, int>
#define pll pair <lli, lli>
#define X first
#define Y second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template<typename A, typename B>
ostream& operator << (ostream& o, pair<A, B> a){
    return o << a.X << ' ' << a.Y;
}
template<typename A, typename B>
istream& operator >> (istream& o, pair<A, B> &a){
    return o >> a.X >> a.Y;
}

int minimumInstructions(int n, int m, int k,vector <int> c, vector <int> a, vector <vector <int>> b) {
    vector <int> tmp[n], pos[k];
    int cha[n];
    for (int i = 0; i < n; ++i) cha[i] = i < m ? i : cha[i - m];
    for (int i = 0; i < n; ++i) pos[c[i]].pb(i);
    for (int i = 0; i < m; ++i) {
        for (int j : b[i]) {
            for (int ii : pos[j]) {
                int t = ii - i;
                t = t >= 0 ? cha[t] : t + m;
                tmp[ii].pb(t);
            }
        }
    }
    int cnt[m]{}, num[m + 1]{};
    bool seg[n + 1]{};
    num[0] = m;
    for (int i = 0; i < m; ++i) {
        for (int j : tmp[i]) {
            num[cnt[j]]--;
            cnt[j]++;
            num[cnt[j]]++;
        }
    }
    if (num[m] > 0) seg[m] = true;
    for (int i = m; i < n; ++i) {
        for (int j : tmp[i - m]) {
            num[cnt[j]]--;
            cnt[j]--;
            num[cnt[j]]++;
        }
        for (int j : tmp[i]) {
            num[cnt[j]]--;
            cnt[j]++;
            num[cnt[j]]++;
        }
        if (num[m] > 0) seg[i + 1] = true;
    }
    int dp[n + 1]{};
    for (int i = 0; i < n + 1; ++i) dp[i] = -1;
    dp[0] = 0;
    deque <int> dq = {0};
    for (int i = 1; i <= n; ++i) if (seg[i]) {
        while (!dq.empty() && dq.front() < i - m) dq.pop_front();
        if (!dq.empty()) dp[i] = dp[dq.front()] + 1;
        if (dp[i] != -1) {
            while (!dq.empty() && dp[dq.back()] >= dp[i]) dq.pop_back();
            dq.push_back(i);
        }
    }
    return dp[n];
}

/*
 8 3 5
 3 3 1 3 4 4 2 2
 3 0 1 2
 2 2 3
 2 3 4

 5 4 4
 1 0 1 2 2
 2 0 1
 1 1
 1 2
 1 3
 */

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