Submission #1588917
Source Code Expand
#include <iostream> #include <algorithm> #include <cstdio> #include <cmath> #include <string> #include <cctype> #include <stack> #include <queue> #include <vector> #include <cstdlib> #include <list> #include <cmath> #include <map> #include <utility> #include <numeric> #include <set> #include <map> #define REP(i, n) for(int i = 0;i < n;i++) #define REPR(i, n) for(int i = n;i >= 0;i--) #define FOR(i, m, n) for(int i = m;i < n;i++) #define _USE_MATH_DEFINES using namespace std; using ll = long long; using P = pair<int, int>; const ll INF = 999999999; const ll atcoder = 1000000007; const int dx[4] = { 1 , 0 , -1 ,0 }; const int dy[4] = { 0 , 1 , 0 , -1 }; int main() { int n; int ng1, ng2, ng3; int a[310] = { 0 }; cin >> n >> ng1 >> ng2 >> ng3; a[n] = 1; a[ng1] = a[ng2] = a[ng3] = 2; a[0] = 3; if (n == ng1 || ng2 || ng3) { cout << "NO" << endl; } else { for (int i = 1; i <= 100; i++) { if (a[n - 3] != 2 && n - 3 >= 0) { a[n - 3] = 1; n -= 3; } else if (a[n - 2] != 2 && n - 2 >= 0) { a[n - 2] = 1; n -= 2; } else if (a[n - 1] != 2 && n - 1 >= 0) { a[n - 1] = 1; n -= 1; } } if (a[0] == 1)cout << "YES" << endl; else cout << "NO" << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 123引き算 |
User | tkkt0001 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1306 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 | WA | 1 ms | 256 KB |
sample_02.txt | WA | 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 | WA | 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 | WA | 1 ms | 256 KB |