Submission #19699889

Source Code Expand

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

const int offset_j = 50 * 50;
const int jmax = 50 * 50 * 2;
long long dp[51][jmax+10];

int main()
{
  int n, a;
  cin >> n >> a;

  vector<int> v(n);
  for (int i = 0; i < n; i++){
    cin >> v[i];
    v[i] -= a;
  }

  dp[0][offset_j] = 1;
  
  for (int i = 1; i <= n; i++){
    for (int j = -(50*50); j <= 50*50; j++){
      dp[i][j + offset_j] = dp[i-1][j + offset_j];
      int k = j - v[i-1] + offset_j;
      if ((k >= 0) && (k <= jmax)){
	dp[i][j + offset_j] += dp[i-1][k];
      }
    }
  }

  cout << dp[n][0 + offset_j] - 1 << endl;
  return 0;
}

Submission Info

Submission Time
Task C - Tak and Cards
User unnohideyuki
Language C++ (GCC 9.2.1)
Score 300
Code Size 638 Byte
Status AC
Exec Time 9 ms
Memory 5560 KiB

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 9 ms 3712 KiB
example_02.txt AC 2 ms 3720 KiB
example_03.txt AC 2 ms 3804 KiB
example_04.txt AC 4 ms 4700 KiB
subtask1_01.txt AC 4 ms 4132 KiB
subtask1_02.txt AC 4 ms 4128 KiB
subtask1_03.txt AC 5 ms 4236 KiB
subtask1_04.txt AC 3 ms 4200 KiB
subtask1_05.txt AC 2 ms 4040 KiB
subtask1_06.txt AC 3 ms 3644 KiB
subtask1_07.txt AC 2 ms 3528 KiB
subtask1_08.txt AC 3 ms 4244 KiB
subtask1_09.txt AC 2 ms 4080 KiB
subtask2_01.txt AC 6 ms 5464 KiB
subtask2_02.txt AC 7 ms 5512 KiB
subtask2_03.txt AC 5 ms 5412 KiB
subtask2_04.txt AC 6 ms 5560 KiB
subtask2_05.txt AC 5 ms 5448 KiB
subtask2_06.txt AC 8 ms 5448 KiB
subtask2_07.txt AC 5 ms 5436 KiB
subtask2_08.txt AC 5 ms 4700 KiB
subtask2_09.txt AC 4 ms 4756 KiB
subtask2_10.txt AC 5 ms 5164 KiB
subtask2_11.txt AC 5 ms 5172 KiB