Submission #73185547


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

using i64 = long long;
using u64 = unsigned long long;
using u32 = unsigned;

using i128 = __int128;
using u128 = unsigned __int128;

mt19937_64 mrand((u64)random_device{}() << 32 ^ random_device{}() ^
	chrono::high_resolution_clock::now().time_since_epoch().count());
template<class T = i64,class T2>T rnd(T l,T2 r){
return uniform_int_distribution<T>(l,r)(mrand);}

int main (){
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);

	int n;
	i64 s;

	cin >> n >> s;

	vector<i64> a(n + 1);

	for (int i = 0;i < n;i++)
		cin >> a[i];

	unordered_map<i64,int> cnt;
	
	for (int i = 0;i < 1 << n / 2;i++){
		i64 v = 0;

		for (int j = i;j;j -= j & -j)
			v += a[__lg(j & -j)];

		cnt[v]++;
	}

	i64 ans = 0;

	for (i64 i = 0;i < 1LL << n;i += 1 << n / 2){
		i64 v = 0;

		for (i64 j = i;j;j -= j & -j)
			v += a[__lg(j & -j)];
			
		ans += cnt[s - v];
	}

	cout << ans;
}

Submission Info

Submission Time
Task E - Assortment of Sweets
User zyx2012
Language C++23 (GCC 15.2.0)
Score 433
Code Size 966 Byte
Status AC
Exec Time 639 ms
Memory 92032 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 433 / 433
Status
AC × 3
AC × 71
Set Name Test Cases
Sample sample01.txt, sample02.txt, sample03.txt
All sample01.txt, sample02.txt, sample03.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in50.txt, in51.txt, in52.txt, in53.txt, in54.txt, in55.txt, in56.txt, in57.txt, in58.txt, in59.txt, in60.txt, in61.txt, in62.txt, in63.txt, in64.txt, in65.txt, in66.txt, in67.txt, in68.txt
Case Name Status Exec Time Memory
in01.txt AC 1 ms 3484 KiB
in02.txt AC 1 ms 3484 KiB
in03.txt AC 1 ms 3604 KiB
in04.txt AC 1 ms 3640 KiB
in05.txt AC 1 ms 3616 KiB
in06.txt AC 19 ms 3640 KiB
in07.txt AC 577 ms 91880 KiB
in08.txt AC 22 ms 3872 KiB
in09.txt AC 358 ms 91864 KiB
in10.txt AC 18 ms 3544 KiB
in11.txt AC 1 ms 3552 KiB
in12.txt AC 572 ms 91936 KiB
in13.txt AC 19 ms 3640 KiB
in14.txt AC 601 ms 92032 KiB
in15.txt AC 560 ms 91848 KiB
in16.txt AC 592 ms 92000 KiB
in17.txt AC 18 ms 3688 KiB
in18.txt AC 19 ms 3476 KiB
in19.txt AC 19 ms 3788 KiB
in20.txt AC 19 ms 3584 KiB
in21.txt AC 19 ms 3752 KiB
in22.txt AC 604 ms 91772 KiB
in23.txt AC 19 ms 3788 KiB
in24.txt AC 20 ms 3860 KiB
in25.txt AC 1 ms 3476 KiB
in26.txt AC 1 ms 3672 KiB
in27.txt AC 2 ms 4044 KiB
in28.txt AC 1 ms 3624 KiB
in29.txt AC 1 ms 3460 KiB
in30.txt AC 580 ms 91620 KiB
in31.txt AC 589 ms 92024 KiB
in32.txt AC 1 ms 3608 KiB
in33.txt AC 1 ms 3624 KiB
in34.txt AC 1 ms 3660 KiB
in35.txt AC 1 ms 3660 KiB
in36.txt AC 373 ms 92028 KiB
in37.txt AC 639 ms 92032 KiB
in38.txt AC 562 ms 92020 KiB
in39.txt AC 525 ms 91844 KiB
in40.txt AC 614 ms 91816 KiB
in41.txt AC 576 ms 92028 KiB
in42.txt AC 626 ms 91996 KiB
in43.txt AC 583 ms 91900 KiB
in44.txt AC 1 ms 3752 KiB
in45.txt AC 559 ms 92000 KiB
in46.txt AC 594 ms 91940 KiB
in47.txt AC 565 ms 91832 KiB
in48.txt AC 587 ms 91940 KiB
in49.txt AC 592 ms 91996 KiB
in50.txt AC 530 ms 91932 KiB
in51.txt AC 19 ms 3752 KiB
in52.txt AC 550 ms 91952 KiB
in53.txt AC 1 ms 3460 KiB
in54.txt AC 1 ms 3552 KiB
in55.txt AC 1 ms 3488 KiB
in56.txt AC 1 ms 3484 KiB
in57.txt AC 19 ms 3736 KiB
in58.txt AC 19 ms 3816 KiB
in59.txt AC 109 ms 92000 KiB
in60.txt AC 109 ms 91844 KiB
in61.txt AC 1 ms 3476 KiB
in62.txt AC 1 ms 3476 KiB
in63.txt AC 1 ms 3456 KiB
in64.txt AC 1 ms 3484 KiB
in65.txt AC 1 ms 3608 KiB
in66.txt AC 1 ms 3544 KiB
in67.txt AC 1 ms 3640 KiB
in68.txt AC 1 ms 3660 KiB
sample01.txt AC 1 ms 3628 KiB
sample02.txt AC 1 ms 3552 KiB
sample03.txt AC 1 ms 3544 KiB