oj.uz

Submission #444384

# Submission time Handle Problem Language Result Execution time Memory
444384 2021-07-13T21:51:19 Z hellowsdf Bali Sculptures (APIO15_sculpture) C++14
100 / 100
 561 ms 964 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
//#pragma GCC optimize("Ofast") //#pragma GCC optimize "unroll-loops" //#pragma GCC target "sse,sse2,sse3,sse4,abm,avx,avx2,fma,mmx,popcnt,tune=native" //#pragma GCC optimize "prefetch-loop-arrays"
using namespace std; using namespace __gnu_pbds;
#define foru(i,a,b) for(int i=(a);i<(b);i++)
#define ford(i,a,b) for(int i=(a);i>=(b);i--)
#define fori(a,b) foru(i,a,b)
#define forj(a,b) foru(j,a,b)
#define fork(a,b) foru(k,a,b)
#define seto(x,i) memset(x,i,sizeof x)
#define pf first
#define ps second
#define pb push_back
#define eb emplace_back
#define em emplace
#define mp make_pair
#define mt make_tuple
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
#define clz __builtin_clz
#define clzll __builtin_clzll
#define ctz __builtin_ctz
#define ctzll __builtin_ctzll
#define P2(x) (1LL<<(x))
#define sz(x) (int)x.size()
#define all(x) begin(x),end(x)
#if __SIZEOF_INT128__
    typedef __int128_t i128; typedef __uint128_t ui128;
#else
    typedef int64_t i128; typedef uint64_t ui128;
#endif
typedef int64_t ll;  typedef uint64_t ull; typedef int8_t byte; typedef long double lld; typedef string str;
typedef pair<int,int> pii; typedef pair<ll,ll> pll; typedef pair<lld,lld> pdd;
template<class T1,class T2> using ordered_map=tree<T1,T2,less<T1>,rb_tree_tag,tree_order_statistics_node_update>; template<class T1> using ordered_set=ordered_map<T1,null_type>;
template<class T> using minpq=std::priority_queue<T,vector<T>,greater<T>>; template<class T> using maxpq=std::priority_queue<T,vector<T>,less<T>>;
template<class T> using minpairingheap=__gnu_pbds::priority_queue<T,greater<T>,pairing_heap_tag>; template<class T>using maxpairingheap=__gnu_pbds::priority_queue<T,less<T>,pairing_heap_tag>;
const int inf=0x3f3f3f3f,MOD=1e9+7; const ll INF=0x3f3f3f3f3f3f3f3f; const lld PI=acos((lld)-1);
const ll SEED=443214^chrono::duration_cast<chrono::nanoseconds>(chrono::high_resolution_clock::now().time_since_epoch()).count();
mt19937 randgen(SEED); int randint(int a, int b){return uniform_int_distribution<int>(a,b)(randgen);} ll randll(ll a, ll b){return uniform_int_distribution<ll>(a,b)(randgen);}
ll gcd(ll a, ll b){return b?gcd(b,a%b):a;}
ll fpow(ll a,ll b){ll ret=1;for(;b;b>>=1){if(b&1) ret=ret*a%MOD;a=a*a%MOD;}return ret;}
template<class T1,class T2>constexpr const auto _min(const T1&x,const T2&y){return x<y?x:y;} template<class T,class...Ts>constexpr auto _min(const T&x,const Ts&...xs){return _min(x,_min(xs...));}
template<class T1,class T2>constexpr const auto _max(const T1&x,const T2&y){return x>y?x:y;} template<class T,class...Ts>constexpr auto _max(const T&x,const Ts&...xs){return _max(x,_max(xs...));}
#define min(...) _min(__VA_ARGS__)
#define max(...) _max(__VA_ARGS__)
template<class T1,class T2>constexpr const bool ckmin(T1&x,const T2&y){return x>y?x=y,1:0;} template<class T,class...Ts>constexpr bool ckmin(T&x,const Ts&...xs){return ckmin(x,_min(xs...));}
template<class T1,class T2>constexpr const bool ckmax(T1&x,const T2&y){return x<y?x=y,1:0;} template<class T,class...Ts>constexpr bool ckmax(T&x,const Ts&...xs){return ckmax(x,_max(xs...));}
struct chash{
    static ll splitmix64(ll x){x+=0x9e3779b97f4a7c15; x=(x^(x>>30))*0xbf58476d1ce4e5b9; x=(x^(x>>27))*0x94d049bb133111eb; return x^(x>>31);}
    template<class T> size_t operator()(const T &x) const{return splitmix64(hash<T>()(x)+SEED);}
    template<class T1,class T2> size_t operator()(const pair<T1,T2>&x)const{return 31*operator()(x.first)+operator()(x.second);}};
