제출 #552836

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
552836		dsyz	Ice Hockey World Championship (CEOI15_bobek)	C++17	100 / 100	307 ms	20808 KiB

bobek

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MAXN (1000005)
int main() {
	ios_base::sync_with_stdio(false);cin.tie(0);
	ll N,M;
	cin>>N>>M;
	ll arr[N];
	for(ll i = 0;i < N;i++){
		cin>>arr[i];
	}
	vector<ll> front;
	vector<ll> back;
	for(ll i = 0;i < (N + 1) / 2;i++){
		front.push_back(arr[i]);
	}
	for(ll i = (N + 1) / 2;i < N;i++){
		back.push_back(arr[i]);
	}
	vector<ll> v1;
	vector<ll> v2;
	for(ll bitmask = 0;bitmask < ll(1ll << front.size());bitmask++){
		ll sum = 0;
		for(ll i = 0;i < front.size();i++){
			if(ll(1ll<<i) & bitmask){
				sum += front[i];
			}
		}
		v1.push_back(sum);
	}
	for(ll bitmask = 0;bitmask < ll(1ll << back.size());bitmask++){
		ll sum = 0;
		for(ll i = 0;i < back.size();i++){
			if(ll(1ll<<i) & bitmask){
				sum += back[i];
			}
		}
		v2.push_back(sum);
	}
	sort(v1.begin(),v1.end());
	sort(v2.begin(),v2.end());
	ll sum = 0;
	ll ptr = v2.size() - 1;
	for(ll i = 0;i < v1.size();i++){
		while(ptr >= 0 && v1[i] + v2[ptr] > M){  //when ptr == -1 then there is no possible way for v1
			ptr--;
		}
		sum += (ptr + 1);
	}
	cout<<sum<<'\n';
}

컴파일 시 표준 에러 (stderr) 메시지

bobek.cpp: In function 'int main()':
bobek.cpp:25:18: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |   for(ll i = 0;i < front.size();i++){
      |                ~~^~~~~~~~~~~~~~
bobek.cpp:34:18: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |   for(ll i = 0;i < back.size();i++){
      |                ~~^~~~~~~~~~~~~
bobek.cpp:45:17: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |  for(ll i = 0;i < v1.size();i++){
      |               ~~^~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10