Submission #855114


Source Code Expand

Copy
#include<cstdio>
#include<cstring>
#include<cmath>
#include<set>
#include<map>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<string>
#include<assert.h>
#include<sstream>
using namespace std;
#define pb push_back
#define mp make_pair
#define sz(x) ((int)(x).size())
#define rep(i,l,r) for(int i=(l);i<(r);++i)
#define setIO(x) freopen(x".in","r",stdin);freopen(x".out","w",stdout);
typedef long long ll;
typedef pair<int, int> pii;
const ll LINF = 1e18 + 7;
const int N = 55;
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
const double EPS = 1e-8;
//-------------head-------------
int n, ave, x[N];
ll f[N][N * N];
int main() {
	scanf("%d%d", &n, &ave);
	rep(i, 1, n + 1)
		scanf("%d", &x[i]);
	memset(f, -1, sizeof(f));
	f[0][0] = 1;
	int sum = 0;
	rep(i, 1, n + 1)
	{
		sum += x[i];
		for (int j = i; j > 0; --j) {
			for (int k = sum; k >= x[i]; --k)
				if (~f[j - 1][k - x[i]]) {
					if (f[j][k] == -1) {
						f[j][k] = f[j - 1][k - x[i]];
					} else {
						f[j][k] += f[j - 1][k - x[i]];
					}
				}
		}
	}
	ll ans = 0;
	rep(i, 1, n + 1)
		if (~f[i][i * ave])
			ans += f[i][i * ave];
	printf("%lld\n", ans);
	return 0;
}

Submission Info

Submission Time
Task C - Tak and Cards
User mcginn
Language C++14 (GCC 5.4.1)
Score 300
Code Size 1226 Byte
Status AC
Exec Time 9 ms
Memory 1536 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:30:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &ave);
                         ^
./Main.cpp:32:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &x[i]);
                     ^

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 200 / 200 100 / 100
Status
AC × 4
AC × 12
AC × 24
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 6 ms 1536 KB
example_02.txt AC 6 ms 1536 KB
example_03.txt AC 6 ms 1536 KB
example_04.txt AC 5 ms 1536 KB
subtask1_01.txt AC 6 ms 1536 KB
subtask1_02.txt AC 6 ms 1536 KB
subtask1_03.txt AC 6 ms 1536 KB
subtask1_04.txt AC 5 ms 1536 KB
subtask1_05.txt AC 5 ms 1536 KB
subtask1_06.txt AC 6 ms 1536 KB
subtask1_07.txt AC 5 ms 1536 KB
subtask1_08.txt AC 5 ms 1536 KB
subtask1_09.txt AC 6 ms 1536 KB
subtask2_01.txt AC 8 ms 1536 KB
subtask2_02.txt AC 8 ms 1536 KB
subtask2_03.txt AC 8 ms 1536 KB
subtask2_04.txt AC 9 ms 1536 KB
subtask2_05.txt AC 9 ms 1536 KB
subtask2_06.txt AC 6 ms 1536 KB
subtask2_07.txt AC 8 ms 1536 KB
subtask2_08.txt AC 7 ms 1536 KB
subtask2_09.txt AC 6 ms 1536 KB
subtask2_10.txt AC 7 ms 1536 KB
subtask2_11.txt AC 7 ms 1536 KB