oj.uz

Submission #646678

# Submission time Handle Problem Language Result Execution time Memory
646678 2022-09-30T11:41:39 Z Tenis0206 Bali Sculptures (APIO15_sculpture) C++11
0 / 100
 1 ms 284 KB 
#include <bits/stdc++.h>
#define int long long

using namespace std;

int n,a,b;

int v[100005];
int sp[100005];

void solve_1()
{
    int val = 0;
    for(int bit=60;bit>=0;bit--)
    {
        int nr = 0;
        for(int i=1;i<=n;i++)
        {
            int poz = 0;
            int sum = 0;
            for(int j=i;j<=n;j++)
            {
                sum += v[j];
                if(sum > val + (1LL<<bit))
                {
                    break;
                }
                if(((val >> bit) | (sum >> bit)) == (val >> bit))
                {
                    poz = j;
                }
            }
            if(!poz)
            {
                nr = b + 1;
                break;
            }
            i = poz;
            ++nr;
        }
        if(nr > b)
        {
            val += (1LL<<bit);
        }
    }
    cout<<val<<'\n';
}

void solve()
{

}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    #ifdef home
    freopen("nr.in","r",stdin);
    freopen("nr.out","w",stdout);
    #endif // home
    cin>>n>>a>>b;
    for(int i=1;i<=n;i++)
    {
        cin>>v[i];
        sp[i] = sp[i-1] + v[i];
    }
    solve_1();
    return 0;
    if(a==1)
    {
        solve_1();
        return 0;
    }
    solve();
    return 0;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Incorrect 1 ms 212 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 284 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Incorrect 0 ms 212 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Incorrect 0 ms 212 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Incorrect 0 ms 212 KB Output isn't correct
7 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 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Incorrect 0 ms 212 KB Output isn't correct
7 Halted 0 ms 0 KB -