Submission #286535


Source Code Expand

Copy
#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <algorithm>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <cstring>
#include <cstdlib>

using namespace std;

#define pb push_back
#define mp make_pair
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define REP(i,j,k) for(int i=j;i<(int)(k);++i)
#define foreach(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();++i)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
typedef long long ll;
// const int INF = 1 << 29;
// const double EPS = 1e-9;


int n,k;

int main(){
    cin >> n >> k;

    cout << (n>=k*2?"YES":"NO") << endl;
    return 0;
}

Submission Info

Submission Time
Task A - 閉路グラフ
User kei
Language C++11 (GCC 4.8.1)
Score 100
Code Size 837 Byte
Status AC
Exec Time 24 ms
Memory 804 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 4
AC × 30
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 796 KB
subtask0_sample_02.txt AC 23 ms 676 KB
subtask0_sample_03.txt AC 24 ms 796 KB
subtask0_sample_04.txt AC 22 ms 672 KB
subtask1_01.txt AC 23 ms 748 KB
subtask1_02.txt AC 22 ms 796 KB
subtask1_03.txt AC 23 ms 672 KB
subtask1_04.txt AC 22 ms 796 KB
subtask1_05.txt AC 21 ms 676 KB
subtask1_06.txt AC 22 ms 732 KB
subtask1_07.txt AC 21 ms 792 KB
subtask1_08.txt AC 22 ms 672 KB
subtask1_09.txt AC 23 ms 676 KB
subtask1_10.txt AC 23 ms 796 KB
subtask1_11.txt AC 22 ms 800 KB
subtask1_12.txt AC 24 ms 800 KB
subtask1_13.txt AC 21 ms 800 KB
subtask1_14.txt AC 21 ms 672 KB
subtask1_15.txt AC 23 ms 800 KB
subtask1_16.txt AC 24 ms 772 KB
subtask1_17.txt AC 22 ms 700 KB
subtask1_18.txt AC 22 ms 672 KB
subtask1_19.txt AC 23 ms 668 KB
subtask1_20.txt AC 23 ms 800 KB
subtask1_21.txt AC 24 ms 796 KB
subtask1_22.txt AC 23 ms 804 KB
subtask1_23.txt AC 22 ms 788 KB
subtask1_24.txt AC 22 ms 672 KB
subtask1_25.txt AC 21 ms 672 KB
subtask1_26.txt AC 21 ms 752 KB