Submission #286429
Source Code Expand
#include <iostream> #include <string> #include <cstdio> #include <vector> #include <algorithm> #include <functional> #include <map> #include <set> using namespace std; typedef long long i64; typedef int int_t; typedef vector<int_t> vi; typedef vector<vi> vvi; typedef pair<int_t, int_t> pi; #define tr(c, i) for(typeof((c).begin()) i = (c).begin(); i < (c).end(); i++) #define pb push_back #define sz(a) int((a).size()) #define all(c) (c).begin(), (c).end() #define REP(s, e, i) for(i=(s); i < (e); ++i) int main(int argc, char *argv[]) { i64 n, k; cin >> n >> k; if(n / 2 >= k) { cout << "YES" << endl; } else { cout << "NO" << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 閉路グラフ |
User | nakari_1124 |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 713 Byte |
Status | AC |
Exec Time | 26 ms |
Memory | 924 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 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 | 23 ms | 800 KB |
subtask0_sample_02.txt | AC | 22 ms | 744 KB |
subtask0_sample_03.txt | AC | 24 ms | 800 KB |
subtask0_sample_04.txt | AC | 22 ms | 672 KB |
subtask1_01.txt | AC | 22 ms | 672 KB |
subtask1_02.txt | AC | 23 ms | 796 KB |
subtask1_03.txt | AC | 21 ms | 800 KB |
subtask1_04.txt | AC | 21 ms | 796 KB |
subtask1_05.txt | AC | 22 ms | 800 KB |
subtask1_06.txt | AC | 21 ms | 676 KB |
subtask1_07.txt | AC | 21 ms | 668 KB |
subtask1_08.txt | AC | 23 ms | 796 KB |
subtask1_09.txt | AC | 22 ms | 796 KB |
subtask1_10.txt | AC | 22 ms | 924 KB |
subtask1_11.txt | AC | 23 ms | 796 KB |
subtask1_12.txt | AC | 26 ms | 780 KB |
subtask1_13.txt | AC | 23 ms | 920 KB |
subtask1_14.txt | AC | 22 ms | 800 KB |
subtask1_15.txt | AC | 22 ms | 800 KB |
subtask1_16.txt | AC | 21 ms | 796 KB |
subtask1_17.txt | AC | 21 ms | 668 KB |
subtask1_18.txt | AC | 22 ms | 796 KB |
subtask1_19.txt | AC | 22 ms | 804 KB |
subtask1_20.txt | AC | 22 ms | 792 KB |
subtask1_21.txt | AC | 21 ms | 676 KB |
subtask1_22.txt | AC | 22 ms | 804 KB |
subtask1_23.txt | AC | 21 ms | 844 KB |
subtask1_24.txt | AC | 23 ms | 920 KB |
subtask1_25.txt | AC | 21 ms | 800 KB |
subtask1_26.txt | AC | 21 ms | 800 KB |