# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
70888 | georgerapeanu | Lottery (CEOI18_lot) | C++11 | 2199 ms | 8748 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 <iostream>
#include <algorithm>
using namespace std;
int n,l,q;
int v[10005];
pair<int,int> queries[105];
int dp[2][10005];
int inverseeeee[105];
int ans[105][10005];
int brut(int i,int j){
int ans = 0;
for(int k = 0;k < l;k++){
ans += (v[i + k] != v[j + k]);
}
return ans;
}
int main() {
cin >> n >> l;
for(int i = 1;i <= n;i++){
cin >> v[i];
}
cin >> q;
for(int i = 1;i <= q;i++){
# | 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... |