Submission #1678439


Source Code Expand

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<cstring>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>
#include<iterator>

#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define rep(i,n) for(int i=0; i<n; i++)
#define FOR(i,a,n) for(int i=a; i<n; i++)

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, char> plc;
typedef pair<string, string> pss;

int n;
int ng1, ng2, ng3;
bool dp[310];

bool search(int x) {
	if (x != ng1 && x != ng2 && x != ng3)
		return true;
	return false;
}

int main()
{
	cin >> n;
	cin >> ng1 >> ng2 >> ng3;

	if (n == ng1 || n == ng2 || n == ng3) {
		cout << "NO" << endl;
		return 0;
	}

	dp[n] = true;
	int cnt = 0;
	for (int i = n; i >= 0; i--) {
		if (dp[i]) {
			if (i - 1 >= 0 && search(i-1)) dp[i - 1] = true;
			if (i - 2 >= 0 && search(i- 2)) dp[i - 2] = true;
			if (i- 3 >= 0 && search(i - 3)) dp[i - 3] = true;
		}
		cnt++;
		if (cnt >= 100)break;
	}
	
	if (dp[0])cout << "YES" << endl;
	else cout << "NO" << endl;
	return 0;
}

Submission Info

Submission Time
Task C - 123引き算
User jj
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1258 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name All
Score / Max Score 0 / 100
Status
AC × 19
WA × 12
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 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