Submission #286585
Source Code Expand
#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> #include <fstream> #include <queue> #define INF 100000000 #define EPS 1e-9 using namespace std; typedef long long ll; int main(){ int n, k; cin >> n; cin >> k; if (n % 2 == k%2 && n >= k) cout << "YES" << endl; else cout << "NO" << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 閉路グラフ |
User | taketake0609 |
Language | C++ (G++ 4.6.4) |
Score | 0 |
Code Size | 698 Byte |
Status | WA |
Exec Time | 25 ms |
Memory | 920 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||||
Status |
|
|
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 | 676 KB |
subtask0_sample_02.txt | AC | 21 ms | 796 KB |
subtask0_sample_03.txt | AC | 21 ms | 800 KB |
subtask0_sample_04.txt | AC | 21 ms | 740 KB |
subtask1_01.txt | AC | 23 ms | 672 KB |
subtask1_02.txt | AC | 22 ms | 796 KB |
subtask1_03.txt | WA | 25 ms | 868 KB |
subtask1_04.txt | WA | 23 ms | 672 KB |
subtask1_05.txt | AC | 22 ms | 800 KB |
subtask1_06.txt | AC | 22 ms | 800 KB |
subtask1_07.txt | WA | 22 ms | 800 KB |
subtask1_08.txt | AC | 23 ms | 804 KB |
subtask1_09.txt | WA | 21 ms | 920 KB |
subtask1_10.txt | WA | 24 ms | 796 KB |
subtask1_11.txt | AC | 23 ms | 800 KB |
subtask1_12.txt | WA | 23 ms | 796 KB |
subtask1_13.txt | AC | 21 ms | 800 KB |
subtask1_14.txt | WA | 22 ms | 796 KB |
subtask1_15.txt | AC | 23 ms | 792 KB |
subtask1_16.txt | WA | 23 ms | 916 KB |
subtask1_17.txt | AC | 21 ms | 804 KB |
subtask1_18.txt | AC | 23 ms | 804 KB |
subtask1_19.txt | AC | 23 ms | 796 KB |
subtask1_20.txt | WA | 21 ms | 756 KB |
subtask1_21.txt | AC | 25 ms | 760 KB |
subtask1_22.txt | AC | 23 ms | 788 KB |
subtask1_23.txt | AC | 23 ms | 792 KB |
subtask1_24.txt | WA | 23 ms | 800 KB |
subtask1_25.txt | WA | 23 ms | 800 KB |
subtask1_26.txt | AC | 21 ms | 804 KB |