Submission #1214132

#	Time	Username	Problem	Language	Result	Execution time	Memory
1214132		otarius	Lottery (CEOI18_lot)	C++20	0 / 100	71 ms	324 KiB

lot

#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace __gnu_pbds;
using namespace std;

// #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#define ff first
#define sc second
#define pb push_back
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define ull unsigned long long
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rngl(chrono::steady_clock::now().time_since_epoch().count());

// #define int long long
// #define int unsigned long long

// #define ordered_set(T) tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>
// #define ordered_multiset(T) tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>

// const ll mod = 1e9 + 7;
// const ll mod = 998244353;

const ll inf = 1e9;
const ll biginf = 1e18;
const int maxN = 5005;

void solve() {
    int n, l;
    cin >> n >> l;
    int arr[n + 1];
    for (int i = 1; i <= n; i++)
        cin >> arr[i];
    int cnt[n + 1] = {}, diff;
    for (int i = 1; i + l - 1 <= n; i++) {
        diff = 0;
        for (int j = i; j <= i + l - 1; j++)
            diff += (arr[j - i + 1] != arr[j]);
        cnt[i] += !diff;
        int j = 1, k = i;
        while (k + l <= n) {
            diff -= (arr[j] == arr[k]);
            diff += (arr[j + l] == arr[k + l]);
            cnt[j + 1] += !diff;

            j++; k++;
        }
    }

    // for (int i = 1; i <= l; i++) cnt[i] += cnt[i - 1];

    int q; cin >> q;
    while (q--) {
        for (int i = 1; i <= n - l + 1; i++) cout << cnt[i] << ' ';
    }
}
int32_t main() { 
// #ifndef ONLINE_JUDGE
//     freopen("input.txt", "r", stdin);
//     freopen("output.txt", "w", stdout);
// #endif
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
        cout << '\n';
    }
    return 0;
}

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