# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
259994 | ly20 | Lottery (CEOI18_lot) | C++17 | 1418 ms | 42024 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;
const int MAXN = 10010;
int v[MAXN];
vector <int> in[MAXN];
int dif[MAXN][MAXN];
int main() {
int id = 0;
int n, l;
scanf("%d %d", &n, &l);
for(int i = 0; i < n; i++) {
scanf("%d", &v[i]);
}
for(int i = 0; i + l - 1 < n; i++) {
id++;
for(int j = 0; j < l; j++) {
in[i].push_back(v[i + j]);
}
}
for(int i = 0; i < id; i++) {
//for(int m = 0; m < l; m++) {
/// printf("%d ", in[i][m]);
//}
//printf("\n");
for(int j = 0; j < id; j++) {
if(j == i) continue;
int k = 0;
for(int m = 0; m < l; m++) {
if(in[i][m] != in[j][m]) k++;
}
dif[i][k]++;
}
}
for(int i = 0 ; i < id; i++) {
for(int j = 1; j <= l; j++) {
dif[i][j] += dif[i][j - 1];
}
}
int q;
scanf("%d", &q);
for(int i = 0; i < q; i++) {
int r;
scanf("%d", &r);
for(int i = 0; i < id; i++) {
printf("%d ", dif[i][r]);
}
printf("\n");
}
return 0;
}
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... |