# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
920137 | Sir_Ahmed_Imran | Lottery (CEOI18_lot) | C++17 | 365 ms | 65536 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
///~~~LOTA~~~///
#include <bits/stdc++.h>
using namespace std;
#define nl '\n'
#define ff first
#define ss second
#define ll long long
#define append push_back
#define all(x) (x).begin(),(x).end()
#define pii pair<int,int>
#define N 10001
map<int,int> s[N];
map<int,int> x[N];
map<int,vector<int>> a;
void solve(){
int n,m,o,p,q,r;
cin>>n>>m;
for(int i=1;i<=n;i++){
cin>>o;
x[i][0]=n-m;
a[o].append(i);
}
for(auto& i:a){
o=i.ss.size();
for(int j=0;j<o;j++){
for(int k=j+1;k<o;k++){
for(int l=0;l<m;l++){
p=i.ss[j];
q=i.ss[k];
if(p-l<1 || q-l>n-m+1)
continue;
s[p-l][q-l]++;
s[q-l][p-l]++;
x[p-l][s[q-l][p-l]]++;
x[q-l][s[q-l][p-l]]++;
}
}
}
}
cin>>o;
for(int i=0;i<o;i++){
cin>>p;
for(int j=1;j<n-m+2;j++)
cout<<x[j][m-p]<<' ';
cout<<nl;
}
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |