Submission #69679821

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) v.begin(), v.end()

int main() {
  int T, M;
  cin >> T >> M;
  vector c(5000+1, vector<ll>(5000+1));
  rep(i, 0, 5000+1) {
    c[i][0] = 1;
    for (int j=1; j<=i; j++) c[i][j] = (c[i-1][j-1]+c[i-1][j])%M;
  }
  rep(_, 0, T) {
    int N;
    cin >> N;
    vector<int> C(N);
    int sm = 0;
    rep(i, 0, N) {
      cin >> C[i];
      sm += C[i];
    }
    ll ans = 1;
    rep(i, 0, N) {
      if (C[i] == 0) continue;
      ans = ans*c[sm][C[i]]%M;
      sm -= C[i];
    }
    cout << ans << endl;
  }

}

Submission Info

Submission Time
Task E - Count Sequences 2
User oogiri
Language C++ 20 (gcc 12.2)
Score 450
Code Size 728 Byte
Status AC
Exec Time 247 ms
Memory 198932 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 450 / 450
Status
AC × 2
AC × 51
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt
All 00_sample_00.txt, 00_sample_01.txt, 01_test_00.txt, 01_test_01.txt, 01_test_02.txt, 01_test_03.txt, 01_test_04.txt, 01_test_05.txt, 01_test_06.txt, 01_test_07.txt, 01_test_08.txt, 01_test_09.txt, 01_test_10.txt, 01_test_11.txt, 01_test_12.txt, 01_test_13.txt, 01_test_14.txt, 01_test_15.txt, 01_test_16.txt, 01_test_17.txt, 01_test_18.txt, 01_test_19.txt, 01_test_20.txt, 01_test_21.txt, 01_test_22.txt, 01_test_23.txt, 01_test_24.txt, 01_test_25.txt, 01_test_26.txt, 01_test_27.txt, 01_test_28.txt, 01_test_29.txt, 01_test_30.txt, 01_test_31.txt, 01_test_32.txt, 01_test_33.txt, 01_test_34.txt, 01_test_35.txt, 01_test_36.txt, 01_test_37.txt, 01_test_38.txt, 01_test_39.txt, 01_test_40.txt, 01_test_41.txt, 01_test_42.txt, 01_test_43.txt, 01_test_44.txt, 01_test_45.txt, 01_test_46.txt, 01_test_47.txt, 01_test_48.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 115 ms 198712 KiB
00_sample_01.txt AC 116 ms 198700 KiB
01_test_00.txt AC 141 ms 198784 KiB
01_test_01.txt AC 176 ms 198692 KiB
01_test_02.txt AC 244 ms 198712 KiB
01_test_03.txt AC 141 ms 198788 KiB
01_test_04.txt AC 176 ms 198716 KiB
01_test_05.txt AC 247 ms 198748 KiB
01_test_06.txt AC 143 ms 198740 KiB
01_test_07.txt AC 177 ms 198740 KiB
01_test_08.txt AC 246 ms 198776 KiB
01_test_09.txt AC 142 ms 198812 KiB
01_test_10.txt AC 176 ms 198772 KiB
01_test_11.txt AC 246 ms 198792 KiB
01_test_12.txt AC 142 ms 198784 KiB
01_test_13.txt AC 176 ms 198696 KiB
01_test_14.txt AC 246 ms 198804 KiB
01_test_15.txt AC 142 ms 198788 KiB
01_test_16.txt AC 176 ms 198700 KiB
01_test_17.txt AC 246 ms 198724 KiB
01_test_18.txt AC 142 ms 198716 KiB
01_test_19.txt AC 176 ms 198924 KiB
01_test_20.txt AC 246 ms 198780 KiB
01_test_21.txt AC 142 ms 198700 KiB
01_test_22.txt AC 175 ms 198772 KiB
01_test_23.txt AC 246 ms 198804 KiB
01_test_24.txt AC 142 ms 198776 KiB
01_test_25.txt AC 175 ms 198788 KiB
01_test_26.txt AC 246 ms 198784 KiB
01_test_27.txt AC 142 ms 198772 KiB
01_test_28.txt AC 177 ms 198712 KiB
01_test_29.txt AC 247 ms 198932 KiB
01_test_30.txt AC 141 ms 198924 KiB
01_test_31.txt AC 176 ms 198864 KiB
01_test_32.txt AC 246 ms 198788 KiB
01_test_33.txt AC 142 ms 198792 KiB
01_test_34.txt AC 176 ms 198840 KiB
01_test_35.txt AC 246 ms 198700 KiB
01_test_36.txt AC 142 ms 198816 KiB
01_test_37.txt AC 176 ms 198716 KiB
01_test_38.txt AC 244 ms 198788 KiB
01_test_39.txt AC 141 ms 198700 KiB
01_test_40.txt AC 176 ms 198804 KiB
01_test_41.txt AC 246 ms 198720 KiB
01_test_42.txt AC 141 ms 198704 KiB
01_test_43.txt AC 176 ms 198716 KiB
01_test_44.txt AC 245 ms 198764 KiB
01_test_45.txt AC 142 ms 198700 KiB
01_test_46.txt AC 176 ms 198720 KiB
01_test_47.txt AC 246 ms 198752 KiB
01_test_48.txt AC 235 ms 198700 KiB