Submission #1589943
Source Code Expand
//ABC 011 C #include "bits/stdc++.h" #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 FORR(i, m, n) for(int i = (m);i >= (n);i--) #define SORT(v, n) sort(v, v+n); #define VSORT(v) sort(v.begin(), v.end()); #define ll long long #define pb(a) push_back(a) #define ALL(obj) (obj).begin(),(obj).end() using namespace std; const int INF = 1145141919; const ll LINF = 1145141919810; typedef pair<int, int> P; typedef pair<ll, ll> LP; signed main() { std::ios::sync_with_stdio(false); std::cin.tie(0); int n, ng1, ng2, ng3; cin >> n >> ng1 >> ng2 >> ng3; if (n == ng1 || n == ng2 || n == ng3) { cout << "NO" << '\n'; } REP(i, 100) { if (ng1 == n-3 || ng2 == n-3 || ng3 == n - 3) { if (ng1 == n - 2 || ng2 == n - 2 || ng3 == n - 2) { if (ng1 == n - 1 || ng2 == n - 1 || ng3 == n - 1) { cout << "NO" << '\n'; return 0; } else n -= 1; } else n -= 2; } else n -= 3; if (n <= 0) { cout << "YES" << '\n'; return 0; } } cout << "NO" << '\n'; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 123引き算 |
User | DoubleZ |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1160 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 | AC | 1 ms | 256 KB |
test_1_1_2_3.txt | WA | 1 ms | 256 KB |
test_1_2_3_4.txt | AC | 1 ms | 256 KB |
test_200_200_2_3.txt | WA | 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 | WA | 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 | WA | 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 | WA | 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 |