# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
217521 | DystoriaX | Lottery (CEOI18_lot) | C++14 | 1334 ms | 8440 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.
#include <bits/stdc++.h>
using namespace std;
int n, l;
int a[10010], b[10010];
int cnt[110][10010];
int q, qr[110];
vector<int> cmp;
int main(){
scanf("%d%d", &n, &l);
for(int i = 1; i <= n; i++) scanf("%d", &a[i]), b[i] = a[i];
scanf("%d", &q);
for(int i = 1; i <= q; i++){
scanf("%d", &qr[i]);
cmp.emplace_back(qr[i]);
}
sort(cmp.begin(), cmp.end());
for(int d = 1; d < n - l + 1; d++){
int diff = 0;
for(int j = 1; j <= l; j++){
if(a[j] != a[j + d]) diff++;
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... |