제출 #566505

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
566505		dxz05	Lottery (CEOI18_lot)	C++14	45 / 100	3036 ms	8404 KiB

lot

//#pragma GCC optimize("Ofast,O2,O3,unroll-loops")
//#pragma GCC target("avx2")

#include <bits/stdc++.h>

using namespace std;

void debug_out() { cerr << endl; }

template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << "[" << H << "]";
    debug_out(T...);
}

#ifdef dddxxz
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

#define SZ(s) ((int)s.size())
#define all(x) (x).begin(), (x).end()
#define lla(x) (x).rbegin(), (x).rend()
#define bpc(x) __builtin_popcount(x)
#define bpcll(x) __builtin_popcountll(x)

clock_t startTime;

double getCurrentTime() {
    return (double) (clock() - startTime) / CLOCKS_PER_SEC;
}

#define MP make_pair

typedef long long ll;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const double eps = 0.000001;
const int MOD = 1e9 + 7;
const int INF = 1000000101;
const long long LLINF = 1223372000000000555;
const int N = 1e6 + 3e2;
const int M = 1248;

void Subtasks_1_3(int n, int l, const vector<int> &a, const vector<int> &q){
    vector<vector<int>> ans(n - l + 1, vector<int>(l + 1, 0));
    for (int i = 0; i < n - l + 1; i++){
        for (int j = i + 1; j < n - l + 1; j++){
            int diff = 0;
            for (int k = 0; k < l; k++) diff += a[i + k] != a[j + k];
            ans[i][diff]++;
            ans[j][diff]++;
        }
    }

    for (int i = 0; i < n - l + 1; i++){
        for (int j = 1; j <= l; j++) ans[i][j] += ans[i][j - 1];
    }

    for (int k : q){
        for (int i = 0; i < n - l + 1; i++) cout << ans[i][k] << ' ';
        cout << endl;
    }

    exit(0);
}

void Subtask_2(int n, int l, const vector<int> &a, const vector<int> &q){
    ll A = 998244353, B = 1e9 + 7;

    map<ll, int> mp;
    ll h = 0, pw = 1;
    for (int i = 0; i < l - 1; i++){
        h = (h * A + a[i]) % B;
        pw = pw * A % B;
    }

    vector<ll> hash(n - l + 1, 0);

    for (int i = 0; i < n - l + 1; i++){
        if (i > 0) h -= a[i - 1] * pw % B;

        h = (h % B + B) % B;
        h = (h * A + a[i + l - 1]) % B;

        mp[h]++;
        hash[i] = h;
    }

    for (int i = 0; i < n - l + 1; i++){
        cout << mp[hash[i]] - 1 << ' ';
    }
    cout << endl;

    exit(0);
}

void solve(int TC) {
    int n, l;
    cin >> n >> l;

    vector<int> a(n);
    for (int &i : a) cin >> i;

    int m;
    cin >> m;

    vector<int> q(m);
    for (int &i : q) cin >> i;

    if (n <= 10000) Subtasks_1_3(n, l, a, q);
    if (m == 1 && q[0] == 0) Subtask_2(n, l, a, q);

}

int main() {
    startTime = clock();
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

#ifdef dddxxz
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif

    int TC = 1;
    //cin >> TC;

    for (int test = 1; test <= TC; test++) {
        //debug(test);
        //cout << "Case #" << test << ": ";
        solve(test);
    }

#ifdef dddxxz
    cerr << endl << "Time: " << int(getCurrentTime() * 1000) << " ms" << endl;
#endif

    return 0;
}

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