# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
629764 | 2022-08-15T05:19:23 Z | aebov | Bali Sculptures (APIO15_sculpture) | C++17 | 0 ms | 212 KB |
#include<iostream> #include<algorithm> #include<bitset> #include<vector> #define pb push_back using namespace std; long long int n,a,b,y[21]; long long int inf = (long long)1e17+17; long long int ans=inf; long long int f(int x) { if(__builtin_popcount(x)<a-1 || __builtin_popcount(x)>b-1)return inf; vector<int> pos; for(int i=0;i<b;i++)if((x>>i)%2==1)pos.pb(i); pos.pb(n-1); long long int ret=0LL; long long int tm2=0LL; for(int i=0;i<=pos[0];i++)tm2+=y[i]; //cout<<tm2<<endl; ret|=tm2; for(int i=1;i<pos.size();i++){ tm2=0LL; for(int j=pos[i-1]+1;j<=pos[i];j++)tm2+=y[j]; ret|=tm2; //cout<<tm2<<endl; } bitset<5> tb = x; //cout<<tb<< " "<<ret<<endl; return ret; } int main() { ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); cin>>n>>a>>b; for(int i=0;i<n;i++)cin>>y[i]; for(int i=0;i<(1<<b);i++){ ans=min(ans,f(i)); } cout<<ans<<endl; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 0 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 0 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 0 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 0 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Incorrect | 0 ms | 212 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |