# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
920137 | 2024-02-02T05:52:12 Z | Sir_Ahmed_Imran | Lottery (CEOI18_lot) | C++17 | 365 ms | 65536 KB |
///~~~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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 1268 KB | Output is correct |
2 | Correct | 2 ms | 1624 KB | Output is correct |
3 | Correct | 2 ms | 1368 KB | Output is correct |
4 | Correct | 2 ms | 1368 KB | Output is correct |
5 | Correct | 1 ms | 1368 KB | Output is correct |
6 | Correct | 2 ms | 1624 KB | Output is correct |
7 | Correct | 3 ms | 1624 KB | Output is correct |
8 | Correct | 10 ms | 2392 KB | Output is correct |
9 | Correct | 12 ms | 2392 KB | Output is correct |
10 | Correct | 5 ms | 1880 KB | Output is correct |
11 | Correct | 3 ms | 1624 KB | Output is correct |
12 | Correct | 3 ms | 1880 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 1268 KB | Output is correct |
2 | Correct | 2 ms | 1624 KB | Output is correct |
3 | Correct | 2 ms | 1368 KB | Output is correct |
4 | Correct | 2 ms | 1368 KB | Output is correct |
5 | Correct | 1 ms | 1368 KB | Output is correct |
6 | Correct | 2 ms | 1624 KB | Output is correct |
7 | Correct | 3 ms | 1624 KB | Output is correct |
8 | Correct | 10 ms | 2392 KB | Output is correct |
9 | Correct | 12 ms | 2392 KB | Output is correct |
10 | Correct | 5 ms | 1880 KB | Output is correct |
11 | Correct | 3 ms | 1624 KB | Output is correct |
12 | Correct | 3 ms | 1880 KB | Output is correct |
13 | Runtime error | 305 ms | 65536 KB | Execution killed with signal 9 |
14 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 365 ms | 65536 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 365 ms | 65536 KB | Execution killed with signal 9 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 1268 KB | Output is correct |
2 | Correct | 2 ms | 1624 KB | Output is correct |
3 | Correct | 2 ms | 1368 KB | Output is correct |
4 | Correct | 2 ms | 1368 KB | Output is correct |
5 | Correct | 1 ms | 1368 KB | Output is correct |
6 | Correct | 2 ms | 1624 KB | Output is correct |
7 | Correct | 3 ms | 1624 KB | Output is correct |
8 | Correct | 10 ms | 2392 KB | Output is correct |
9 | Correct | 12 ms | 2392 KB | Output is correct |
10 | Correct | 5 ms | 1880 KB | Output is correct |
11 | Correct | 3 ms | 1624 KB | Output is correct |
12 | Correct | 3 ms | 1880 KB | Output is correct |
13 | Runtime error | 305 ms | 65536 KB | Execution killed with signal 9 |
14 | Halted | 0 ms | 0 KB | - |