# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
168946 | 2019-12-17T09:23:34 Z | kostia244 | Lottery (CEOI18_lot) | C++17 | 3 ms | 1148 KB |
#include<bits/stdc++.h> #define all(x) x.begin(), x.end() #define pb push_back using namespace std; using ll = long long; // using vi vector<int>; const int maxn = 2222; int n, l, q, x; short a[maxn], mat[maxn][maxn], cnt[maxn][maxn]; int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n >> l; for(int i = 1; i <= n; i++) cin >> a[i]; for(int i = 1; i <= n; i++) for(int j = i+1; j <= n; j++) { if(a[i]==a[j]) continue; int diff = j-i; int L = max(j-l+1, 1+diff); int R = min(j, n-l+1); // cout << i << " " << j << " : " << L << " " << R << "\n"; ++mat[diff][L]; --mat[diff][R+1]; } for(int i = 1; i < n; i++) { ll cur = 0; for(int j = i+1; j <= n-l+1; j++) { cur += mat[i][j]; // cout << j << " " << j-i << " " << cur << "\n"; ++cnt[j][cur]; ++cnt[j-i][cur]; } } for(int i = 1; i <= n-l+1; i++) { for(int j = 1; j <= l; j++) { cnt[i][j] += cnt[i][j-1]; } } cin >> q; while(q--) { cin >> x; for(int i = 1; i <= n-l+1; i++) cout << cnt[i][x] << " ";cout << "\n"; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 3 ms | 1016 KB | Output is correct |
3 | Correct | 3 ms | 1148 KB | Output is correct |
4 | Correct | 3 ms | 1016 KB | Output is correct |
5 | Incorrect | 2 ms | 888 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 3 ms | 1016 KB | Output is correct |
3 | Correct | 3 ms | 1148 KB | Output is correct |
4 | Correct | 3 ms | 1016 KB | Output is correct |
5 | Incorrect | 2 ms | 888 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 3 ms | 1016 KB | Output is correct |
3 | Correct | 3 ms | 1148 KB | Output is correct |
4 | Correct | 3 ms | 1016 KB | Output is correct |
5 | Incorrect | 2 ms | 888 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |