Submission #572009

#	Time	Username	Problem	Language	Result	Execution time	Memory
572009		SlavicG	Painting Walls (APIO20_paint)	C++17	40 / 100	1599 ms	76436 KiB

paint

#include "bits/stdc++.h"
using namespace std;
 
#define ll long long
 
#define       forn(i,n)              for(int i=0;i<n;i++)
#define          all(v)              v.begin(), v.end()
#define         rall(v)              v.rbegin(),v.rend()
 
#define            pb                push_back
#define          sz(a)               (int)a.size()

int minimumInstructions(int n, int m, int k, vector<int> c, vector<int> a, vector<vector<int>> b) {
    vector<int> p[k + 1];

    for(int i = 0; i < m; ++i) {
        for(auto x: b[i]) {
            p[x].pb(i);
        }
    }  
    for(int i = 0; i <= k; ++i) {
        sort(all(p[i]));
        p[i].erase(unique(all(p[i])), p[i].end());
    }

    vector<vector<int>> mx(n);

    for(auto x: p[c[n - 1]]) mx[n - 1].pb(1);

    for(int i = n - 2; i >= 0; --i) {
        for(auto x: p[c[i]]) {
            int newval = x + 1;
            if(newval >= m) newval -= m;
            bool ok = false;
            for(int j = 0; j < sz(p[c[i + 1]]); ++j) {
                if(p[c[i + 1]][j] == newval) {
                    mx[i].pb(mx[i + 1][j] + 1);
                    ok = true;
                    break;
                }
            }
            if(!ok) mx[i].pb(1);
        }
    }

    vector<bool> can(n, false);
    for(int i = 0; i < n; ++i) {
        for(int j = 0; j < sz(mx[i]); ++j) {
            if(mx[i][j] >= m) can[i] = true;
        }
    }


    set<int> good;
    forn(i, n) if(can[i]) good.insert(i); 
    if(good.empty()) return -1;
    if(!can[0]) return -1;
    int lst = -100000000, ans = 0;
    for(int i = 0; i < n; ++i) {
        if(lst + m - 1 >= i) continue;
        ++ans;
        if(can[i]) {
            lst = i;
        } else {
            auto it = good.lower_bound(i);
            if(it == good.begin()) return -1;
            --it;
            if(*it + m - 1 < i) return -1;
            lst = *it;
        }
    }
    return ans;
}

/*
void solve() {  
    int n, m, k; cin >> n >> m >> k;
    vector<int> c(n); forn(i, n) cin >> c[i];
    vector<int> a(m); forn(i, m) cin >> a[i];
    vector<vector<int>> b(m);
    for(int i = 0; i < m; ++i) {
        b[i].resize(a[i]);
        for(int j = 0; j < a[i]; ++j) {
            cin >> b[i][j];
        }
    }
    cout << minimumInstructions(n, m, k, c, a, b) << "\n";
} 
     
int32_t main() {
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t = 1;
    //cin >> t;
    while(t--) {
        solve();
    }
}   
*/

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

Compilation message (stderr)

paint.cpp: In function 'int minimumInstructions(int, int, int, std::vector<int>, std::vector<int>, std::vector<std::vector<int> >)':
paint.cpp:28:14: warning: unused variable 'x' [-Wunused-variable]
   28 |     for(auto x: p[c[n - 1]]) mx[n - 1].pb(1);
      |              ^

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