Submission #571899

#TimeUsernameProblemLanguageResultExecution timeMemory
571899piOOELottery (CEOI18_lot)C++17
25 / 100
3069 ms520 KiB
#include <bits/stdc++.h> using namespace std; #define sz(x) ((int)size(x)) #define all(x) begin(x), end(x) #define trace(x) cout << #x << ": " << (x) << endl; typedef long long ll; mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count()); int rand(int l, int r) { return (int) ((ll) rnd() % (r - l + 1)) + l; } const int N = 10000; const ll infL = 3e18; int a[N]; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n, l; cin >> n >> l; for (int i = 0; i < n; ++i) { cin >> a[i]; } int q; cin >> q; while (q--) { int k; cin >> k; for (int i = 0; i <= n - l; ++i) { int ans = 0; for (int j = 0; j <= n - l; ++j) { if (i == j) continue; int cnt = 0; for (int id = 0; id < l; ++id) { cnt += (a[i + id] != a[j + id]); } if (cnt <= k) { ++ans; } } cout << ans << ' '; } cout << '\n'; } 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...