Submission #286421


Source Code Expand

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <complex>
#include <string>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
using namespace std;
typedef pair<int,int> P;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define SORT(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
#define EQ(a,b) (abs((a)-(b))<eps)
int main()
{
	int a,b;
	string s;
	cin >> a >> b;
	//cin >> s;
	if(a>=b*2)cout << "YES" << endl;
	else cout << "NO" << endl;
	return 0;
}

Submission Info

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