oj.uz

답안 #629753

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
629753 2022-08-15T05:05:52 Z aebov Bali Sculptures (APIO15_sculpture) C++17
0 / 100
 1 ms 324 KB 
#include<iostream>
#include<algorithm>
#include<bitset>
#include<vector>
#define pb push_back
using namespace std;

int n,a,b,y[21];
int ans=1000000000+7;

int f(int x)
{
	if(__builtin_popcount(x)<a-1)return 1000000000+7;
	vector<int> pos;
	for(int i=0;i<b;i++)if((x>>i)%2==1)pos.pb(i);
	pos.pb(n-1);
	int ret=0;
	int tm2=0;
	for(int i=0;i<=pos[0];i++)tm2+=y[i];
	ret|=tm2;
	for(int i=1;i<pos.size();i++){
		tm2=0;
		for(int j=pos[i-1]+1;j<=pos[i];j++)tm2+=y[j];
		ret|=tm2;
	}
	//bitset<5> tb = x;
	//cout<<tb<< " "<<ret<<endl;
	return ret;
}
int main()
{
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>n>>a>>b;
	for(int i=0;i<n;i++)cin>>y[i];

	for(int i=0;i<(1<<b);i++){
		ans=min(ans,f(i));
	}
	cout<<ans<<endl;
}

Compilation message

sculpture.cpp: In function 'int f(int)':
sculpture.cpp:21:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |  for(int i=1;i<pos.size();i++){
      |              ~^~~~~~~~~~~

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 316 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Incorrect 0 ms 324 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 0 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 320 KB Output isn't correct
3 Halted 0 ms 0 KB -