Submission #286425


Source Code Expand

#include<bits/stdc++.h>
using namespace std;

#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)

#define ll long long
#define ull unsigned ll

void reader(int *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(ll *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x=(*x)*10+k-'0';}if(m)(*x)=-(*x);}
int reader(char c[]){int i,s=0;for(;;){mygc(i);if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF) break;}c[s++]=i;for(;;){mygc(i);if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF) break;c[s++]=i;}c[s]='\0';return s;}
template <class T, class S> void reader(T *x, S *y){reader(x);reader(y);}
template <class T, class S, class U> void reader(T *x, S *y, U *z){reader(x);reader(y);reader(z);}
template <class T, class S, class U, class V> void reader(T *x, S *y, U *z, V *w){reader(x);reader(y);reader(z);reader(w);}

void writer(int x, char c){int s=0,m=0;char f[10];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(ll x, char c){int s=0,m=0;char f[20];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc(c);}
void writer(const char c[]){int i;for(i=0;c[i]!='\0';i++)mypc(c[i]);}
void writer(const char x[], char c){int i;for(i=0;x[i]!='\0';i++)mypc(x[i]);mypc(c);}
template<class T> void writerLn(T x){writer(x,'\n');}
template<class T, class S> void writerLn(T x, S y){writer(x,' ');writer(y,'\n');}
template<class T, class S, class U> void writerLn(T x, S y, U z){writer(x,' ');writer(y,' ');writer(z,'\n');}
template<class T> void writerArr(T x[], int n){int i;if(!n){mypc('\n');return;}rep(i,n-1)writer(x[i],' ');writer(x[n-1],'\n');}

int N, K;

int main(){
  int i, j, k;

  reader(&N,&K);
  writerLn(K<=N/2?"YES":"NO");

  return 0;
}

Submission Info

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