제출 #99126

#제출 시각아이디문제언어결과실행 시간메모리
99126thiago4532Lottery (CEOI18_lot)C++17
25 / 100
62 ms33792 KiB
#include <bits/stdc++.h> #define int int64_t using namespace std; const int maxn = 1e4 + 10; int v[maxn], n, l; int dist[maxn][maxn]; int ct[maxn], ct2[maxn]; int32_t main() { ios::sync_with_stdio(false), cin.tie(0); cin >> n >> l; for(int i=1;i<=n;i++) cin >> v[i]; for(int i=1;i<=n-l+1;i++){ for(int j=1;j<=n-l+1;j++){ for(int k=0;k<l;k++) dist[i][j] += (v[i+k] != v[j+k]); } } // .for(int i=1;i<=n-l+1;i++) // for(int j=i+1;j<=n-l+1;j++) // cout << i << " " << j << ": " << dist[i][j] << "\n"; int q; cin >> q; while(q--){ int x; cin >> x; for(int i=1;i<=n-l+1;i++){ int resp=0; for(int j=1;j<=n-l+1;j++){ if(i==j) continue; resp += (dist[i][j]<=x); } cout << resp << " \n"[i==n-l+1]; } } 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...