Submission #602603

#TimeUsernameProblemLanguageResultExecution timeMemory
602603fuad27Bali Sculptures (APIO15_sculpture)C++17
0 / 100
1 ms212 KiB
/* * Created: 2022-07-23 13:06 */ #ifndef LOCAL #pragma GCC optimize("O3,unroll-loops") #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt") #endif #include <bits/stdc++.h> using namespace std; using ll = long long; #define FOR(i,a,b) for(int i=int(a);i<int(b);i++) #define rep(i,b) FOR(i,0,b) #define FORN(i,a,b) for(int i=int(b)-1;i>=a;i--) #define per(i,b) FORN(i,0,b) #define mkp make_pair #define pb push_back #define ep emplace_back #define ff first #define ss second #define bg begin() #define ed end() #define sz(x) (int)x.size() #define all(x) (x).bg,(x).ed #define FIO ios_base::sync_with_stdio(0);\ cin.tie(0); template<class t> using vc=vector<t>;; template<class t> using vvc=vc<vc<t>>; using pii=pair<int,int>; using pll=pair<ll,ll>; using vi= vc<int>; using vll= vc<ll>; #ifdef LOCAL #include "/home/fuad/cp/dbg.h" #else #define dbg(x...) #endif mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); mt19937_64 rngll(chrono::steady_clock::now().time_since_epoch().count()); const long long inf=1e18; void solve() { int n, a, b; cin >> n >> a >> b; ll y[n]; rep(i,n)cin >> y[i]; ll dp[n+1][b+1]; dp[0][0]=0; for(int i = 1;i<=b;i++)dp[0][i]=inf; for(int i = 1;i<=n;i++)dp[i][0]=inf; ll ans=inf; for(int i = 1;i<=b;i++) { for(int j = 1;j<=n;j++) { long long sum=0; dp[j][i]=1e9; for(int k = j-1;k>=0;k--) { sum+=y[k]; if(dp[k][i-1]<0)continue; dp[j][i]=min(dp[j][i], (sum|dp[k][i-1])); } } if(i>=a and i<=b) { ans=min(ans, dp[n][i]); } } cout<<ans<<"\n"; } int main () { FIO; int t=1; // cin >> t; while(t--) solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...