QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#273261 | #7875. Queue Sorting | ucup-team093# | WA | 14ms | 4432kb | C++20 | 1.0kb | 2023-12-02 22:32:19 | 2023-12-02 22:32:20 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
const int N = 510, P = 998244353;
int c[N][N];
int main() {
for(int i = 0; i < N; i ++) {
c[i][0] = 1;
for(int j = 1; j <= i; j ++)
c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % P;
}
int n, len = 0, sum = 0;
cin >> n;
vector<int> a(n);
for(int i = 0; i < n; i ++)
cin >> a[i];
len = accumulate(a.begin(), a.end(), 0);
vector<int> dp(n + 1, 0);
for(int i = 1; i <= n; i ++)
dp[i] = (P + c[i][a[0]] - c[i - 1][a[0]]) % P;
sum = a[0];
for(int i = 1; i < n; i ++) {
vector<int> tmp(n + 1, 0);
for(int j = 1; j <= n; j ++) {
for(int k = 0, uk = min(j - sum, a[i]); k <= uk; k ++)
for(int l = j; l <= n; l ++)
tmp[l] = (tmp[l] + dp[j] * (long long)(P + c[l - j][a[i] - k] - (l > j ? c[l - j - 1][a[i] - k] : 0))) % P;
}
swap(tmp, dp);
sum += a[i];
}
cout << dp[n];
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 4420kb
input:
4 1 1 1 1
output:
14
result:
ok 1 number(s): "14"
Test #2:
score: -100
Wrong Answer
time: 14ms
memory: 4432kb
input:
300 0 5 2 2 1 0 3 2 2 5 2 1 1 2 1 3 2 3 2 0 0 0 0 1 2 2 3 0 2 2 3 2 0 2 3 0 6 0 0 2 0 1 3 2 1 1 1 3 4 0 1 0 4 1 1 1 1 1 1 2 3 2 1 2 3 2 3 0 5 3 3 2 0 1 1 0 2 1 1 2 0 0 2 1 1 3 2 2 1 2 1 3 0 3 0 1 2 2 0 5 0 2 2 0 0 0 1 2 1 4 2 1 1 0 3 0 2 0 3 1 1 2 0 2 1 1 0 2 0 1 2 2 3 3 1 1 1 1 0 1 3 3 1 0 2 2 4 2 ...
output:
0
result:
wrong answer 1st numbers differ - expected: '507010274', found: '0'