oj.uz

Submission #905876

# Submission time Handle Problem Language Result Execution time Memory
905876 2024-01-13T05:56:18 Z Muhammad_Aneeq Bali Sculptures (APIO15_sculpture) C++17
0 / 100
 1 ms 500 KB 
/*
بسم الله الرحمن الرحيم
Author:
                          (:Muhammad Aneeq:)
*/

#include <iostream>
using namespace std;
#define int long long
void solve()
{
	int n,a,b;
	cin>>n>>a>>b;
	int pre[n+1]={};
	for (int i=1;i<=n;i++)
	{
		int x;
		cin>>x;
		pre[i+1]=pre[i]+x;
	}
	int ans=(1LL<<43)-1;
	for (int i=42;i>=0;i--)
	{
		int z=(1LL<<i);
		bool w=0;
		for (int j=1;j<=n;j++)
		{
			for (int k=j+a-1;k<min(n,j+b);k++)
			{
				if ((pre[k]-pre[j])&z)
					w=1;
			}
		}
		if (w==0)
			ans-=z;
	}
	cout<<ans<<endl;
}
signed main()
{
  ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
        solve();
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 1 ms 344 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 1 ms 408 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 1 ms 500 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 1 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -