Submission #566591

#	Time	Username	Problem	Language	Result	Execution time	Memory
566591		drdilyor	Lottery (CEOI18_lot)	C++17	0 / 100	3 ms	488 KiB

lot

#ifdef ONPC
    //#define _GLIBCXX_DEBUG
    #define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", debug_out(__VA_ARGS__)
#else
    #define debug(...) 42
#endif
#define allit(a) (a).begin(), (a).end()
#define memclr(a) memset(a, 0, sizeof(0))
#define sz(a) ((int) (a).size())

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
using vi = vector<int>;
using vii = vector<pair<int, int>>;
using vvi = vector<vector<int>>;
template<typename T>
using uset = unordered_set<T>;
template<typename K, typename V>
using umap = unordered_map<K, V>;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
namespace pd = __gnu_pbds;
template<typename K>
using ordered_set = pd::tree<
    K,
    pd::null_type,
    less<int>,
    pd::rb_tree_tag,
    pd::tree_order_statistics_node_update>;
using pd::gp_hash_table;
template <typename K>
using fast_set = pd::gp_hash_table<K, pd::null_type>;

void debug_out() {
    cerr << endl;
}
template<typename... Tail>
void debug_out(vector<int> h, Tail... t) {
    cerr << "[";
    for (int i = 0; i < sz(h); i++) {
        if (i != 0) cerr << ", ";
        cerr << h[i];
    }
    cerr << "]";
    debug_out(t...);
}
template<typename P1, typename P2, typename... Tail>
void debug_out(pair<P1, P2> h, Tail... t) {
    cerr << "[" << h.first << ", " << h.second << "]";
    debug_out(t...);
}
template<typename Head, typename... Tail>
void debug_out(Head h, Tail... t) {
    cerr << "[" << h << "]";
    debug_out(t...);
}

const int RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count();
struct chash {
    int operator() (int x) const { return x ^ RANDOM; }
};

const int INF = 1e9+1;
const ll INFL = 1e18+1;
const int N = 1e5;
const int MOD = 1000000007;

int solve();

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    int t = 1;
    //cin >> t;
    while (t-- && cin) {
        if (solve()) break;
        #ifdef ONPC
            cout << "____________________" << endl;
        #endif
    }

    return 0;
}

ll pow(ll n, ll e, ll m) {
    ll res = 1;
    while (e) {
        if (e & 1) {
            res = (res * n) % m;
        }
        n = (n * n) % m;
        e >>= 1;
    }
    return res;
}

int solve() {
    int n, l, q;
    cin >> n >> l;
    vi a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    vi as(n-l+1);
    for (int i = 0;i  < sz(as);i++) as[i] = i;

    sort(allit(as), [&](int i, int j) {
        for (int k = 0; k < l; k++) {
            if (a[i+k] != a[j+k]) {
                return a[i+k] < a[j+k];
            }
        }
        return false;
    });
    vi res(n-l+1);
    for (int i = 0; i <= n-l;) {
        int start = i++;
        while (i++ <= n-l) {
            int bad = 0;
            for (int j = 0; !bad && j < l; j++) {
                bad |= a[as[start]+j] != a[as[i]+j];
            }
            if (bad) break;
        }
        for (int j = start; j < i; j++) {
            res[j] = i - start - 1;
        }
    }
    for (int i : res) cout << i << ' ';
    return 0;
}

Compilation message (stderr)

lot.cpp: In function 'int solve()':
lot.cpp:100:15: warning: unused variable 'q' [-Wunused-variable]
  100 |     int n, l, q;
      |               ^

• Subtask 1: 0 / 25
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20