답안 #552718

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
552718	2022-04-23T16:56:50 Z	urosk	Bali Sculptures (APIO15_sculpture)	C++14	50 / 100	280 ms	468 KB

sculpture

//https://oj.uz/problem/view/APIO15_sculpture
// __builtin_popcount(x) broj bitova
// __builtin_popcountll(x)
// __builtin_clz(x) vodece nule
// __builtin_clzll(x)
// __builtin_ctz(x) nule na pocetku
// __builtin_ctzll(x)
// 2000000011
// 2000000033
#include "bits/stdc++.h"
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define ld double
#define ll long long
#define ull unsigned long long
#define llinf 100000000000000000LL // 10^17
#define iinf 2000000000 // 2*10^9
#define pb push_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define sz(a) ((ll)(a.size()))
#define all(a) a.begin(),a.end()
#define rall(a) a.begin(),a.end(),greater<int>()
#define getunique(v) {sort(all(v)); v.erase(unique(all(v)), v.end());}
#define pi 3.14159265358979323846
#define here cerr<<"=============================================================================\n"
#define ceri(a,l,r) {for(ll i_ = l;i_<=r;i_++) cerr<<a[i_]<< " ";cerr<<endl;}
#define ceri2(a,l,r,n,m) {for(ll i = l;i<=r;i++){for(ll j = n;j<=m;j++) cerr<<a[i][j]<< " ";cerr<<endl;}}
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
#define daj_mi_malo_vremena ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);
using namespace std;
using namespace __gnu_pbds;

template<typename T> using vc = vector<T>;
template<typename T> using vvc = vc<vc<T>>;
typedef tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef tree<ll,null_type,less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_multiset;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll rnd(ll l,ll r){
    return uniform_int_distribution<ll>(l,r)(rng);
}

void setIO(string inoutname)
{
	freopen((inoutname+".in").c_str(),"r",stdin);
    	freopen((inoutname+".out").c_str(),"w",stdout);
}
#define mod 1
ll gcd(ll a, ll b)
{
   if(b==0) return a;
   if(a==0) return b;
   if(a>=b)  return gcd(a%b,b);
   return  gcd(a,b%a);
}
ll lcm(ll a,ll b){
   return (a/gcd(a,b))*b;
}
ll add(ll x,ll y){
    x+=y;
    if(x<0){
        x%=mod;
        x+=mod;
	if(x==mod) x = 0;
    }else{
        if(x>=mod) x%=mod;
    }
    return x;
}
ll mul(ll a,ll b){
	ll ans = (a*b)%mod;
	if(ans<0) ans+=mod;
	return ans;
}
ll po(ll x,ll y){
    if(y==0) return 1LL;
    ll ans = po(x,y/2);
    ans = mul(ans,ans);
    if(y&1) ans = mul(ans,x);
    return ans;
}
ll inv(ll x){return po(x,mod-2);}
#define maxn 2005
#define lg 64
ll n,la,lb;
ll a[maxn];
ll p[maxn];
ll dp2[maxn];
bool dp[maxn][maxn];
bool moe(ll x){
    if(la==1){
        fill(dp2,dp2+maxn,llinf);
        dp2[0] = 0;
        for(ll i = 1;i<=n;i++){
            for(ll j = i-1;j>=0;j--){
                ll sum = p[i]-p[j];
                if((sum|x)==x) dp2[i] = min(dp2[i],dp2[j]+1);
            }
        }
        return dp2[n]<=lb;
    }
    for(ll i = 1;i<=n;i++) fill(dp[i],dp[i]+maxn,0);
    for(ll i = 0;i<=n;i++) dp[0][i] = 1;
    for(ll i = 1;i<=n;i++){
        for(ll b = 1;b<=lb;b++){
            for(ll j = i-1;j>=0;j--){
                ll sum = p[i] - p[j];
                if((sum|x)!=x) continue;
                dp[i][b]|=dp[j][b-1];
            }
        }
    }
    for(ll i = la;i<=lb;i++) if(dp[n][i]) return 1;
    return 0;
}
void tc(){
	daj_mi_malo_vremena
    cin >> n >> la >> lb;
    for(ll i = 1;i<=n;i++) cin >> a[i];
    for(ll i = 1;i<=n;i++) p[i] = p[i-1] + a[i];
    ll ans = (1LL<<lg)-1;
    //cerr<<ans<<endl;
    for(ll j = lg-1;j>=0;j--){
        if(moe(ans-(1LL<<j))) ans -= (1LL<<j);
    }
    cout<<ans<<endl;
}
int main(){
	daj_mi_malo_vremena
	//setIO("lol");
	int t; t = 1;
	while(t--){
		tc();
	}
	return 0;
}
/*
6 1 3
8 1 2 1 5 4
*/

