Submission #286452


Source Code Expand

Copy
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<string>
#include<stack>
#include<cstdio>
#include<cmath>
using namespace std;

typedef long long LL;
typedef long double LD;
typedef pair<int,int> P;
typedef pair<int,P> P1;

#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define rep(i,x) for(int i=0;i<x;i++)
#define rep1(i,x) for(int i=1;i<=x;i++)
#define rrep(i,x) for(int i=x-1;i>=0;i--)
#define rrep1(i,x) for(int i=x;i>0;i--)
#define sor(v) sort(v.begin(),v.end())
#define rev(s) reverse(s.begin(),s.end())
#define lb(vec,a) lower_bound(vec.begin(),vec.end(),a)
#define ub(vec,a) upper_bound(vec.begin(),vec.end(),a)
#define uniq(vec) vec.erase(unique(vec.begin(),vec.end()),vec.end())
#define min_3(a,b,c) min(a,min(b,c))
#define max_3(a,b,c) max(a,max(b,c))
#define mp1(a,b,c) P1(a,P(b,c))
#define pque(a) priority_queue<a>
#define rpque(a) priority_queue<a,vector<a>,greater<a>>

const int INF=1000000000;
const int dre_4[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
const int dre_8[8][2]={{1,0},{1,1},{0,1},{-1,1},{-1,0},{-1,-1},{0,-1},{1,-1}};
const int kaijou[10]={1,1,2,6,24,120,720,5040,40320,362880};

int main(){
	int n,k;
	cin >> n >> k;
	
	if(2 * k <= n)puts("YES");
	else puts("NO");
}

Submission Info

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