Submission #482503

#TimeUsernameProblemLanguageResultExecution timeMemory
482503ArianKheirandishLottery (CEOI18_lot)C++17
45 / 100
435 ms16104 KiB
// in the name of God// #include<bits/stdc++.h> using namespace std; typedef long long ll; const int maxn = 2e3 + 20; int n, q, ln, ans, a[maxn], dp[maxn][maxn]; void solve(int u, int v){ int res(0); for(int i = 0 ; i < ln ; i ++) if(a[u + i] ^ a[v + i]) res = res + 1; dp[u][v] = dp[v][u] = res; } int main(){ ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0); cin >> n >> ln; for(int i = 0 ; i < n ; i ++) cin >> a[i]; for(int i = 0 ; i <= n - ln ; i ++) for(int j = i + 1 ; j <= n - ln ; j ++) solve(i, j); cin >> q; while(q --){ int df; cin >> df; for(int i = 0 ; i <= n - ln ; i ++){ ans = 0; for(int j = 0 ; j <= n - ln ; j ++) if(dp[i][j] <= df) ans = ans + 1; cout << ans - 1 << '\n'; } cout << '\n'; } return 0; } /* Hasbi Allah */
#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...