Submission #1294320

#	Time	Username	Problem	Language	Result	Execution time	Memory
1294320		icebear	Lottery (CEOI18_lot)	C++20	100 / 100	225 ms	8356 KiB

lot

// ~~ icebear ~~
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;

template<class T>
    bool minimize(T &a, const T &b) {
        if (a > b) return a = b, true;
        return false;
    }
    
template<class T>
    bool maximize(T &a, const T &b) {
        if (a < b) return a = b, true;
        return false;
    }
    
#define FOR(i,a,b) for(int i=(a); i<=(b); ++i)
#define FORR(i,a,b) for(int i=(a); i>=(b); --i)
#define REP(i, n) for(int i=0; i<(n); ++i)
#define RED(i, n) for(int i=(n)-1; i>=0; --i)
#define MASK(i) (1LL << (i))
#define BIT(S, i) (((S) >> (i)) & 1)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define task "icebear"

const int MOD = 1e9 + 7;
const int inf = 1e9 + 27092008;
const ll INF = 1e18 + 27092008;
const int N = 10000 + 5;
int n, l, q, a[N], ans[N][105], k[N], tmp[N], nxt[N];

void init(void) {
    cin >> n >> l;
    FOR(i, 1, n) cin >> a[i];
    cin >> q;
    FOR(i, 1, q) cin >> k[i], tmp[i] = k[i];
}

void process(void) {
    sort(tmp + 1, tmp + q + 1);
    int j = 0;
    tmp[q + 1] = l;
    FOR(i, 1, q + 1) {
        while(j <= tmp[i]) {
            nxt[j] = i;
            j++;
        }
    } 

    FOR(i, 2, n - l + 1) {
        int diff = 0;
        REP(j, l) diff += (a[i + j] != a[1 + j]);
        int cur = 1, curi = i;
        while(curi <= n - l + 1) {
            ans[cur][nxt[diff]]++;
            ans[curi][nxt[diff]]++;
            diff += -(a[cur] != a[curi]) + (a[cur + l] != a[curi + l]);
            cur++;
            curi++;
        } 
    }

    FOR(i, 1, n) FOR(j, 1, q) ans[i][j] += ans[i][j - 1];

    FOR(j, 1, q) FOR(i, 1, n - l + 1) cout << ans[i][nxt[k[j]]] << " \n"[i == n - l + 1];
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    if (fopen(task".inp", "r")) {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    int tc = 1;
//     cin >> tc;
    while(tc--) {
        init();
        process();
    }
    return 0;
}

Compilation message (stderr)

lot.cpp: In function 'int main()':
lot.cpp:80:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   80 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
lot.cpp:81:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   81 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

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