Submission #3106189
Source Code Expand
#include <bits/stdc++.h> #define N 1000000007 using namespace std; int n, m, q, k, x; int a[2005] = {0}; // dp[i][j] = combi i:type j:num int dp[2005][2005] = {0}; // ans[i][j] = combi i:not use j:num int ans[2005][2005] = {0}; void solve(); int main() { int i; cin >> n >> m >> q; for(i = 0; i < n; ++i) cin >> a[i]; solve(); for(i = 0; i < q; ++i) { cin >> k >> x; cout << ans[k][m - x] << endl; } return 0; } void solve() { int i, j; for(i = 0; i <= n; ++i) dp[i][0] = 1; for(i = 1; i <= n; ++i) for(j = 1; j <= m; ++j) { dp[i][j] = dp[i][j - 1] + dp[i - 1][j]; dp[i][j] %= N; if(j - a[i - 1] - 1 >= 0) dp[i][j] -= dp[i - 1][j - a[i - 1] - 1]; while(dp[i][j] < 0) dp[i][j] += N; dp[i][j] %= N; } for(i = 1; i <= n; ++i) { for(j = 0; j <= m; ++j) { ans[i][j] = dp[n][j] - dp[n][j - 1]; if(j - a[i - 1] - 1 >= 0) ans[i][j] += ans[i][j - a[i - 1] - 1]; } } }
Submission Info
Submission Time | |
---|---|
Task | D - 注文の多い高橋商店 |
User | m_tsubasa |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1012 Byte |
Status | WA |
Exec Time | 1175 ms |
Memory | 37248 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | Subtask3 | Subtask4 | ||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 10 | 0 / 20 | 0 / 50 | 0 / 20 | ||||||||||||||||||
Status |
|
|
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
Subtask1 | sample_01.txt, sample_02.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 |
Subtask2 | sample_01.txt, sample_02.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, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt |
Subtask3 | sample_01.txt, sample_02.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, subtask3_01.txt, subtask3_02.txt, subtask3_03.txt |
Subtask4 | sample_01.txt, sample_02.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, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask3_01.txt, subtask3_02.txt, subtask3_03.txt, subtask4_01.txt, subtask4_02.txt, subtask4_03.txt, subtask4_04.txt, subtask4_05.txt, subtask4_06.txt, subtask4_07.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 2304 KB |
sample_02.txt | AC | 1 ms | 2304 KB |
subtask1_01.txt | AC | 2 ms | 2304 KB |
subtask1_02.txt | AC | 2 ms | 2304 KB |
subtask1_03.txt | AC | 2 ms | 2304 KB |
subtask1_04.txt | WA | 2 ms | 2560 KB |
subtask1_05.txt | WA | 3 ms | 4736 KB |
subtask1_06.txt | WA | 3 ms | 4736 KB |
subtask1_07.txt | WA | 2 ms | 4736 KB |
subtask1_08.txt | WA | 2 ms | 4736 KB |
subtask2_01.txt | WA | 106 ms | 5248 KB |
subtask2_02.txt | WA | 208 ms | 5760 KB |
subtask2_03.txt | WA | 206 ms | 5632 KB |
subtask3_01.txt | WA | 29 ms | 18688 KB |
subtask3_02.txt | WA | 59 ms | 31616 KB |
subtask3_03.txt | WA | 52 ms | 31616 KB |
subtask4_01.txt | WA | 981 ms | 31360 KB |
subtask4_02.txt | WA | 1149 ms | 36736 KB |
subtask4_03.txt | AC | 1062 ms | 32000 KB |
subtask4_04.txt | AC | 1007 ms | 3328 KB |
subtask4_05.txt | WA | 1175 ms | 36608 KB |
subtask4_06.txt | WA | 1103 ms | 37248 KB |
subtask4_07.txt | WA | 1170 ms | 36352 KB |