Submission #286723


Source Code Expand

#include <iostream>
#include <iomanip>
#include <math.h>
#include <map>
#include <list>
#include <set>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <string>
#include <sstream>
// #include <limits.h>

#define INTMAX  99999999

#define DEBUG 0

#if DEBUG
#define DOUT cout
#else
#define DOUT 0 && cout
#endif

using namespace std;

typedef long long				ll;
typedef long long				Int64;
typedef unsigned long long		UInt64;
typedef int						Int32;
typedef unsigned int			UInt32;
typedef short int				Int16;
typedef unsigned short int		UInt16;
typedef char					Int8;
typedef unsigned char			UInt8;

int main(int argc, char *argv[])
{
	ios::sync_with_stdio(false);

	int n, k;
	cin >> n >> k;

	// int edgeNum = n;
	if(k>n) {
		cout << "NO" << endl;
	}
	else {
		if(k%2 == n%2) {
			cout << "YES" << endl;
		}
		else {
			cout << "NO" << endl;
		}
	}

	return 0;
}

Submission Info

Submission Time
Task A - 閉路グラフ
User creatorstree
Language C++ (G++ 4.6.4)
Score 0
Code Size 955 Byte
Status WA
Exec Time 27 ms
Memory 932 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
AC × 4
AC × 19
WA × 11
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 24 ms 812 KB
subtask0_sample_02.txt AC 21 ms 804 KB
subtask0_sample_03.txt AC 22 ms 808 KB
subtask0_sample_04.txt AC 22 ms 884 KB
subtask1_01.txt AC 26 ms 804 KB
subtask1_02.txt AC 22 ms 920 KB
subtask1_03.txt WA 23 ms 808 KB
subtask1_04.txt WA 23 ms 924 KB
subtask1_05.txt AC 22 ms 928 KB
subtask1_06.txt AC 22 ms 932 KB
subtask1_07.txt WA 22 ms 800 KB
subtask1_08.txt AC 23 ms 924 KB
subtask1_09.txt WA 21 ms 928 KB
subtask1_10.txt WA 23 ms 928 KB
subtask1_11.txt AC 22 ms 912 KB
subtask1_12.txt WA 23 ms 808 KB
subtask1_13.txt AC 23 ms 808 KB
subtask1_14.txt WA 22 ms 928 KB
subtask1_15.txt AC 27 ms 928 KB
subtask1_16.txt WA 21 ms 928 KB
subtask1_17.txt AC 22 ms 928 KB
subtask1_18.txt AC 22 ms 932 KB
subtask1_19.txt AC 22 ms 836 KB
subtask1_20.txt WA 21 ms 800 KB
subtask1_21.txt AC 23 ms 804 KB
subtask1_22.txt AC 23 ms 796 KB
subtask1_23.txt AC 22 ms 924 KB
subtask1_24.txt WA 22 ms 844 KB
subtask1_25.txt WA 22 ms 808 KB
subtask1_26.txt AC 23 ms 748 KB