Submission #188228
Source Code Expand
//include //------------------------------------------ #include <vector> #include <list> #include <map> #include <set> #include <deque> #include <stack> #include <bitset> #include <algorithm> #include <functional> #include <numeric> #include <utility> #include <sstream> #include <iostream> #include <iomanip> #include <cstdio> #include <cmath> #include <cstdlib> #include <cctype> #include <string> #include <cstring> #include <ctime> using namespace std; //conversion //------------------------------------------ inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;} template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();} //math //------------------------------------------- template<class T> inline T sqr(T x) {return x*x;} //typedef //------------------------------------------ typedef vector<int> VI; typedef vector<VI> VVI; typedef vector<string> VS; typedef pair<int, int> PII; typedef long long LL; //container util //------------------------------------------ #define ALL(a) (a).begin(),(a).end() #define RALL(a) (a).rbegin(), (a).rend() #define PB push_back #define MP make_pair #define SZ(a) int((a).size()) #define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i) #define EXIST(s,e) ((s).find(e)!=(s).end()) #define SORT(c) sort((c).begin(),(c).end()) //repetition //------------------------------------------ #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) //constant //-------------------------------------------- const double EPS = 1e-10; const double PI = acos(-1.0); //clear memory #define CLR(a) memset((a), 0 ,sizeof(a)) //debug #define dump(x) cerr << #x << " = " << (x) << endl; #define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl; int main(int argc, char const *argv[]) { int n, m[3] = {3, 2, 1}; VI ng(3); cin >> n; REP(b, 3) cin >> ng[b]; int retry = 3; bool flag = false; for(int t = 100; t > 0; t--){ for(int i = 0; 3 > i; i++){ int temp = n - m[i]; if(!(find(ng.begin(), ng.end(), temp) != ng.end()) && temp >= 0){ n -= m[i]; break; } } if(n == 0) break; } if(n == 0) cout << "YES" << endl; else cout << "NO" << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 123引き算 |
User | xyz |
Language | C++ (G++ 4.6.4) |
Score | 0 |
Code Size | 2364 Byte |
Status | WA |
Exec Time | 27 ms |
Memory | 1052 KB |
Judge Result
Set Name | All | ||||
---|---|---|---|---|---|
Score / Max Score | 0 / 100 | ||||
Status |
|
Set Name | Test Cases |
---|---|
All | 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 | 23 ms | 1044 KB |
sample_02.txt | AC | 24 ms | 1040 KB |
sample_03.txt | AC | 24 ms | 948 KB |
test_143_142_141_140.txt | AC | 24 ms | 952 KB |
test_1_1_2_3.txt | WA | 24 ms | 860 KB |
test_1_2_3_4.txt | AC | 23 ms | 948 KB |
test_200_200_2_3.txt | WA | 23 ms | 948 KB |
test_231_77_78_80.txt | AC | 27 ms | 1044 KB |
test_235_124_126_125.txt | AC | 23 ms | 948 KB |
test_253_45_47_48.txt | AC | 24 ms | 948 KB |
test_297_223_224_225.txt | AC | 23 ms | 868 KB |
test_297_294_292_290.txt | AC | 24 ms | 952 KB |
test_297_297_30_83.txt | WA | 27 ms | 1052 KB |
test_297_3_43_72.txt | AC | 23 ms | 988 KB |
test_298_125_123_124.txt | AC | 23 ms | 1048 KB |
test_298_293_295_291.txt | AC | 24 ms | 932 KB |
test_298_298_4_8.txt | WA | 24 ms | 948 KB |
test_298_36_72_98.txt | AC | 24 ms | 984 KB |
test_298_55_3_43.txt | AC | 24 ms | 1048 KB |
test_298_92_91_295.txt | AC | 24 ms | 856 KB |
test_299_200_151_65.txt | AC | 24 ms | 952 KB |
test_299_240_35_154.txt | AC | 24 ms | 860 KB |
test_299_300_299_298.txt | WA | 24 ms | 952 KB |
test_299_33_242_151.txt | AC | 24 ms | 952 KB |
test_299_56_57_58.txt | AC | 25 ms | 860 KB |
test_299_66_132_198.txt | AC | 25 ms | 1044 KB |
test_300_271_44_68.txt | AC | 24 ms | 952 KB |
test_300_299_298_296.txt | AC | 24 ms | 980 KB |
test_300_30_99_183.txt | AC | 24 ms | 932 KB |
test_300_4_5_6.txt | AC | 24 ms | 948 KB |
test_84_34_64_36.txt | AC | 24 ms | 952 KB |