oj.uz

Submission #125307

# Submission time Handle Problem Language Result Execution time Memory
125307 2019-07-05T05:20:31 Z kjp4155 Bali Sculptures (APIO15_sculpture) C++17
100 / 100
 716 ms 23416 KB 
#include <bits/stdc++.h>

using namespace std;

#define VA_NUM_ARGS(...) VA_NUM_ARGS_IMPL_((0,__VA_ARGS__, 6,5,4,3,2,1))
#define VA_NUM_ARGS_IMPL_(tuple) VA_NUM_ARGS_IMPL tuple
#define VA_NUM_ARGS_IMPL(_0,_1,_2,_3,_4,_5,_6,N,...) N
#define macro_dispatcher(macro, ...) macro_dispatcher_(macro, VA_NUM_ARGS(__VA_ARGS__))
#define macro_dispatcher_(macro, nargs) macro_dispatcher__(macro, nargs)
#define macro_dispatcher__(macro, nargs) macro_dispatcher___(macro, nargs)
#define macro_dispatcher___(macro, nargs) macro ## nargs
#define Debug1(a)           cout<<#a<<"="<<(a)<<"\n"
#define Debug2(a,b)         cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<"\n"
#define Debug3(a,b,c)       cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<"\n"
#define Debug4(a,b,c,d)     cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<"\n"
#define Debug5(a,b,c,d,e)   cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<", "<<#e<<"="<<(e)<<"\n"
#define Debug6(a,b,c,d,e,f) cout<<#a<<"="<<(a)<<", "<<#b<<"="<<(b)<<", "<<#c<<"="<<(c)<<", "<<#d<<"="<<(d)<<", "<<#e<<"="<<(e)<<", "<<#f<<"="<<(f)<<"\n"
#define Debug(...) macro_dispatcher(Debug, __VA_ARGS__)(__VA_ARGS__)
#define DA(a,s,n) cout<<#a<<"=["; printarray(a,s,n); cout<<"]\n"