Compilation message

sculpture.cpp: In function 'void tc()':
sculpture.cpp:127:18: warning: left shift count >= width of type [-Wshift-count-overflow]
  127 |     ll ans = (1LL<<lg)-1;
      |                  ^
sculpture.cpp: In function 'void setIO(std::string)':
sculpture.cpp:51:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |  freopen((inoutname+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sculpture.cpp:52:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   52 |      freopen((inoutname+".out").c_str(),"w",stdout);
      |      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	332 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	328 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Incorrect	1 ms	340 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #2

0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	324 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	296 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	332 KB	Output is correct
10	Correct	1 ms	336 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	1 ms	328 KB	Output is correct
15	Incorrect	1 ms	340 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #3

21.0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	328 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	332 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	332 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	332 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	340 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	2 ms	332 KB	Output is correct
29	Correct	3 ms	340 KB	Output is correct
30	Correct	2 ms	340 KB	Output is correct
31	Correct	2 ms	340 KB	Output is correct
32	Correct	2 ms	332 KB	Output is correct

Subtask #4

0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	336 KB	Output is correct
5	Correct	1 ms	332 KB	Output is correct
6	Correct	1 ms	328 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	328 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	340 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Incorrect	1 ms	340 KB	Output isn't correct
16	Halted	0 ms	0 KB	-

Subtask #5

29.0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	324 KB	Output is correct
3	Correct	1 ms	328 KB	Output is correct
4	Correct	1 ms	328 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	1 ms	336 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	1 ms	340 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	340 KB	Output is correct
21	Correct	1 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	468 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	1 ms	340 KB	Output is correct
32	Correct	1 ms	332 KB	Output is correct
33	Correct	1 ms	328 KB	Output is correct
34	Correct	1 ms	340 KB	Output is correct
35	Correct	2 ms	340 KB	Output is correct
36	Correct	1 ms	340 KB	Output is correct
37	Correct	2 ms	340 KB	Output is correct
38	Correct	2 ms	352 KB	Output is correct
39	Correct	2 ms	340 KB	Output is correct
40	Correct	2 ms	340 KB	Output is correct
41	Correct	2 ms	340 KB	Output is correct
42	Correct	2 ms	340 KB	Output is correct
43	Correct	1 ms	340 KB	Output is correct
44	Correct	1 ms	340 KB	Output is correct
45	Correct	1 ms	340 KB	Output is correct
46	Correct	1 ms	332 KB	Output is correct
47	Correct	1 ms	340 KB	Output is correct
48	Correct	2 ms	328 KB	Output is correct
49	Correct	2 ms	340 KB	Output is correct
50	Correct	1 ms	340 KB	Output is correct
51	Correct	2 ms	340 KB	Output is correct
52	Correct	26 ms	340 KB	Output is correct
53	Correct	42 ms	340 KB	Output is correct
54	Correct	68 ms	460 KB	Output is correct
55	Correct	66 ms	364 KB	Output is correct
56	Correct	265 ms	380 KB	Output is correct
57	Correct	278 ms	460 KB	Output is correct
58	Correct	260 ms	380 KB	Output is correct
59	Correct	280 ms	384 KB	Output is correct
60	Correct	262 ms	392 KB	Output is correct
61	Correct	2 ms	340 KB	Output is correct
62	Correct	39 ms	340 KB	Output is correct
63	Correct	87 ms	368 KB	Output is correct
64	Correct	78 ms	340 KB	Output is correct
65	Correct	137 ms	340 KB	Output is correct
66	Correct	237 ms	380 KB	Output is correct
67	Correct	272 ms	376 KB	Output is correct
68	Correct	267 ms	380 KB	Output is correct
69	Correct	274 ms	380 KB	Output is correct