Submission #286431
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef signed long long ll; #undef _P #define _P(...) (void)printf(__VA_ARGS__) #define FOR(x,to) for(x=0;x<to;x++) #define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++) #define ALL(a) (a.begin()),(a.end()) #define ZERO(a) memset(a,0,sizeof(a)) #define MINUS(a) memset(a,0xff,sizeof(a)) //------------------------------------------------------- int N,K; void solve() { int i,j,k,l,r,x,y; string s; cin>>N>>K; if(K<=N/2) _P("YES\n"); else _P("NO\n"); } int main(int argc,char** argv){ string s;int i; if(argc==1) ios::sync_with_stdio(false); FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin); solve(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - 閉路グラフ |
User | kmjp |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 754 Byte |
Status | AC |
Exec Time | 27 ms |
Memory | 932 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 | 23 ms | 924 KB |
subtask0_sample_02.txt | AC | 22 ms | 732 KB |
subtask0_sample_03.txt | AC | 24 ms | 924 KB |
subtask0_sample_04.txt | AC | 23 ms | 732 KB |
subtask1_01.txt | AC | 24 ms | 792 KB |
subtask1_02.txt | AC | 21 ms | 800 KB |
subtask1_03.txt | AC | 23 ms | 916 KB |
subtask1_04.txt | AC | 24 ms | 928 KB |
subtask1_05.txt | AC | 23 ms | 932 KB |
subtask1_06.txt | AC | 21 ms | 924 KB |
subtask1_07.txt | AC | 23 ms | 928 KB |
subtask1_08.txt | AC | 23 ms | 836 KB |
subtask1_09.txt | AC | 21 ms | 792 KB |
subtask1_10.txt | AC | 22 ms | 928 KB |
subtask1_11.txt | AC | 22 ms | 932 KB |
subtask1_12.txt | AC | 22 ms | 924 KB |
subtask1_13.txt | AC | 27 ms | 928 KB |
subtask1_14.txt | AC | 24 ms | 928 KB |
subtask1_15.txt | AC | 27 ms | 760 KB |
subtask1_16.txt | AC | 27 ms | 924 KB |
subtask1_17.txt | AC | 23 ms | 928 KB |
subtask1_18.txt | AC | 22 ms | 924 KB |
subtask1_19.txt | AC | 23 ms | 740 KB |
subtask1_20.txt | AC | 25 ms | 800 KB |
subtask1_21.txt | AC | 22 ms | 808 KB |
subtask1_22.txt | AC | 23 ms | 788 KB |
subtask1_23.txt | AC | 21 ms | 924 KB |
subtask1_24.txt | AC | 21 ms | 796 KB |
subtask1_25.txt | AC | 23 ms | 924 KB |
subtask1_26.txt | AC | 26 ms | 776 KB |