oj.uz

Submission #200658

# Submission time Handle Problem Language Result Execution time Memory
200658 2020-02-07T23:50:38 Z zaneyu Bali Sculptures (APIO15_sculpture) C++14
0 / 100
 10 ms 8312 KB 
/*input
6 1 3
8 1 2 1 5 4
*/
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
using ll = long long;
using ld = long double;
using pii = pair<int,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
ll sub(ll a,ll b){
    ll x=a-b;
    while(x<0) x+=MOD;
    while(x>MOD) x-=MOD;
    return x;
}
ll mult(ll a,ll b){
    return a*b%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=(res*a)%MOD;
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
const int maxn=1e3+5;
ll dp[maxn][maxn];
ll pref[maxn];
int arr[maxn];
int n,a,b;
void solve1(){
	REP(i,maxn) REP(j,maxn) dp[i][j]=INF64;
	dp[0][1]=0;
	for(int i=1;i<=n;i++){
		dp[i][1]=pref[i];
		for(int j=2;j<=i;j++){
			dp[i][j]=INF64;
			REP(k,i){
				MNTO(dp[i][j],dp[k][j-1]|(pref[i]-pref[k]));
			}
			//cout<<dp[i][j]<<' ';
		}
		//cout<<'\n';
	}
	ll ans=INF64;
	for(int i=a;i<=b;i++){
		MNTO(ans,dp[n][i]);
	}
	cout<<ans<<'\n';
}
void solve2(){
	ll dp[maxn];
	dp[1]=0;

}
int main(){

	cin>>n>>a>>b;
	REP1(i,n) cin>>arr[i];
	pref[0]=0;
	REP1(i,n) pref[i]=pref[i-1]+arr[i];
	if(n<=100){

		solve1();
	}
	else{
		solve2();
	}
}

Compilation message

sculpture.cpp: In function 'void solve2()':
sculpture.cpp:79:5: warning: variable 'dp' set but not used [-Wunused-but-set-variable]
  ll dp[maxn];
     ^~

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8184 KB Output is correct
2 Incorrect 9 ms 8312 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8188 KB Output is correct
2 Incorrect 9 ms 8312 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 8184 KB Output is correct
2 Incorrect 9 ms 8184 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8184 KB Output is correct
2 Incorrect 10 ms 8184 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 8184 KB Output is correct
2 Incorrect 9 ms 8184 KB Output isn't correct
3 Halted 0 ms 0 KB -