#define TT1 template<class T>
#define TT1T2 template<class T1, class T2>
#define TT1T2T3 template<class T1, class T2, class T3>
template<class T, size_t N> ostream& operator << (ostream& os, const array<T, N>& v);
TT1T2 ostream& operator << (ostream& os, const pair<T1, T2>& p){ return os <<"("<<p.first<<", "<< p.second<<")"; }
TT1 ostream& operator << (ostream& os, const vector<T>& v){       bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
template<class T, size_t N> ostream& operator << (ostream& os, const array<T, N>& v) {     bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const set<T1, T2>&v){    bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const multiset<T1,T2>&v){bool f=1;os<<"[";for(auto& i : v) { if (!f)os << ", ";os<<i;f=0;}return os << "]"; }
TT1T2T3 ostream& operator << (ostream& os, const map<T1,T2,T3>& v){ bool f = 1; os << "["; for (auto& ii : v) { if (!f)os << ", "; os << "(" << ii.first << " -> " << ii.second << ") "; f = 0; }return os << "]"; }
TT1T2 ostream& operator << (ostream& os, const multimap<T1, T2>& v){ bool f = 1; os << "["; for (auto& ii : v) { if (!f)os << ", "; os << "(" << ii.first << " -> " << ii.second << ") "; f = 0; }return os << "]"; }
TT1T2 ostream& operator << (ostream& os, priority_queue<T1, T2> v) { bool f = 1; os << "["; while (!v.empty()) { auto x = v.top(); v.pop(); if (!f) os << ", "; f = 0; os << x; } return os << "]"; }
TT1T2 void printarray(const T1& a, T2 l, T2 r){ for (T2 i = l; i<=r; i++) cout << a[i] << (i<r?" ":""); }

void cio(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cout << setprecision(15);
}

#define tt() printf("%.4f sec\n", (double) clock() / CLOCKS_PER_SEC )

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define Fi first
#define Se second
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define rep(i, n) for(int i=0;i<n;i++)
#define repp(i, n) for(int i=1;i<=n;i++)
#define all(x) x.begin(), x.end()
#define geti1(X) cin >> X
#define geti2(X,Y) cin >> X >> Y
#define geti3(X,Y,Z) cin >> X >> Y >> Z
#define geti4(X,Y,Z,W) cin >> X >> Y >> Z >> W
#define GET_MACRO(_1,_2,_3,_4,NAME,...) NAME
#define geti(...) GET_MACRO(__VA_ARGS__, geti4, geti3, geti2, geti1) (__VA_ARGS__)

#define endl '\n'

typedef tuple<int,int,int> t3;
typedef tuple<int,int,int,int> t4;
void die(){printf("NO\n"); exit(0);}
int xx[8] = {1,-1,0,0,1,1,-1,-1}, yy[8] = {0,0,1,-1,1,-1,1,-1};
const ll mod = 1e9+9;

int N,A,B;
ll a[5050];
ll S[2050][2050];
bool dp[2050][2050];
int dp2[2050];
bool check1(ll X){
    for(int i=1;i<=N;i++) for(int j=1;j<=B;j++) dp[i][j] = 0;
    dp[0][0] = 1;

    auto chk = [&X](ll x)->bool{ return  x - (x&X) == 0; };

    for(int i=1;i<=N;i++){
        for(int t=1;t<=B;t++){
            for(int j=i;j>=1;j--){
                if( chk(S[j][i]) ) dp[i][t] |= dp[j-1][t-1];
            }
        }
    }
    for(int i=A;i<=B;i++) if( dp[N][i] ) return true;
    return false;
}

bool check2(ll X){
    for(int i=1;i<=N;i++) dp2[i] = 1e9;
    dp2[0] = 0;

    auto chk = [&X](ll x)->bool{ return  x - (x&X) == 0; };

    for(int i=1;i<=N;i++){
        for(int j=i;j>=1;j--){
            if( chk(S[j][i]) ) dp2[i] = min(dp2[i], dp2[j-1] + 1);
        }
    }

    return dp2[N] <= B;
}

bool check(ll X){
    if( N <= 100 ) return check1(X);
    else return check2(X);
}

int main(){
    scanf("%d%d%d",&N,&A,&B);
    repp(i,N) scanf("%lld",&a[i]);
    for(int i=1;i<=N;i++){
        S[i][i] = a[i];
        for(int j=i+1;j<=N;j++) S[i][j] = S[i][j-1] + a[j];
    }
    ll ans = 0;

    while( true ){
        if( check(ans) ) break;
        ans = (ans<<1LL) | 1LL;
    }

    if( ans == 0 ){
        printf("0\n");
        return 0;
    }

    ll t = 1LL<<60LL;
    for(;(t&ans)==0;t>>=1){}
    
    for(;t;t>>=1){
        if( check(ans-t) ) ans-=t;
    }
    printf("%lld\n",ans);
}

Compilation message

sculpture.cpp: In function 'int main()':
sculpture.cpp:113:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d",&N,&A,&B);
     ~~~~~^~~~~~~~~~~~~~~~~~~
sculpture.cpp:114:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     repp(i,N) scanf("%lld",&a[i]);
               ~~~~~^~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 2 ms 496 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 2 ms 508 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 2 ms 632 KB Output is correct
17 Correct 2 ms 632 KB Output is correct
18 Correct 3 ms 760 KB Output is correct
19 Correct 3 ms 632 KB Output is correct
20 Correct 2 ms 632 KB Output is correct
21 Correct 3 ms 632 KB Output is correct
22 Correct 3 ms 656 KB Output is correct
23 Correct 3 ms 760 KB Output is correct
24 Correct 3 ms 760 KB Output is correct
25 Correct 3 ms 760 KB Output is correct
26 Correct 4 ms 888 KB Output is correct
27 Correct 5 ms 1016 KB Output is correct
28 Correct 9 ms 1016 KB Output is correct
29 Correct 9 ms 1016 KB Output is correct
30 Correct 3 ms 1016 KB Output is correct
31 Correct 6 ms 1016 KB Output is correct
32 Correct 7 ms 1016 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 2 ms 504 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 380 KB Output is correct
19 Correct 2 ms 504 KB Output is correct
20 Correct 2 ms 504 KB Output is correct
21 Correct 2 ms 504 KB Output is correct
22 Correct 2 ms 632 KB Output is correct
23 Correct 2 ms 504 KB Output is correct
24 Correct 2 ms 504 KB Output is correct
25 Correct 2 ms 504 KB Output is correct
26 Correct 3 ms 504 KB Output is correct
27 Correct 2 ms 380 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 504 KB Output is correct
31 Correct 2 ms 504 KB Output is correct
32 Correct 2 ms 504 KB Output is correct
33 Correct 2 ms 504 KB Output is correct
34 Correct 2 ms 504 KB Output is correct
35 Correct 2 ms 504 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 504 KB Output is correct
38 Correct 2 ms 504 KB Output is correct
39 Correct 2 ms 632 KB Output is correct
40 Correct 2 ms 636 KB Output is correct
41 Correct 3 ms 760 KB Output is correct
42 Correct 3 ms 760 KB Output is correct
43 Correct 2 ms 632 KB Output is correct
44 Correct 3 ms 760 KB Output is correct
45 Correct 3 ms 760 KB Output is correct
46 Correct 2 ms 632 KB Output is correct
47 Correct 3 ms 760 KB Output is correct
48 Correct 3 ms 760 KB Output is correct
49 Correct 4 ms 888 KB Output is correct
50 Correct 5 ms 1016 KB Output is correct
51 Correct 9 ms 1016 KB Output is correct
52 Correct 9 ms 1016 KB Output is correct
53 Correct 3 ms 1016 KB Output is correct
54 Correct 6 ms 1016 KB Output is correct
55 Correct 7 ms 1016 KB Output is correct
56 Correct 5 ms 632 KB Output is correct
57 Correct 8 ms 888 KB Output is correct
58 Correct 19 ms 1008 KB Output is correct
59 Correct 37 ms 1016 KB Output is correct
60 Correct 37 ms 1016 KB Output is correct
61 Correct 3 ms 1016 KB Output is correct
62 Correct 38 ms 1016 KB Output is correct
63 Correct 38 ms 1016 KB Output is correct
64 Correct 5 ms 1016 KB Output is correct
65 Correct 4 ms 660 KB Output is correct
66 Correct 4 ms 760 KB Output is correct
67 Correct 8 ms 888 KB Output is correct
68 Correct 19 ms 1016 KB Output is correct
69 Correct 38 ms 1080 KB Output is correct
70 Correct 37 ms 1144 KB Output is correct
71 Correct 4 ms 1048 KB Output is correct
72 Correct 38 ms 1116 KB Output is correct
73 Correct 30 ms 1020 KB Output is correct
74 Correct 26 ms 1144 KB Output is correct

Subtask #5
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 504 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 504 KB Output is correct
18 Correct 2 ms 504 KB Output is correct
19 Correct 2 ms 504 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 504 KB Output is correct
22 Correct 3 ms 504 KB Output is correct
23 Correct 3 ms 632 KB Output is correct
24 Correct 2 ms 504 KB Output is correct
25 Correct 2 ms 504 KB Output is correct
26 Correct 2 ms 632 KB Output is correct
27 Correct 2 ms 632 KB Output is correct
28 Correct 3 ms 632 KB Output is correct
29 Correct 3 ms 632 KB Output is correct
30 Correct 2 ms 764 KB Output is correct
31 Correct 3 ms 760 KB Output is correct
32 Correct 3 ms 760 KB Output is correct
33 Correct 3 ms 760 KB Output is correct
34 Correct 3 ms 632 KB Output is correct
35 Correct 3 ms 760 KB Output is correct
36 Correct 4 ms 888 KB Output is correct
37 Correct 5 ms 1016 KB Output is correct
38 Correct 9 ms 992 KB Output is correct
39 Correct 9 ms 1016 KB Output is correct
40 Correct 3 ms 1016 KB Output is correct
41 Correct 6 ms 1016 KB Output is correct
42 Correct 7 ms 1016 KB Output is correct
43 Correct 5 ms 632 KB Output is correct
44 Correct 8 ms 948 KB Output is correct
45 Correct 19 ms 1016 KB Output is correct
46 Correct 37 ms 1016 KB Output is correct
47 Correct 38 ms 1060 KB Output is correct
48 Correct 3 ms 1016 KB Output is correct
49 Correct 38 ms 1016 KB Output is correct
50 Correct 38 ms 1008 KB Output is correct
51 Correct 3 ms 888 KB Output is correct
52 Correct 18 ms 4088 KB Output is correct
53 Correct 27 ms 5496 KB Output is correct
54 Correct 59 ms 8312 KB Output is correct
55 Correct 58 ms 8312 KB Output is correct
56 Correct 498 ms 23160 KB Output is correct
57 Correct 483 ms 23264 KB Output is correct
58 Correct 518 ms 23388 KB Output is correct
59 Correct 521 ms 23276 KB Output is correct
60 Correct 714 ms 23416 KB Output is correct
61 Correct 3 ms 888 KB Output is correct
62 Correct 29 ms 5496 KB Output is correct
63 Correct 62 ms 8312 KB Output is correct
64 Correct 51 ms 8328 KB Output is correct
65 Correct 119 ms 13688 KB Output is correct
66 Correct 314 ms 19244 KB Output is correct
67 Correct 716 ms 23272 KB Output is correct
68 Correct 591 ms 23160 KB Output is correct
69 Correct 506 ms 23280 KB Output is correct