Submission #1227724


Source Code Expand

#include <cstdio>
#include <vector>
#include <string.h>
#include <algorithm>
using namespace std;

#define reps(i,s,n) for(int (i) = (s); (i) < (n); ++(i))
#define rep(i,n) reps(i,0,n)

int N,M,q;
const int MOD = 1e9+7;
const int MAX_N = 110;
const int MAX_M = 110;

int main(){
    
    scanf("%d %d %d",&N,&M,&q);

    if(( N > 100 || M > 100 || q > 100)){
        return 0;
    }
    vector<int> a(N,0);
    
    rep(i,N)  scanf("%d", &a[i]);

    int dp[MAX_N][MAX_M+1] = {0};
    int S[MAX_M+1] = {0};
    
    while(q--){
        int k, x;
        scanf("%d %d",&k,&x);
        k--;
        memset(dp,0,sizeof(dp));
        dp[0][0] = 1;
        int m = M-x;
        rep(i,N){
            if(i == k){
                rep(j,m+1) dp[i+1][j] = dp[i][j];
                continue;
            }
            rep(j,m+1) S[j+1] = (S[j] + dp[i][j]) % MOD;
            rep(j,m+1){
                dp[i+1][j] = S[j+1] - S[max(0,j-a[i])];
                dp[i+1][j] = (dp[i+1][j] + MOD) % MOD;
            }
        }
        printf("%d\n",dp[N][m]);
    }

    return 0;
}

Submission Info

Submission Time
Task D - 注文の多い高橋商店
User grun1396
Language C++14 (GCC 5.4.1)
Score 10
Code Size 1118 Byte
Status WA
Exec Time 8 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:17:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d",&N,&M,&q);
                               ^
./Main.cpp:24:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     rep(i,N)  scanf("%d", &a[i]);
                                 ^
./Main.cpp:31:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d",&k,&x);
                             ^

Judge Result

Set Name Sample Subtask1 Subtask2 Subtask3 Subtask4
Score / Max Score 0 / 0 10 / 10 0 / 20 0 / 50 0 / 20
Status
AC × 2
AC × 10
AC × 10
WA × 3
AC × 10
WA × 3
AC × 10
WA × 13
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 256 KB
sample_02.txt AC 1 ms 256 KB
subtask1_01.txt AC 1 ms 256 KB
subtask1_02.txt AC 1 ms 256 KB
subtask1_03.txt AC 1 ms 256 KB
subtask1_04.txt AC 1 ms 256 KB
subtask1_05.txt AC 6 ms 256 KB
subtask1_06.txt AC 4 ms 256 KB
subtask1_07.txt AC 8 ms 256 KB
subtask1_08.txt AC 2 ms 256 KB
subtask2_01.txt WA 1 ms 256 KB
subtask2_02.txt WA 1 ms 256 KB
subtask2_03.txt WA 1 ms 256 KB
subtask3_01.txt WA 1 ms 256 KB
subtask3_02.txt WA 1 ms 256 KB
subtask3_03.txt WA 1 ms 256 KB
subtask4_01.txt WA 1 ms 256 KB
subtask4_02.txt WA 1 ms 256 KB
subtask4_03.txt WA 1 ms 256 KB
subtask4_04.txt WA 1 ms 256 KB
subtask4_05.txt WA 1 ms 256 KB
subtask4_06.txt WA 1 ms 256 KB
subtask4_07.txt WA 1 ms 256 KB