Submission #4632517
Source Code Expand
#include<bits/stdc++.h> using namespace std; #define rep(i,n) for(signed i=0;i<n;++i) #define repi(n) rep(i,n) #define int long long #define str string #define vint vector<int> #define pint pair<int,int> #define pb(a) push_back(a) #define all(v) v.begin(),v.end() #define yn(b) cout<<((b)?"Yes":"No")<<endl #define YN(b) cout<<((b)?"YES":"NO")<<endl #define call(a) for(auto t:a)cout<<t<<" ";cout<<endl #define ENDL printf("\n"); #define debg(a) cout<<#a<<":"<<a<<endl; #define SORT(a) sort(all(a)); #define INF 1LL<<60 #define inf INF #define out(i) cout<<i<<endl; #define allSum(a) accumulate(a.begin(),a.end(),0) int min(int a,int b){if(a>b)return b;return a;} int max(int a,int b){if(a>b)return a;return b;} signed main(){ int n,ng[3]; cin>>n>>ng[0]>>ng[1]>>ng[2]; sort(ng,ng+3); bool a=n==ng[0]||n==ng[1]||n==ng[2]; bool b=ng[0]==ng[1]&&ng[1]==ng[2]; if(a||b){ cout<<"NO"<<endl; return 0; } vint dp(n); rep(i,n)dp[i]=INF; dp[n-1]=0; for(int i=n-1;i>=0;--i){ rep(j,3)if(i==ng[j])continue; rep(j,3){ if(i-j<0)continue; dp[i-j]=min(dp[i]+1,dp[i-j]); } } YN(dp[0]<=100); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 123引き算 |
User | ate |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1199 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | All | ||||
---|---|---|---|---|---|
Score / Max Score | 0 / 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 | WA | 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 | WA | 1 ms | 256 KB |
test_235_124_126_125.txt | AC | 1 ms | 256 KB |
test_253_45_47_48.txt | WA | 1 ms | 256 KB |
test_297_223_224_225.txt | AC | 1 ms | 256 KB |
test_297_294_292_290.txt | WA | 1 ms | 256 KB |
test_297_297_30_83.txt | AC | 1 ms | 256 KB |
test_297_3_43_72.txt | WA | 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 | WA | 1 ms | 256 KB |
test_298_55_3_43.txt | WA | 1 ms | 256 KB |
test_298_92_91_295.txt | WA | 1 ms | 256 KB |
test_299_200_151_65.txt | WA | 1 ms | 256 KB |
test_299_240_35_154.txt | WA | 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 | WA | 1 ms | 256 KB |
test_300_271_44_68.txt | WA | 1 ms | 256 KB |
test_300_299_298_296.txt | WA | 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 |