void fileIn(string s){freopen(s.c_str(),"r",stdin);} void fileOut(string s){freopen(s.c_str(),"w",stdout);} void fileIO(string s){fileIn(s+".in"); fileOut(s+".out");}
string to_string(char c){return string(1,c);} string to_string(char* s){return (string)s;} string to_string(string s){return s;}
template<class T> string to_string(complex<T> c){stringstream ss; ss<<c; return ss.str();} template<class T1,class T2> string to_string(pair<T1,T2> p){return "("+to_string(p.pf)+","+to_string(p.ps)+")";}
template<size_t SZ> string to_string(bitset<SZ> b){string ret=""; fori(0,SZ) ret+=char('0'+b[i]); return ret;}
template<class T> string to_string(T v){string ret="{"; for(const auto& x:v) ret+=to_string(x)+","; return ret+"}";}
void DBG(){cerr<<"]"<<endl;} template<class T,class... Ts> void DBG(T x,Ts... xs){cerr<<to_string(x); if(sizeof...(xs)) cerr<<", "; DBG(xs...);}
#ifdef LOCAL_PROJECT
    #define dbg(...) cerr<<"Line("<< __LINE__<<") -> ["<<#__VA_ARGS__<<"]: [", DBG(__VA_ARGS__)
#else
    #define dbg(...) 0
#endif
#define nl "\n"

const int N=2010,M=MOD,L=40;
ll n,A,B,y[N],ans;

bool go(ll X){
    ll sum[N],num[N]; seto(sum,0); seto(num,0);
    fori(1,n+1){
        sum[i]=sum[i-1]+y[i]; num[i]=inf;
        forj(0,i) if((sum[i]-sum[j]|X)==X) ckmin(num[i],num[j]+1);
    }
    return num[n]<=B;
}
bool go2(ll X){
    ll sum[N];
    bitset<N> num[N]; seto(sum,0); num[0][0]=1;
    fori(1,n+1){
        sum[i]=sum[i-1]+y[i];
        forj(0,i) if((sum[i]-sum[j]|X)==X) num[i]|=num[j]<<1;
    }
    fori(A,B+1) if(num[n][i]) return 1;
    return 0;
}

int main(){
    cin.tie(0)->sync_with_stdio(0);
    cin>>n>>A>>B;
    fori(1,n+1) cin>>y[i];
    ford(i,L,0) if(!go2(ans+P2(i)-1)) ans+=P2(i);
    cout<<ans;
    return 0;
}

Compilation message

sculpture.cpp: In function 'bool go(ll)':
sculpture.cpp:74:29: warning: suggest parentheses around arithmetic in operand of '|' [-Wparentheses]
   74 |         forj(0,i) if((sum[i]-sum[j]|X)==X) ckmin(num[i],num[j]+1);
      |                       ~~~~~~^~~~~~~
sculpture.cpp: In function 'bool go2(ll)':
sculpture.cpp:83:29: warning: suggest parentheses around arithmetic in operand of '|' [-Wparentheses]
   83 |         forj(0,i) if((sum[i]-sum[j]|X)==X) num[i]|=num[j]<<1;
      |                       ~~~~~~^~~~~~~
sculpture.cpp: In function 'void fileIn(std::string)':
sculpture.cpp:54:30: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   54 | void fileIn(string s){freopen(s.c_str(),"r",stdin);} void fileOut(string s){freopen(s.c_str(),"w",stdout);} void fileIO(string s){fileIn(s+".in"); fileOut(s+".out");}
      |                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
