Submission #854955


Source Code Expand

Copy
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <ctype.h>
#include <deque>
#include <queue>
#include <cstring>
#include <set>
#include <list>
#include <map>
#include <random>
#include <unordered_map>
#include <stdio.h>

using namespace std;

typedef long long ll;
typedef std::vector<int> vi;
typedef std::vector<bool> vb;
typedef std::vector<string> vs;
typedef std::vector<double> vd;
typedef std::vector<long long> vll;
typedef std::vector<std::vector<int> > vvi;
typedef vector<vvi> vvvi;
typedef vector<vll> vvll;
typedef std::vector<std::pair<int, int> > vpi;
typedef vector<vpi> vvpi;
typedef std::pair<int, int> pi;
typedef std::pair<ll, ll> pll;
typedef std::vector<pll> vpll;

const long long mod = 1000000007;

#define all(c) (c).begin(),(c).end()
#define sz(c) (int)(c).size()
#define forn(i, a, b) for(int i = a; i < b; i++)

#define pb push_back
#define mp make_pair

ll d[51][51][2501];

int main()
{

    int n, m;
    cin>>n>>m;
    vi a(n);
    forn(i,0,n) cin>>a[i];
    d[0][0][0] = 1;
    forn(i,0,n) {
        forn(k,0,i+1) {
            forn(sum,0,2500) {
                d[i+1][k+1][sum+a[i]] += d[i][k][sum];
                d[i+1][k][sum] += d[i][k][sum];
            
            }
        }
    }
    ll ans = 0;
    forn(i,1,n+1) ans += d[n][i][i*m];
    cout<<ans;
    
    
    
    
}

Submission Info

Submission Time
Task C - Tak and Cards
User Vercingetorix
Language C++14 (GCC 5.4.1)
Score 300
Code Size 1425 Byte
Status AC
Exec Time 48 ms
Memory 26368 KB

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 4 ms 512 KB
example_02.txt AC 4 ms 384 KB
example_03.txt AC 5 ms 1152 KB
example_04.txt AC 24 ms 12032 KB
subtask1_01.txt AC 9 ms 3328 KB
subtask1_02.txt AC 9 ms 3328 KB
subtask1_03.txt AC 9 ms 3328 KB
subtask1_04.txt AC 9 ms 3328 KB
subtask1_05.txt AC 9 ms 3328 KB
subtask1_06.txt AC 4 ms 256 KB
subtask1_07.txt AC 4 ms 256 KB
subtask1_08.txt AC 9 ms 3328 KB
subtask1_09.txt AC 8 ms 2944 KB
subtask2_01.txt AC 48 ms 26368 KB
subtask2_02.txt AC 48 ms 26368 KB
subtask2_03.txt AC 46 ms 25344 KB
subtask2_04.txt AC 48 ms 26368 KB
subtask2_05.txt AC 48 ms 26368 KB
subtask2_06.txt AC 48 ms 26368 KB
subtask2_07.txt AC 48 ms 26368 KB
subtask2_08.txt AC 24 ms 12032 KB
subtask2_09.txt AC 24 ms 12032 KB
subtask2_10.txt AC 34 ms 18048 KB
subtask2_11.txt AC 37 ms 19840 KB