Submission #1420672
Source Code Expand
#include <iostream> #include <cstdio> #include <cmath> #include <algorithm> #include <string> #include <map> #include <bitset> #include <vector> #include <queue> typedef long long ll; #define FOR(i,a,b) for(ll i = (a); i < (b); i++ ) #define REP(i, n) FOR(i,0,n) #define fi first #define se second const ll mod = 1000000007; // 123456789 using namespace std; /////////////////////////////////////////////// // // /////////////////////////////////////////////// //////////////////////////////////////////////// //////////////////////////////////////////////// int dp[310]; int N; int NG[3]; int ans = 0; int jdg = 1; queue< int >q; int idx; int main(){ cin>>N; REP( i, 3 ){ scanf("%d", NG+i); if( N == NG[i] ) jdg = 0; } if( jdg ){ fill(dp, dp+310, 1123); dp[N] = 0; q.push( N ); while( !q.empty() ){ idx = q.front(); q.pop(); FOR(i, 1, 4){ jdg = 1; REP(j, 3) if( idx-i == NG[j] ) jdg = 0; if( idx-i < 0 )jdg = 0; if( dp[idx-i] > dp[idx]+1 && jdg ){ dp[idx-i] = dp[idx]+1; q.push( idx-i ); } } if( dp[0] <= 100 ){ ans = 1; break; } } } if( ans ) puts("YES"); else{ puts("NO");} return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 123引き算 |
User | Ice_in_juice |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1310 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:45:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", NG+i); ^
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
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 |