sculpture.cpp: In function 'void fileOut(std::string)':
sculpture.cpp:54:84: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   54 | void fileIn(string s){freopen(s.c_str(),"r",stdin);} void fileOut(string s){freopen(s.c_str(),"w",stdout);} void fileIO(string s){fileIn(s+".in"); fileOut(s+".out");}
      |                                                                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 716 KB Output is correct
2 Correct 2 ms 716 KB Output is correct
3 Correct 2 ms 716 KB Output is correct
4 Correct 2 ms 716 KB Output is correct
5 Correct 2 ms 716 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 2 ms 716 KB Output is correct
8 Correct 2 ms 716 KB Output is correct
9 Correct 2 ms 840 KB Output is correct
10 Correct 2 ms 716 KB Output is correct
11 Correct 2 ms 716 KB Output is correct
12 Correct 2 ms 716 KB Output is correct
13 Correct 2 ms 716 KB Output is correct
14 Correct 2 ms 716 KB Output is correct
15 Correct 2 ms 828 KB Output is correct
16 Correct 2 ms 716 KB Output is correct
17 Correct 2 ms 716 KB Output is correct
18 Correct 2 ms 844 KB Output is correct
19 Correct 2 ms 716 KB Output is correct
20 Correct 2 ms 716 KB Output is correct
21 Correct 2 ms 716 KB Output is correct
22 Correct 2 ms 716 KB Output is correct
23 Correct 2 ms 716 KB Output is correct
24 Correct 2 ms 716 KB Output is correct
25 Correct 2 ms 716 KB Output is correct
26 Correct 2 ms 716 KB Output is correct
27 Correct 1 ms 716 KB Output is correct
28 Correct 2 ms 716 KB Output is correct
29 Correct 2 ms 716 KB Output is correct
30 Correct 2 ms 716 KB Output is correct
31 Correct 2 ms 716 KB Output is correct
32 Correct 2 ms 832 KB Output is correct
33 Correct 2 ms 716 KB Output is correct
34 Correct 2 ms 716 KB Output is correct
35 Correct 2 ms 716 KB Output is correct
36 Correct 2 ms 716 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 716 KB Output is correct
2 Correct 2 ms 716 KB Output is correct
3 Correct 1 ms 832 KB Output is correct
4 Correct 2 ms 716 KB Output is correct
5 Correct 2 ms 716 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 2 ms 716 KB Output is correct
8 Correct 2 ms 716 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 2 ms 716 KB Output is correct
11 Correct 3 ms 716 KB Output is correct
12 Correct 3 ms 828 KB Output is correct
13 Correct 2 ms 716 KB Output is correct
14 Correct 2 ms 716 KB Output is correct
15 Correct 2 ms 716 KB Output is correct
16 Correct 2 ms 716 KB Output is correct
17 Correct 2 ms 716 KB Output is correct
18 Correct 2 ms 716 KB Output is correct
19 Correct 2 ms 716 KB Output is correct
20 Correct 2 ms 716 KB Output is correct
21 Correct 2 ms 716 KB Output is correct
22 Correct 2 ms 716 KB Output is correct
23 Correct 2 ms 716 KB Output is correct
24 Correct 2 ms 716 KB Output is correct
25 Correct 3 ms 716 KB Output is correct
26 Correct 2 ms 716 KB Output is correct
27 Correct 2 ms 716 KB Output is correct
28 Correct 2 ms 716 KB Output is correct
29 Correct 3 ms 716 KB Output is correct
30 Correct 4 ms 716 KB Output is correct
31 Correct 5 ms 716 KB Output is correct
32 Correct 5 ms 832 KB Output is correct
33 Correct 5 ms 836 KB Output is correct
34 Correct 5 ms 716 KB Output is correct
35 Correct 5 ms 716 KB Output is correct
36 Correct 5 ms 716 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 716 KB Output is correct
2 Correct 2 ms 832 KB Output is correct
3 Correct 2 ms 716 KB Output is correct
4 Correct 2 ms 716 KB Output is correct
5 Correct 2 ms 716 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 2 ms 716 KB Output is correct
8 Correct 2 ms 716 KB Output is correct
9 Correct 3 ms 844 KB Output is correct
10 Correct 2 ms 716 KB Output is correct
11 Correct 2 ms 716 KB Output is correct
12 Correct 2 ms 832 KB Output is correct
13 Correct 2 ms 828 KB Output is correct
14 Correct 2 ms 716 KB Output is correct
15 Correct 2 ms 716 KB Output is correct
16 Correct 3 ms 716 KB Output is correct
17 Correct 4 ms 716 KB Output is correct
18 Correct 5 ms 836 KB Output is correct
19 Correct 5 ms 836 KB Output is correct
20 Correct 5 ms 716 KB Output is correct
21 Correct 5 ms 844 KB Output is correct
22 Correct 5 ms 716 KB Output is correct
23 Correct 5 ms 832 KB Output is correct
24 Correct 5 ms 716 KB Output is correct
25 Correct 7 ms 716 KB Output is correct
26 Correct 10 ms 832 KB Output is correct
27 Correct 11 ms 716 KB Output is correct
28 Correct 13 ms 716 KB Output is correct
29 Correct 13 ms 832 KB Output is correct
30 Correct 14 ms 716 KB Output is correct
31 Correct 13 ms 840 KB Output is correct
32 Correct 13 ms 832 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 716 KB Output is correct
2 Correct 2 ms 716 KB Output is correct
3 Correct 1 ms 716 KB Output is correct
4 Correct 2 ms 832 KB Output is correct
5 Correct 2 ms 828 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 2 ms 716 KB Output is correct
8 Correct 2 ms 716 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 2 ms 716 KB Output is correct
11 Correct 2 ms 716 KB Output is correct
12 Correct 2 ms 716 KB Output is correct
13 Correct 2 ms 716 KB Output is correct
14 Correct 2 ms 716 KB Output is correct
15 Correct 2 ms 716 KB Output is correct
16 Correct 2 ms 716 KB Output is correct
17 Correct 2 ms 716 KB Output is correct
18 Correct 2 ms 716 KB Output is correct
19 Correct 2 ms 716 KB Output is correct
20 Correct 2 ms 716 KB Output is correct
21 Correct 2 ms 716 KB Output is correct
22 Correct 2 ms 832 KB Output is correct
23 Correct 2 ms 716 KB Output is correct
24 Correct 2 ms 716 KB Output is correct
25 Correct 2 ms 716 KB Output is correct
26 Correct 2 ms 836 KB Output is correct
27 Correct 2 ms 716 KB Output is correct
28 Correct 2 ms 828 KB Output is correct
29 Correct 2 ms 716 KB Output is correct
30 Correct 2 ms 716 KB Output is correct
31 Correct 2 ms 716 KB Output is correct
32 Correct 2 ms 724 KB Output is correct
33 Correct 2 ms 716 KB Output is correct
34 Correct 2 ms 716 KB Output is correct
35 Correct 2 ms 716 KB Output is correct
36 Correct 2 ms 724 KB Output is correct
37 Correct 2 ms 832 KB Output is correct
38 Correct 2 ms 716 KB Output is correct
39 Correct 3 ms 716 KB Output is correct
40 Correct 4 ms 716 KB Output is correct
41 Correct 5 ms 844 KB Output is correct
42 Correct 6 ms 716 KB Output is correct
43 Correct 5 ms 828 KB Output is correct
44 Correct 5 ms 828 KB Output is correct
45 Correct 5 ms 716 KB Output is correct
46 Correct 5 ms 716 KB Output is correct
47 Correct 5 ms 716 KB Output is correct
48 Correct 7 ms 716 KB Output is correct
49 Correct 9 ms 716 KB Output is correct
50 Correct 11 ms 716 KB Output is correct
51 Correct 13 ms 840 KB Output is correct
52 Correct 13 ms 832 KB Output is correct
53 Correct 14 ms 836 KB Output is correct
54 Correct 13 ms 836 KB Output is correct
55 Correct 13 ms 716 KB Output is correct
56 Correct 2 ms 716 KB Output is correct
57 Correct 4 ms 716 KB Output is correct
58 Correct 4 ms 716 KB Output is correct
59 Correct 4 ms 716 KB Output is correct
60 Correct 4 ms 716 KB Output is correct
61 Correct 6 ms 716 KB Output is correct
62 Correct 6 ms 832 KB Output is correct
63 Correct 6 ms 716 KB Output is correct
64 Correct 13 ms 716 KB Output is correct
65 Correct 2 ms 716 KB Output is correct
66 Correct 3 ms 716 KB Output is correct
67 Correct 3 ms 716 KB Output is correct
68 Correct 4 ms 716 KB Output is correct
69 Correct 4 ms 716 KB Output is correct
70 Correct 4 ms 832 KB Output is correct
71 Correct 4 ms 716 KB Output is correct
72 Correct 6 ms 716 KB Output is correct
73 Correct 6 ms 836 KB Output is correct
74 Correct 6 ms 716 KB Output is correct

