Submission #286435


Source Code Expand

Copy
#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<numeric>
#include<functional>
#include<complex>
#include<cassert>

using namespace std;
#define BET(a,b,c) ((a)<=(b)&&(b)<(c))
#define FOR(i,n) for(int i=0,i##_end=(int(n));i<i##_end;i++)
#define SZ(x) (int)(x.size())
#define ALL(x) (x).begin(),(x).end()
#define MP make_pair
#define CLS(x,val) memset((x) , val , sizeof(x)) 
#define FOR_EACH(it,v) for(__typeof(v.begin()) it=v.begin(),it_end=v.end() ; it != it_end ; it++)
typedef long long ll_t;
typedef long double ld_t;
typedef vector<int> VI;
typedef vector<VI> VVI;

typedef complex<int> xy;

int main()
{
    int n,k;
    cin>>n>>k;
    // 3 -> 1
    // 4 -> 2
    // 5 -> 2
    // 6 -> 3
    puts(k <= n / 2 ? "YES" : "NO");
    return 0;
}

Submission Info

Submission Time
Task A - 閉路グラフ
User EmK
Language C++11 (GCC 4.8.1)
Score 100
Code Size 953 Byte
Status AC
Exec Time 23 ms
Memory 888 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 800 KB
subtask0_sample_02.txt AC 22 ms 748 KB
subtask0_sample_03.txt AC 23 ms 792 KB
subtask0_sample_04.txt AC 22 ms 804 KB
subtask1_01.txt AC 23 ms 796 KB
subtask1_02.txt AC 22 ms 808 KB
subtask1_03.txt AC 22 ms 800 KB
subtask1_04.txt AC 21 ms 676 KB
subtask1_05.txt AC 21 ms 800 KB
subtask1_06.txt AC 22 ms 792 KB
subtask1_07.txt AC 22 ms 732 KB
subtask1_08.txt AC 22 ms 800 KB
subtask1_09.txt AC 21 ms 796 KB
subtask1_10.txt AC 23 ms 796 KB
subtask1_11.txt AC 22 ms 796 KB
subtask1_12.txt AC 23 ms 744 KB
subtask1_13.txt AC 21 ms 792 KB
subtask1_14.txt AC 23 ms 804 KB
subtask1_15.txt AC 23 ms 888 KB
subtask1_16.txt AC 22 ms 800 KB
subtask1_17.txt AC 21 ms 804 KB
subtask1_18.txt AC 23 ms 800 KB
subtask1_19.txt AC 21 ms 744 KB
subtask1_20.txt AC 21 ms 800 KB
subtask1_21.txt AC 21 ms 800 KB
subtask1_22.txt AC 23 ms 736 KB
subtask1_23.txt AC 21 ms 804 KB
subtask1_24.txt AC 21 ms 668 KB
subtask1_25.txt AC 22 ms 804 KB
subtask1_26.txt AC 22 ms 676 KB