제출 #1311054

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1311054		M_SH_O	벽 칠하기 (APIO20_paint)	C++20	0 / 100	1 ms	576 KiB

paint

/*#pragma GCC optimize("O3")
#pragma GCC optimization("Ofast,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")*/
#include <bits/stdc++.h>
#include "paint.h"
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>*/
#define ll long long
#define ll1 long long
#define ull unsigned long long
#define dou long double
#define str string
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll, ll>
#define vpll vector<pair<ll, ll>>
#define vbool vector<bool>
#define vstr vector<str>
#define vvll vector<vll>
#define pb push_back
#define pf push_front
#define endl "\n"
#define fr first
#define se second
// #define sortcmp(a) sort(a.begin(), a.end(), cmp)
#define sort(a) sort(a.begin(), a.end())
#define reverse(a) reverse(a.begin(), a.end())
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define ordered_set tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update>

using namespace std;
//using namespace __gnu_pbds;

const ll INF = 1e18+7;
const int lg = 20;
//const ll MOD = 1e9+7;
const ll MOD2 = 998244353;

mt19937 rng(1488);
ll randll(ll l, ll r) {
    return uniform_int_distribution<ll>(l, r)(rng);
}

int minimumInstructions(int n, int m, int k, vi c, vi a, vector<vi> b) {

    vector<unordered_set<ll>> v(m);
    for (int i = 0; i < m; i ++) {
        for (int j : b[i]) {
            v[i].insert(j);
        }
    }

    vll k1(n+7, INF);
    ll l = n;
    vll dp(m);
    for (int i = n-1; i >= 0; i --) {
        vll dp1(m);
        for (int j = 0; j < m; j ++) {
            if (v[j].find(c[i]) == v[j].end()) dp1[j] = -INF;
            else if (i == n-1 || v[(j+1)%m].find(c[i+1]) == v[(j+1)%m].end()) dp1[j] = i;
            else dp1[i] = dp[(j+1)%m];
        }
        dp = dp1;
        if (i+m-1 >= n) continue;
        bool q = 0;

        for (int j = 0; j < m; j ++) {
            //cout << dp[i][j] << ' ';
            if (dp1[j]-i >= m-1) {
                q = 1;
                break;
            }
        }
        //cout << endl;
        //cout << q << endl;
        while (l != n && l > i && k1[l] == INF) l --;
        if (q) {
            if (l == n) k1[i] = 1;
            else if (k1[l] != INF) k1[i] = k1[l]+1;
        }
        l = min(l, (ll)i+m-1);
    }

    if (k1[0] == INF) return -1;
    return k1[0];
}

/*int main(){
    speed;
    srand(time(0));

    cout << minimumInstructions(8, 3, 5, {3, 3, 1, 3, 4, 4, 2, 2}, {3, 2, 2}, {{0, 1, 2}, {2, 3}, {3,4}}) << endl;
}*/

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