# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1167222 | SmuggingSpun | Lottery (CEOI18_lot) | C++20 | 2 ms | 328 KiB |
#include<bits/stdc++.h>
#define taskname "C"
using namespace std;
int n, len, q;
namespace sub1{
void solve(){
vector<int>a(n + 1);
for(int i = 1; i <= n; i++){
cin >> a[i];
}
vector<vector<int>>cnt(n - len + 2, vector<int>(len + 1, 0));
for(int i = 1; i + len - 1 <= n; i++){
for(int j = i + 1; j + len - 1 <= n; j++){
int s = 0;
for(int k = 0; k < len; k++){
if(a[i + k] != a[j + k]){
s++;
}
}
cnt[i][s]++;
cnt[j][s]++;
}
}
for(int i = 1; i + len - 1 <= n; i++){
for(int j = 1; j <= len; j++){
cnt[i][j] += cnt[i][j - 1];
}
}
cin >> q;
for(int _ = 0; _ < q; _++){
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... |