Submission #236793

#	Time	Username	Problem	Language	Result	Execution time	Memory
236793		Vimmer	Vođe (COCI17_vode)	C++14	0 / 120	235 ms	21112 KiB

vode

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 100001
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef short int si;
typedef array <int, 2> a2;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;


int a[5005];

bool mk1[5005], mk0[5005];

vector <int> g[5005];

int main()
{
    //freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n, m, k;

    cin >> n >> m >> k;

    for (int i = 0; i < n; i++) cin >> a[i];

    for (int i = m; i >= 0; i--)
        for (int j = i - 1; j >= i - k; j--) g[i].pb(j);

    mk0[m] = 1;

    for (int i = m; i >= 0; i--)
    {
        for (auto it : g[i])
        {
            if (mk0[i]) mk1[it] = 1;

            if (mk1[i]) mk0[it] = 1;
        }
    }

    for (int i = 0; i < n; i++)
    {
        int cur = i, v = 0;

        while (v != m)
        {
            int nxt = (cur + 1) % n;

            if (a[nxt] == a[cur])
            {
                bool fnd = 0;

                for (int j = v + 1; j <= min(m, v + k); j++)
                  if (mk1[j]) {v = j; fnd = 1; break;}

                if (!fnd) v++;
            }
            else
            {
                bool fnd = 0;

                for (int j = v + 1; j <= min(m, v + k); j++)
                  if (mk0[j]) {v = j; fnd = 1; break;}

                if (!fnd) v++;
            }

            cur = nxt;
        }

        cout << a[cur] << " ";
    }
}

• Subtask 1: 0 / 12
• Subtask 2: 0 / 12
• Subtask 3: 0 / 12
• Subtask 4: 0 / 12
• Subtask 5: 0 / 12
• Subtask 6: 0 / 12
• Subtask 7: 0 / 12
• Subtask 8: 0 / 12
• Subtask 9: 0 / 12
• Subtask 10: 0 / 12