Submission #187768
Source Code Expand
//include----------------------------------------------------------------------------------------------------------------------
#include <bits/stdc++.h>
//using namespace--------------------------------------------------------------------------------------------------------------
using namespace std;
//define-----------------------------------------------------------------------------------------------------------------------
#define rep(i, n) for(int i = 0; i < (int)n; i++)
#define FOR(i, s, n) for(int i = s; i < (int)n; i++)
#define per(i, n) for(int i = n; i >= 0; i--)
#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define EACH(i, n) for (__typeof((n).begin()) i = (n).begin(); i != (n).end(); ++i)
#define SZ(a) int((a).size())
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define INF 1 << 25
#define CLR(a) memset((a), 0 ,sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << "\n";
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << "\n";
#define sq(n) (n) * (n)
//typedef----------------------------------------------------------------------------------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef unsigned int uint;
typedef unsigned long long ull;
//const------------------------------------------------------------------------------------------------------------------------
const double EPS = 1e-10;
const double PI = acos( -1.0 );
//global-----------------------------------------------------------------------------------------------------------------------
int n, ar[3];
bool dp[ 301 ];
string str;
//function---------------------------------------------------------------------------------------------------------------------
bool solve( int k, int i ) {
if ( k == 0 ) {
return true;
}
if ( !dp[ k ] ) {
return false;
}
if ( i == 100 || k < 0 ) {
return false;
}
rep( j, 3 ) {
if ( ar[ j ] == k ) {
return false;
}
}
rep ( j, 3 ) {
if ( solve( k - (3 - j), i + 1 ) ) {
return true;
}
}
return dp[ k ] = false;
}
int main() {
scanf( "%d", &n );
rep( i, n + 1 ) {
dp[ i ] = true;
}
rep( i, 3 ) {
scanf( "%d", &ar[ i ] );
}
if ( solve( n, 0 ) ) {
printf( "YES\n" );
}
else {
printf( "NO\n" );
}
return 0;
}
Submission Info
Submission Time
2014-06-21 21:53:17+0900
Task
C - 123引き算
User
stone725
Language
C++ (G++ 4.6.4)
Score
100
Code Size
2675 Byte
Status
AC
Exec Time
23 ms
Memory
924 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:69:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:74:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
Judge Result
Set Name
All
Score / Max Score
100 / 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
20 ms
920 KB
sample_02.txt
AC
21 ms
800 KB
sample_03.txt
AC
20 ms
804 KB
test_143_142_141_140.txt
AC
20 ms
800 KB
test_1_1_2_3.txt
AC
21 ms
676 KB
test_1_2_3_4.txt
AC
21 ms
800 KB
test_200_200_2_3.txt
AC
21 ms
796 KB
test_231_77_78_80.txt
AC
21 ms
800 KB
test_235_124_126_125.txt
AC
21 ms
920 KB
test_253_45_47_48.txt
AC
21 ms
804 KB
test_297_223_224_225.txt
AC
20 ms
796 KB
test_297_294_292_290.txt
AC
20 ms
796 KB
test_297_297_30_83.txt
AC
21 ms
804 KB
test_297_3_43_72.txt
AC
21 ms
744 KB
test_298_125_123_124.txt
AC
21 ms
800 KB
test_298_293_295_291.txt
AC
20 ms
676 KB
test_298_298_4_8.txt
AC
19 ms
924 KB
test_298_36_72_98.txt
AC
21 ms
804 KB
test_298_55_3_43.txt
AC
21 ms
804 KB
test_298_92_91_295.txt
AC
19 ms
672 KB
test_299_200_151_65.txt
AC
21 ms
804 KB
test_299_240_35_154.txt
AC
21 ms
800 KB
test_299_300_299_298.txt
AC
20 ms
800 KB
test_299_33_242_151.txt
AC
21 ms
800 KB
test_299_56_57_58.txt
AC
21 ms
796 KB
test_299_66_132_198.txt
AC
20 ms
804 KB
test_300_271_44_68.txt
AC
20 ms
672 KB
test_300_299_298_296.txt
AC
23 ms
780 KB
test_300_30_99_183.txt
AC
23 ms
780 KB
test_300_4_5_6.txt
AC
21 ms
800 KB
test_84_34_64_36.txt
AC
22 ms
796 KB