Submission #493333

#TimeUsernameProblemLanguageResultExecution timeMemory
493333blueLottery (CEOI18_lot)C++17
45 / 100
852 ms65540 KiB
#include <iostream> #include <vector> #include <algorithm> using namespace std; using vi = vector<int>; int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); int n, l; cin >> n >> l; int a[1+n]; for(int i = 1; i <= n; i++) cin >> a[i]; vi nums[1+n]; for(int x = 1; x <= n-l+1; x++) { for(int y = 1; y <= n-l+1; y++) { if(x == y) continue; int ct = 0; for(int i = 0; i < l; i++) ct += a[x+i] != a[y+i]; nums[x].push_back(ct); } sort(nums[x].begin(), nums[x].end()); } int q; cin >> q; for(int j = 1; j <= q; j++) { int k; cin >> k; for(int i = 1; i <= n-l+1; i++) { int c = 0; for(int v: nums[i]) c += (v <= k); cout << c << ' '; } cout << '\n'; } }
#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...