Submission #1059830

#TimeUsernameProblemLanguageResultExecution timeMemory
1059830PiokemonLottery (CEOI18_lot)C++17
45 / 100
436 ms16472 KiB
#include <iostream> using namespace std; constexpr int N = 2000; short int odp[N+9][N+9]; int a[N+9]; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n,l,q,pyt; cin >> n >> l; for (int x=1;x<=n;x++) cin >> a[x]; int dist; for (int x=1;x<=n-l;x++){ for (int y=x+1;y<=n-l+1;y++){ dist=0; for (int z=0;z<l;z++)dist+=a[x+z]!=a[y+z]; odp[x][dist]++; odp[y][dist]++; } } for (int x=1;x<=n;x++){ for (int k=1;k<=n;k++)odp[x][k]=odp[x][k]+odp[x][k-1]; } cin >> q; while(q--){ cin >> pyt; for (int x=1;x<=n-l+1;x++) cout << odp[x][pyt] << ' '; 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...