Submission #286428
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define all(c) (c).begin(),(c).end() #define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--) #define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++) #define rep(i,n) REP(i,0,n) #define iter(c) __typeof((c).begin()) #define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++) #define pb(a) push_back(a) #define pr(a) cout<<(a)<<endl #define PR(a,b) cout<<(a)<<" "<<(b)<<endl #define F first #define S second #define ll long long bool check(int n,int m,int x,int y){return (x<0||x>=n||y<0||y>=m)?false:true;} const ll MAX=1000000007,MAXL=1LL<<60,dx[4]={-1,0,1,0},dy[4]={0,-1,0,1}; typedef pair<int,int> P; int main() { int n,k; cin >> n >> k; if(n/2>=k) pr("YES"); else pr("NO"); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 閉路グラフ |
User | s1200008 |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 767 Byte |
Status | AC |
Exec Time | 25 ms |
Memory | 924 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
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 | 796 KB |
subtask0_sample_02.txt | AC | 21 ms | 796 KB |
subtask0_sample_03.txt | AC | 21 ms | 800 KB |
subtask0_sample_04.txt | AC | 21 ms | 676 KB |
subtask1_01.txt | AC | 22 ms | 916 KB |
subtask1_02.txt | AC | 21 ms | 796 KB |
subtask1_03.txt | AC | 22 ms | 800 KB |
subtask1_04.txt | AC | 25 ms | 924 KB |
subtask1_05.txt | AC | 24 ms | 800 KB |
subtask1_06.txt | AC | 23 ms | 796 KB |
subtask1_07.txt | AC | 24 ms | 796 KB |
subtask1_08.txt | AC | 23 ms | 800 KB |
subtask1_09.txt | AC | 22 ms | 672 KB |
subtask1_10.txt | AC | 21 ms | 792 KB |
subtask1_11.txt | AC | 22 ms | 800 KB |
subtask1_12.txt | AC | 22 ms | 796 KB |
subtask1_13.txt | AC | 21 ms | 796 KB |
subtask1_14.txt | AC | 24 ms | 720 KB |
subtask1_15.txt | AC | 23 ms | 800 KB |
subtask1_16.txt | AC | 24 ms | 800 KB |
subtask1_17.txt | AC | 22 ms | 736 KB |
subtask1_18.txt | AC | 22 ms | 672 KB |
subtask1_19.txt | AC | 21 ms | 796 KB |
subtask1_20.txt | AC | 21 ms | 796 KB |
subtask1_21.txt | AC | 23 ms | 804 KB |
subtask1_22.txt | AC | 21 ms | 672 KB |
subtask1_23.txt | AC | 21 ms | 804 KB |
subtask1_24.txt | AC | 22 ms | 796 KB |
subtask1_25.txt | AC | 23 ms | 744 KB |
subtask1_26.txt | AC | 21 ms | 800 KB |