Submission #362196

#TimeUsernameProblemLanguageResultExecution timeMemory
362196sumit_kk10Lottery (CEOI18_lot)C++14
25 / 100
3085 ms620 KiB
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long int
using namespace std;
const int MOD = 1e9 + 7;
const int N = 2e5 + 5;

void solve() {
    int n, k;
    cin >> n >> k;
    int a[n];
    for(int i = 0; i < n; ++i)
        cin >> a[i];
    int q;
    cin >> q;
    while(q--){
        int dis;
        cin >> dis;
        for(int i = 0; i <= n - k; ++i){
            int ans = 0;
            for(int j = 0; j <= n - k; ++j){
                if(i == j)
                    continue;
                int diff = 0;
                for(int e = 0; e < k; ++e)
                    if(a[i + e] != a[j + e])
                        ++diff;
                ans += (diff <= dis);
            }
            cout << ans << " ";
        }
        cout << "\n";
    }
}

int main() {
    fast;
    int t = 1;
    // cin >> t;
    while(t--)
        solve();
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...