# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
97280 | dalgerok | Lottery (CEOI18_lot) | C++14 | 695 ms | 8304 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.
#include<bits/stdc++.h>
using namespace std;
const int N = 1e4 + 5, M = 1e2 + 5;
int n, m, l, a[N], b[N], c[N], pos[N];
int pref[M][N];
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> n >> l;
for(int i = 1; i <= n; i++){
cin >> a[i];
}
cin >> m;
for(int i = 1; i <= m; i++){
cin >> b[i];
c[i] = b[i];
}
sort(c + 1, c + m + 1);
for(int i = 1; i <= m; i++){
pos[c[i]] = i;
}
pos[n + 1] = m + 1;
for(int i = n; i >= 0; i--){
# | 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... |