# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
789080 | moonrabbit2 | Cookies (JOI23_cookies) | C++17 | 413 ms | 55972 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.
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,avx2,fma")
#define fi first
#define se second
#include <bits/stdc++.h>
using namespace std;
using pii=pair<int,int>;
using db=double;
const int N=15005;
int n,a[N],m,b[N];
int k,mx,lim[N],cnt[N];
bitset<N> dp[N],L[N];
int l,c[N];
pii cur[N],ncur[N];
int main(){
ios::sync_with_stdio(false); cin.tie(0);
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
k+=a[i];
mx=max(mx,a[i]);
cnt[a[i]]++;
}
for(int s1=n,s2=0,i=1;i<=k;i++){
s1-=cnt[i];
s2+=cnt[i]*i;
lim[i]=i*s1+s2;
for(int j=0;j<=lim[i];j++) L[i][j]=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... |