Submission #120246

#TimeUsernameProblemLanguageResultExecution timeMemory
120246raghav0307Lottery (CEOI18_lot)C++14
25 / 100
15 ms2176 KiB
/*raghav0307 - Raghav Gupta*/ #include <bits/stdc++.h> using namespace std; #define ff first #define ss second #define pb push_back #define fast_io() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); typedef long long ll; typedef pair<int, int> pii; typedef long double ld; #define int ll int dp[305][305]; signed main(){ fast_io(); int n, l; cin >> n >> l; int a[n]; for(int i = 0; i < n; i++) cin >> a[i]; int q; cin >> q; for(int i = 0; i < n; i++){ for(int j = 0; j < i; j++){ if(a[i] == a[j]) continue; int cnt = l; int x = i; int y = j; while(x >= 0 and y >= 0 and cnt > 0){ dp[x][y]++; dp[y][x]++; x--; y--; cnt--; } } } while(q--){ int k; cin >> k; for(int i = 0; i < n-l+1; i++){ int cnt = 0; for(int j = 0; j < n-l+1; j++){ if(i == j) continue; if(dp[i][j] <= k) cnt++; } cout << cnt << " "; } 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...