Submission #2637938

Source Code Expand

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

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))

#define INTSPACE 12
char _buf[INTSPACE*1000000 + 3];

int loadint() {
    if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
    return atoi(_buf);
}

int loadvec(vector<int>& v, int N=-1) {
    if (N == -1) {
        N = loadint();
        if (N==0) return 0;
    }
    int bufsize = INTSPACE*N + 3;
    if (fgets(_buf, bufsize, stdin)==NULL) return 0;
    v.resize(N);

    int i=0;
    bool last = false;
    for (char *p=&_buf[0]; ;) {
        char *q = p;
        while (*q > ' ') ++q;
        if (*q == 0x0D || *q == 0x0A) last = true;
        *q = 0;
        v[i++] = atoi(p);
        if (last || i == N) break;
        p = q+1;
    }
    // assert(i <= N);
    return i;
}

ll solve(int N, int A, vi& x) {
    // すべて1-50
    int NN = N*N;
    ll cnt[51][2501]; //50^3
    mset(cnt, 0);
    cnt[0][0] = 1;

    rep(i,N){ // 50
        int xi = x[i];
        // x[i]を使う、使わない
        for (int m=i; m>=0; --m) {
            for (int k=50*m; k>=0; --k) {
                if (cnt[m][k] == 0) continue;
                if (IN(m+1,0,50) && IN(k+xi,0,2500)) {
                    cnt[m+1][k+xi] += cnt[m][k];
                }
            }
        }
    }
    ll ans = 0;
    for (int m=1; m<=N; ++m){
        // cerr << m << " " << cnt[m] << endl;
        ans += cnt[m][m*A];
    }
    return ans;
}

int main() {
    vi x;
    loadvec(x,2);
    int N=x[0],A=x[1];
    loadvec(x,N);
    cout << solve(N,A,x) << endl;
    return 0;
}

Submission Info

Submission Time
Task C - 高橋君とカード / Tak and Cards
User naoya_t
Language C++14 (GCC 5.4.1)
Score 300
Code Size 2599 Byte
Status
Exec Time 3 ms
Memory 1280 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 example_01.txt, example_02.txt, example_03.txt, example_04.txt
Subtask1 200 / 200 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 100 / 100 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 2 ms 1280 KB
example_02.txt 2 ms 1280 KB
example_03.txt 2 ms 1280 KB
example_04.txt 2 ms 1280 KB
subtask1_01.txt 2 ms 1280 KB
subtask1_02.txt 2 ms 1280 KB
subtask1_03.txt 2 ms 1280 KB
subtask1_04.txt 2 ms 1280 KB
subtask1_05.txt 2 ms 1280 KB
subtask1_06.txt 2 ms 1280 KB
subtask1_07.txt 2 ms 1280 KB
subtask1_08.txt 2 ms 1280 KB
subtask1_09.txt 2 ms 1280 KB
subtask2_01.txt 3 ms 1280 KB
subtask2_02.txt 3 ms 1280 KB
subtask2_03.txt 3 ms 1280 KB
subtask2_04.txt 2 ms 1280 KB
subtask2_05.txt 2 ms 1280 KB
subtask2_06.txt 2 ms 1280 KB
subtask2_07.txt 3 ms 1280 KB
subtask2_08.txt 2 ms 1280 KB
subtask2_09.txt 2 ms 1280 KB
subtask2_10.txt 2 ms 1280 KB
subtask2_11.txt 2 ms 1280 KB