Submission #286489


Source Code Expand

Copy
#include <stdlib.h>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#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;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define CLR(a) memset((a), 0 ,sizeof(a))
#define REP(i,n) for(int i = 0; i < (int)(n); ++i)
#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())

//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();}

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;


int main(){
	int n,k;
	cin>>n>>k;
	n--;
	while(n-2>k)n-=2;
	if(n==k+1)cout<<"YES"<<endl;
	else cout<<"NO"<<endl;
	
	return 0;
}

Submission Info

Submission Time
Task A - 閉路グラフ
User blue0620
Language C++ (G++ 4.6.4)
Score 0
Code Size 1451 Byte
Status WA
Exec Time 23 ms
Memory 924 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 4
AC × 22
WA × 8
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt
All subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt
Case Name Status Exec Time Memory
subtask0_sample_01.txt AC 21 ms 796 KB
subtask0_sample_02.txt AC 23 ms 676 KB
subtask0_sample_03.txt AC 22 ms 796 KB
subtask0_sample_04.txt AC 23 ms 924 KB
subtask1_01.txt AC 23 ms 800 KB
subtask1_02.txt AC 21 ms 792 KB
subtask1_03.txt AC 22 ms 800 KB
subtask1_04.txt WA 22 ms 920 KB
subtask1_05.txt AC 21 ms 672 KB
subtask1_06.txt AC 20 ms 796 KB
subtask1_07.txt AC 22 ms 676 KB
subtask1_08.txt AC 21 ms 920 KB
subtask1_09.txt WA 20 ms 800 KB
subtask1_10.txt WA 22 ms 924 KB
subtask1_11.txt AC 22 ms 792 KB
subtask1_12.txt AC 21 ms 800 KB
subtask1_13.txt AC 20 ms 796 KB
subtask1_14.txt WA 21 ms 804 KB
subtask1_15.txt AC 22 ms 800 KB
subtask1_16.txt WA 22 ms 800 KB
subtask1_17.txt AC 21 ms 804 KB
subtask1_18.txt AC 21 ms 804 KB
subtask1_19.txt AC 21 ms 784 KB
subtask1_20.txt WA 22 ms 792 KB
subtask1_21.txt AC 22 ms 800 KB
subtask1_22.txt AC 22 ms 668 KB
subtask1_23.txt AC 21 ms 788 KB
subtask1_24.txt WA 23 ms 804 KB
subtask1_25.txt WA 22 ms 796 KB
subtask1_26.txt AC 23 ms 800 KB