# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
104954 | eriksuenderhauf | Lottery (CEOI18_lot) | C++11 | 1034 ms | 8284 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define pii pair<int, int>
#define mp make_pair
#define se second
using namespace std;
const int MAXN = 1e4 + 5;
int a[MAXN], cnt[MAXN];
pii qry[101];
int ans[101][MAXN];
int ind[101];
int main()
{
int n, l, q, k;
scanf("%d %d", &n, &l);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
scanf("%d", &q);
for (int i = 0; i < q; i++) {
scanf("%d", &k);
qry[i] = {k, i};
}
sort(qry, qry + q);
for (int j = 1; j < n - l + 1; j++) {
int diff = 0;
for (int m = 0; m < l; m++)
diff += a[m] != a[j + m];
int st = lower_bound(qry, qry + q, mp(diff, 0)) - qry;
ans[st][0]++, ans[st][j]++;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |