Contest Duration: - (local time) (100 minutes) Back to Home

Submission #855420

Source Code Expand

Copy
```#include <iostream>
#include <algorithm>
#include <vector>
#include <deque>
#include <queue>
#include <list>
#include <stack>
#include <string>
#include <functional>
#include <numeric>
#include <cmath>
#include <iomanip>
#include <map>
#include <cstdlib>
#define INF 100000000
#define _INF -100000000
#define Loop(i, n) for(int i = 0; i < (int)n; i++)
#define Loop1(i, n) for(int i = 1; i <= (int)n; i++)
#define Loopr(i, n) for(int i = (int)n - 1; i >= 0; i--)
#define Loopr1(i, n) for(int i = (int)n; i >= 1; i--)
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> P;

int N, A;
vi x(50);
ll ans = 0;

void dfs(int p, int c, int sum, bool update) {
if (update&&A*c == sum) ans++;
if (p >= N) return;
dfs(p + 1, c + 1, sum + x[p], 1);
dfs(p + 1, c, sum, 0);
}

void solve() {
dfs(0, 0, 0, 0);
cout << ans << endl;
}

int main() {
cin >> N >> A;
Loop(i, N) {
cin >> x[i];
}
solve();
return 0;
}

```

#### Submission Info

Submission Time 2016-08-28 21:18:33+0900 C - Tak and Cards mao C++14 (GCC 5.4.1) 200 1038 Byte TLE 2105 ms 256 KB

#### Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 200 / 200 0 / 100
Status
 AC × 3 TLE × 1
 AC × 12
 AC × 12 TLE × 12
Set Name Test Cases
Sample example_01.txt, example_02.txt, example_03.txt, example_04.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 TLE 2101 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 256 KB
subtask2_02.txt TLE 2101 ms 256 KB
subtask2_03.txt TLE 2101 ms 256 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 2101 ms 256 KB
subtask2_08.txt TLE 2101 ms 256 KB
subtask2_09.txt TLE 2105 ms 256 KB
subtask2_10.txt TLE 2101 ms 256 KB
subtask2_11.txt TLE 2101 ms 256 KB