Submission #855500


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;
long long N, A;
int x[50];
int main() {
	cin >> N >> A;
	for (int i = 0; i < N; ++ i) cin >> x[i];
	map<int, long long> cnt1[30], cnt2[30];
	for (int i = 0; i < 1<<(N/2); ++ i) {
		int sum = 0, c = 0;
		for (int j = 0; j < N/2; ++ j) if ((i>>j)&1) { sum += x[j]; ++ c; }
		++ cnt1[c][sum];
	}
	for (int i = 0; i < 1<<(N-N/2); ++ i) {
		int sum = 0, c = 0;
		for (int j = 0; j < N-N/2; ++ j) if ((i>>j)&1) { sum += x[j+N/2]; ++ c; }
		++ cnt2[c][sum];
	}
	long long r = 0;
	for (int j = 0; j <= N/2; ++ j) for (auto p : cnt1[j]) {
		for (int i = 0; i <= N-N/2; ++ i) {
			int c = i + j;
			int x = A * c - p.first;
			if (c == 0) continue;
			if (cnt2[i].count(x)) r += p.second * cnt2[i][x];
		}
	}
	cout << r << endl;
}

Submission Info

Submission Time
Task C - Tak and Cards
User hasi
Language C++14 (GCC 5.4.1)
Score 200
Code Size 796 Byte
Status TLE
Exec Time 2105 ms
Memory 768 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 200 / 200 0 / 100
Status
AC × 4
AC × 12
AC × 17
TLE × 7
Set Name Test Cases
Sample example_01.txt, example_02.txt, example_03.txt, example_04.txt
Subtask1 example_01.txt, example_02.txt, example_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt
All example_01.txt, example_02.txt, example_03.txt, example_04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt
Case Name Status Exec Time Memory
example_01.txt AC 4 ms 256 KB
example_02.txt AC 4 ms 256 KB
example_03.txt AC 4 ms 256 KB
example_04.txt AC 24 ms 256 KB
subtask1_01.txt AC 4 ms 256 KB
subtask1_02.txt AC 4 ms 256 KB
subtask1_03.txt AC 4 ms 256 KB
subtask1_04.txt AC 4 ms 256 KB
subtask1_05.txt AC 4 ms 256 KB
subtask1_06.txt AC 4 ms 256 KB
subtask1_07.txt AC 4 ms 256 KB
subtask1_08.txt AC 4 ms 256 KB
subtask1_09.txt AC 4 ms 256 KB
subtask2_01.txt TLE 2101 ms 512 KB
subtask2_02.txt TLE 2101 ms 512 KB
subtask2_03.txt TLE 2101 ms 512 KB
subtask2_04.txt TLE 2101 ms 256 KB
subtask2_05.txt TLE 2101 ms 256 KB
subtask2_06.txt TLE 2101 ms 256 KB
subtask2_07.txt TLE 2105 ms 256 KB
subtask2_08.txt AC 35 ms 512 KB
subtask2_09.txt AC 36 ms 512 KB
subtask2_10.txt AC 539 ms 640 KB
subtask2_11.txt AC 1082 ms 768 KB