Subtask #5
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 716 KB Output is correct
2 Correct 2 ms 716 KB Output is correct
3 Correct 2 ms 716 KB Output is correct
4 Correct 2 ms 716 KB Output is correct
5 Correct 2 ms 832 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 2 ms 716 KB Output is correct
8 Correct 2 ms 716 KB Output is correct
9 Correct 2 ms 716 KB Output is correct
10 Correct 2 ms 716 KB Output is correct
11 Correct 2 ms 716 KB Output is correct
12 Correct 2 ms 716 KB Output is correct
13 Correct 2 ms 716 KB Output is correct
14 Correct 2 ms 716 KB Output is correct
15 Correct 2 ms 832 KB Output is correct
16 Correct 2 ms 832 KB Output is correct
17 Correct 2 ms 716 KB Output is correct
18 Correct 2 ms 716 KB Output is correct
19 Correct 2 ms 716 KB Output is correct
20 Correct 2 ms 716 KB Output is correct
21 Correct 2 ms 716 KB Output is correct
22 Correct 2 ms 832 KB Output is correct
23 Correct 2 ms 716 KB Output is correct
24 Correct 2 ms 716 KB Output is correct
25 Correct 3 ms 716 KB Output is correct
26 Correct 3 ms 716 KB Output is correct
27 Correct 4 ms 716 KB Output is correct
28 Correct 5 ms 716 KB Output is correct
29 Correct 5 ms 716 KB Output is correct
30 Correct 5 ms 716 KB Output is correct
31 Correct 5 ms 716 KB Output is correct
32 Correct 5 ms 716 KB Output is correct
33 Correct 5 ms 716 KB Output is correct
34 Correct 5 ms 716 KB Output is correct
35 Correct 7 ms 716 KB Output is correct
36 Correct 9 ms 836 KB Output is correct
37 Correct 13 ms 844 KB Output is correct
38 Correct 14 ms 836 KB Output is correct
39 Correct 13 ms 836 KB Output is correct
40 Correct 14 ms 836 KB Output is correct
41 Correct 13 ms 716 KB Output is correct
42 Correct 13 ms 832 KB Output is correct
43 Correct 3 ms 716 KB Output is correct
44 Correct 4 ms 716 KB Output is correct
45 Correct 5 ms 716 KB Output is correct
46 Correct 4 ms 716 KB Output is correct
47 Correct 4 ms 716 KB Output is correct
48 Correct 4 ms 716 KB Output is correct
49 Correct 6 ms 716 KB Output is correct
50 Correct 6 ms 716 KB Output is correct
51 Correct 5 ms 716 KB Output is correct
52 Correct 63 ms 716 KB Output is correct
53 Correct 95 ms 844 KB Output is correct
54 Correct 168 ms 844 KB Output is correct
55 Correct 156 ms 844 KB Output is correct
56 Correct 467 ms 856 KB Output is correct
57 Correct 454 ms 848 KB Output is correct
58 Correct 325 ms 844 KB Output is correct
59 Correct 360 ms 852 KB Output is correct
60 Correct 561 ms 964 KB Output is correct
61 Correct 7 ms 716 KB Output is correct
62 Correct 93 ms 840 KB Output is correct
63 Correct 164 ms 844 KB Output is correct
64 Correct 145 ms 844 KB Output is correct
65 Correct 235 ms 840 KB Output is correct
66 Correct 325 ms 848 KB Output is correct
67 Correct 455 ms 844 KB Output is correct
68 Correct 450 ms 844 KB Output is correct
69 Correct 397 ms 844 KB Output is correct