Submission #1023889

#TimeUsernameProblemLanguageResultExecution timeMemory
102388912345678Lottery (CEOI18_lot)C++17
45 / 100
411 ms9300 KiB
#include <bits/stdc++.h> using namespace std; const int nx=2e3+5; int n, l, q, x, a[nx], dp[nx][nx]; int main() { cin.tie(NULL)->sync_with_stdio(false); cin>>n>>l; for (int i=1; i<=n; i++) cin>>a[i]; for (int i=1; i+l-1<=n; i++) { for (int j=i+1; j+l-1<=n; j++) { int cnt=0; for (int k=0; k<l; k++) cnt+=(a[i+k]!=a[j+k]); dp[i][cnt]++, dp[j][cnt]++; } for (int j=1; j<=l; j++) dp[i][j]+=dp[i][j-1]; } cin>>q; while (q--) { cin>>x; for (int i=1; i+l-1<=n; i++) cout<<dp[i][x]<<' '; 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...