Submission #242535

#	Time	Username	Problem	Language	Result	Execution time	Memory
242535		kartel	Tavan (COCI16_tavan)	C++14	0 / 80	23 ms	31744 KiB

tavan

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +1000500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e9)
#define el '\n'
#define pii pair <int, int>
#define err ld(1e-9)
#define last(x) x.back()
#define all(x) (x).begin(), (x).end()
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

ll x, p, i, j, n, m, k;
string s, t[N];
vector <ll> vc;

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("D:/cpp/2/output.txt");
//    out("output.txt");

    cin >> n >> m >> k >> x;
    cin >> s;

    for (i = 1; i <= m; i++)
    {
        cin >> t[i];
        sort(all(t[i]));
    }

    for (i = 0; i < n; i++)
        if (s[i] == '#')
            vc.pb(i);

    for (i = 0; i < m; i++)
    {
        j = m - 1; p = k;

        while (j >= 0 && p <= x) j--, p *= k;

        if (j > i) {s[vc[i]] = t[i + 1][0]; continue;}
        p /= k;

        j = 1;
        while (j * p <= x) j++;

        x -= j * p;

        s[vc[i]] = t[i + 1][j - 1];
    }

    cout << s;
}

//
//00000
//00110
//00111
//00011
//00000

• Subtask 1: 0 / 80