Submission #1605320


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
static const int INF = 2000000000;
static const int NIL = -1;

#define MAX 300

int main(){
    int n,ng1,ng2,ng3;
    scanf("%d %d %d %d",&n,&ng1,&ng2,&ng3);
    if(n==ng1 || n==ng2 || n==ng3){
        printf("NO\n");
        return 0;
    }
    int dp[MAX+1];
    for(int i=0;i<=n;i++) dp[i] = INF;
    dp[n] = 0;
    for(int i=n;i>=0;i--){
        for(int j=1;j<=3;j++){
            if(i-j==ng1 || i-j==ng2 || i-j==ng3) continue;
            dp[i-j] = min(dp[i-j],dp[i]+1);
        }
    }

    if(dp[0]<=100) printf("YES\n");
    else printf("NO\n");
}

Submission Info

Submission Time
Task C - 123引き算
User r67pr
Language C++14 (GCC 5.4.1)
Score 100
Code Size 628 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:10:43: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d %d",&n,&ng1,&ng2,&ng3);
                                           ^

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 31
Set Name Test Cases
All sample_01.txt, sample_02.txt, sample_03.txt, test_143_142_141_140.txt, test_1_1_2_3.txt, test_1_2_3_4.txt, test_200_200_2_3.txt, test_231_77_78_80.txt, test_235_124_126_125.txt, test_253_45_47_48.txt, test_297_223_224_225.txt, test_297_294_292_290.txt, test_297_297_30_83.txt, test_297_3_43_72.txt, test_298_125_123_124.txt, test_298_293_295_291.txt, test_298_298_4_8.txt, test_298_36_72_98.txt, test_298_55_3_43.txt, test_298_92_91_295.txt, test_299_200_151_65.txt, test_299_240_35_154.txt, test_299_300_299_298.txt, test_299_33_242_151.txt, test_299_56_57_58.txt, test_299_66_132_198.txt, test_300_271_44_68.txt, test_300_299_298_296.txt, test_300_30_99_183.txt, test_300_4_5_6.txt, test_84_34_64_36.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
test_143_142_141_140.txt AC 1 ms 256 KB
test_1_1_2_3.txt AC 1 ms 256 KB
test_1_2_3_4.txt AC 1 ms 256 KB
test_200_200_2_3.txt AC 1 ms 256 KB
test_231_77_78_80.txt AC 1 ms 256 KB
test_235_124_126_125.txt AC 1 ms 256 KB
test_253_45_47_48.txt AC 1 ms 256 KB
test_297_223_224_225.txt AC 1 ms 256 KB
test_297_294_292_290.txt AC 1 ms 256 KB
test_297_297_30_83.txt AC 1 ms 256 KB
test_297_3_43_72.txt AC 1 ms 256 KB
test_298_125_123_124.txt AC 1 ms 256 KB
test_298_293_295_291.txt AC 1 ms 256 KB
test_298_298_4_8.txt AC 1 ms 256 KB
test_298_36_72_98.txt AC 1 ms 256 KB
test_298_55_3_43.txt AC 1 ms 256 KB
test_298_92_91_295.txt AC 1 ms 256 KB
test_299_200_151_65.txt AC 1 ms 256 KB
test_299_240_35_154.txt AC 1 ms 256 KB
test_299_300_299_298.txt AC 1 ms 256 KB
test_299_33_242_151.txt AC 1 ms 256 KB
test_299_56_57_58.txt AC 1 ms 256 KB
test_299_66_132_198.txt AC 1 ms 256 KB
test_300_271_44_68.txt AC 1 ms 256 KB
test_300_299_298_296.txt AC 1 ms 256 KB
test_300_30_99_183.txt AC 1 ms 256 KB
test_300_4_5_6.txt AC 1 ms 256 KB
test_84_34_64_36.txt AC 1 ms 256 KB