# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
970686 | huutuan | Cookies (JOI23_cookies) | C++14 | 179 ms | 327160 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;
#ifdef sus
const int N=100;
#else
const int N=15e3+10;
#endif
using bs=bitset<N>;
vector<bs> f[N];
int n, m, a[N], b[N], pf[N], c[N], _a[N];
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n;
for (int i=1; i<=n; ++i) cin >> _a[i];
cin >> m;
for (int i=1; i<=m; ++i) cin >> b[i], c[b[i]]=1;
for (int i=1; i<=n; ++i) a[i]=_a[i];
int sum=accumulate(a+1, a+n+1, 0);
sort(a+1, a+n+1, greater<int>());
for (int i=1, j=n; i<=sum; ++i){
pf[i]=pf[i-1]+j;
while (j && a[j]==i) --j;
}
f[0].resize(sum+1);
for (int i=1; i<=sum; ++i){
f[i].resize(sum/i+1);
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |