oj.uz

Submission #905872

# Submission time Handle Problem Language Result Execution time Memory
905872 2024-01-13T05:43:10 Z Faisal_Saqib Bali Sculptures (APIO15_sculpture) C++17
0 / 100
 1 ms 436 KB 
#include <iostream>
#include <set>
#include <algorithm>
#include <vector>
using namespace std;
#define ll long long
const ll inf=1e18;
ll aps[10000];
int main()
{
	int n,a,b;
	cin>>n>>a>>b;
	for(int i=0;i<n;i++)
		cin>>aps[i];
	// long long ans=inf;	
	ll ans=inf;
	ll cur=0;
	for(int i=0;i<n;i++)
	{
		cur+=aps[i];
		ll _or=cur;
		ll len=0;
		ll cp=0;
		ll ro=1;
		bool pos=1;
		for(int j=i+1;pos and j<n;j++)
		{
			cp+=aps[j];
			len++;
			for(int jp=20;jp>=0;jp--)
			{
				if((cp&(1<<jp))>(cur&(1<<jp)))
				{
					// We can not add a[j] to cp so we stop
					cp-=aps[j];
					len--;
					_or=(_or|cp);
					if(len==0)
					{
						pos=0;
						break;
					}
					ro++;
					cp=aps[j];
					len=1;
				}
			}
		}
		if(len!=0)
		{
			ro++;
		}
		if(a<=ro and ro<=b and pos)
		{
			ans=min(ans,_or);
		}
	}
	cout<<ans<<endl;
	return 0;
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 16.0

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

Subtask #3
0 / 21.0

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

Subtask #4
0 / 25.0

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