Submission #397659

#	Time	Username	Problem	Language	Result	Execution time	Memory
397659		Victor	Lottery (CEOI18_lot)	C++17	45 / 100	107 ms	580 KiB

lot

#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define per(i, a, b) for (int i = b - 1; i >= (a); --i)
#define trav(a, x) for (auto &a : x)

#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define pb push_back

#define umap unordered_map
#define uset unordered_set

typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef long long ll;

const int INF = 1000000007;

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    int n, l, q, mismatch[10001], ans[10001], groups;
    int arr[10001];
    cin >> n >> l;
    groups = n - l + 1;
    assert(n <= 10000);
    rep(i, 0, n) cin >> arr[i];

    cin >> q;
    while (q--) {
        int diff;
        cin >> diff;
        memset(ans, 0, sizeof(ans));
        memset(mismatch, 0, sizeof(mismatch));

        rep(i, 0, l) rep(j, i + 1, groups + i) if (arr[i] != arr[j])++ mismatch[j - i];

        rep(i, 0, groups) {
            rep(j, 1, groups - i) {
                if (mismatch[j] <= diff) {
                    assert(j + i < groups);
                    ++ans[i];
                    ++ans[j + i];
                }
            }

            rep(j, i + 1, groups + i) {
                assert(0<=j-i);
                if (arr[i] != arr[j]) --mismatch[j - i];
            }
            rep(j, i + l + 1, n) {
                assert(i+l<n&&0<=j-i-l);
                if (arr[i + l] != arr[j]) ++mismatch[j - i - l];
            }
        }

        rep(i, 0, groups) cout << ans[i] << ' ';
        cout << endl;
    }
    return 0;
}

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