Submission #286451


Source Code Expand

Copy
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <bitset>
//#include <ctime>
//#include <utility>
//#include <memory>
//#include <functional>
//#include <deque>
//#include <cctype>
//#include <numeric>
//#include <list>
//#include <iomanip>

#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <unordered_set>
#include <unordered_map>
#include <forward_list>

#define cauto const auto&
#else

#endif

using namespace std;


namespace{
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}


#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define F first
#define S second
#define mkp make_pair
#define RALL(v) (v).rbegin(),(v).rend()


#define MOD 1000000007LL
#define EPS 1e-8
static const int INF=1<<24;

void mainmain(){
	ll n,m;
	cin>>n>>m;
	n/=2;
	if(n>=m) cout<<"YES\n";
	else cout<<"NO\n";
	
}



}
main() try{
    mainmain();
}
catch(...){
}

Submission Info

Submission Time
Task A - 閉路グラフ
User j_gui0121
Language C++11 (GCC 4.8.1)
Score 100
Code Size 1787 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 21 ms 736 KB
subtask0_sample_02.txt AC 23 ms 676 KB
subtask0_sample_03.txt AC 22 ms 800 KB
subtask0_sample_04.txt AC 21 ms 804 KB
subtask1_01.txt AC 21 ms 796 KB
subtask1_02.txt AC 21 ms 792 KB
subtask1_03.txt AC 23 ms 776 KB
subtask1_04.txt AC 21 ms 804 KB
subtask1_05.txt AC 24 ms 804 KB
subtask1_06.txt AC 21 ms 680 KB
subtask1_07.txt AC 22 ms 792 KB
subtask1_08.txt AC 23 ms 784 KB
subtask1_09.txt AC 22 ms 672 KB
subtask1_10.txt AC 22 ms 800 KB
subtask1_11.txt AC 23 ms 804 KB
subtask1_12.txt AC 23 ms 672 KB
subtask1_13.txt AC 21 ms 800 KB
subtask1_14.txt AC 22 ms 796 KB
subtask1_15.txt AC 21 ms 800 KB
subtask1_16.txt AC 21 ms 800 KB
subtask1_17.txt AC 22 ms 796 KB
subtask1_18.txt AC 20 ms 796 KB
subtask1_19.txt AC 21 ms 792 KB
subtask1_20.txt AC 24 ms 780 KB
subtask1_21.txt AC 21 ms 792 KB
subtask1_22.txt AC 22 ms 756 KB
subtask1_23.txt AC 21 ms 800 KB
subtask1_24.txt AC 21 ms 676 KB
subtask1_25.txt AC 22 ms 792 KB
subtask1_26.txt AC 23 ms 800 KB