Submission #286418


Source Code Expand

Copy
#include<vector>
#include<cmath>
#include<map>
#include<cstdlib>
#include<iostream>
#include<sstream>
#include<fstream>
#include<string>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<set>
#include<stack>
#include<bitset>
#include<functional>
#include<ctime>
#include<queue>
#include<deque>
#include<complex>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long lint;
typedef complex<double> P;
#define mp make_pair
#define fi first
#define se second
typedef pair<int,int> pint;
#define All(s) s.begin(),s.end()
#define rAll(s) s.rbegin(),s.rend()
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
int main()
{
	int n,k;
	cin>>n;cin>>k;
	if(k*2<=n) cout<<"YES"<<endl;else cout<<"NO"<<endl;
}

Submission Info

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