oj.uz

Submission #718274

# Submission time Handle Problem Language Result Execution time Memory
718274 2023-04-03T19:24:54 Z Urvuk3 Bali Sculptures (APIO15_sculpture) C++17
21 / 100
 28 ms 376 KB 
#include <bits/stdc++.h>

using namespace std;

#define ll long long
const int INF=1e9,MOD=1e9+7;
const ll LINF=1e18;
#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mid ((l+r)/2)
#define sz(a) (int((a).size()))
#define all(a) a.begin(),a.end()
#define endl "\n"
#define pb push_back

struct Line{
    ll k,m,l,r,id;
    ll operator ()(ll x){
        return k*x+m;
    }
};

void PRINT(int x) {cerr << x;}
void PRINT(ll x) {cerr << x;}
void PRINT(double x) {cerr << x;}
void PRINT(char x) {cerr << '\'' << x << '\'';}
void PRINT(string x) {cerr << '\"' << x << '\"';}
void PRINT(bool x) {cerr << (x ? "true" : "false");}
void PRINT(Line f){
    cerr<<f.k<<"x+"<<f.m<<" ["<<f.l<<","<<f.r<<"]";
}

template<typename T,typename V>
void PRINT(pair<T,V>& x){
    cerr<<"{";
    PRINT(x.fi);
    cerr<<",";
    PRINT(x.se);
    cerr<<"}";
}
template<typename T>
void PRINT(T &x){
    int id=0;
    cerr<<"{";
    for(auto _i:x){
        cerr<<(id++ ? "," : "");
        PRINT(_i);
    }
    cerr<<"}";
}
void _PRINT(){
    cerr<<"]\n";
}
template<typename Head,typename... Tail>
void _PRINT(Head h,Tail... t){
    PRINT(h);
    if(sizeof...(t)) cerr<<", ";
    _PRINT(t...);
}

#define Debug(x...) cerr<<"["<<#x<<"]=["; _PRINT(x)

ll Intersect(Line l1,Line l2){
    ll ret=floor((double)(l2.m-l1.m)/double(l1.k-l2.k));
    return ret;
}

void Solve(){
    int N,A,B; cin>>N>>A>>B;
    if(N<=100){
        vector<ll> a(N+1);
        for(int i=1;i<=N;i++) cin>>a[i];
        vector<ll> pref(N+1,0);
        for(int i=1;i<=N;i++) pref[i]=pref[i-1]+a[i];
        ll res=0;
        set<int> nparts;
        for(int i=1;i<=B;i++) nparts.insert(i);
        ll cur=0;
        for(ll bit=41;bit>=0;bit--){
            vector<vector<int>> dp(N+1,vector<int>(B+1,0));
            dp[0][0]=1;
            for(int i=1;i<=N;i++){
                for(int p=1;p<=min(i,B);p++){
                    for(int j=0;j<i;j++){
                        bool sb=(((pref[i]-pref[j])&((1LL<<bit)|cur))==0);
                        if(sb && dp[j][p-1]){
                            dp[i][p]=1;
                        }
                    }
                }
            }
            set<int> s;
            for(int p=1;p<=B;p++){
                if(dp[N][p] && nparts.count(p)){
                    s.insert(p);
                }
            }
            if(!s.empty()){
                nparts=s;
                cur+=(1LL<<bit);
            }
            else{
                res+=(1LL<<bit);
            }
        }
        cout<<res<<endl;
    }
    else{

    }

}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t; t=1;
    //cin>>t;
    while(t--){
        Solve();
    }
    return 0;
}

/*
6 1 3
8 1 2 1 5 4
*/

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 2 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Incorrect 1 ms 212 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 320 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Incorrect 1 ms 212 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 296 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 316 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 212 KB Output is correct
17 Correct 3 ms 212 KB Output is correct
18 Correct 4 ms 340 KB Output is correct
19 Correct 3 ms 320 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 3 ms 212 KB Output is correct
22 Correct 3 ms 320 KB Output is correct
23 Correct 2 ms 320 KB Output is correct
24 Correct 3 ms 324 KB Output is correct
25 Correct 3 ms 212 KB Output is correct
26 Correct 7 ms 320 KB Output is correct
27 Correct 16 ms 352 KB Output is correct
28 Correct 23 ms 356 KB Output is correct
29 Correct 24 ms 340 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 17 ms 348 KB Output is correct
32 Correct 24 ms 348 KB Output is correct

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 320 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Incorrect 1 ms 212 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 320 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 320 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 320 KB Output is correct
26 Correct 1 ms 324 KB Output is correct
27 Correct 2 ms 212 KB Output is correct
28 Correct 3 ms 212 KB Output is correct
29 Correct 3 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 3 ms 212 KB Output is correct
32 Correct 3 ms 212 KB Output is correct
33 Correct 2 ms 212 KB Output is correct
34 Correct 3 ms 212 KB Output is correct
35 Correct 3 ms 212 KB Output is correct
36 Correct 7 ms 212 KB Output is correct
37 Correct 17 ms 340 KB Output is correct
38 Correct 28 ms 356 KB Output is correct
39 Correct 24 ms 372 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 17 ms 344 KB Output is correct
42 Correct 23 ms 368 KB Output is correct
43 Correct 4 ms 212 KB Output is correct
44 Correct 5 ms 340 KB Output is correct
45 Correct 15 ms 348 KB Output is correct
46 Correct 16 ms 376 KB Output is correct
47 Correct 18 ms 340 KB Output is correct
48 Correct 1 ms 320 KB Output is correct
49 Correct 28 ms 340 KB Output is correct
50 Correct 27 ms 356 KB Output is correct
51 Incorrect 1 ms 212 KB Output isn't correct
52 Halted 0 ms 0 KB -