Submission #286614


Source Code Expand

Copy
#include <iostream>
#include <stdio.h>
#include <istream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <cstdio>
#include <queue>
#include <unordered_set>
#include <unordered_map>
#include <complex>
#include <iomanip>


using namespace std;

typedef long long int ll;
typedef unsigned long long ull;
typedef pair<int,int> pi;
typedef pair<long, long> pl;
typedef pair<double, double> pd;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<pd> vpd;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vii;
typedef vector<vl> vll;
typedef vector<double> vec;
typedef vector<vec> mat;
typedef map<int, int> mii;
void dumppi(const pi &p) {  cout << p.first  << ' ' << p.second << endl; }
typedef pair<long, long> pl;
void dumppl(const pl &p) { cout << p.first << ' ' << p.second << endl; }
typedef vector<pi> vpi;
void dumpvpi(const vpi &vec) { for (auto v : vec) { cout << '(' << v.first << ',' << v.second << ')' << ' '; } cout << endl; }
typedef vector<bool> vb;
void dumpvb(const vb &vec) { for (auto b : vec) { cout << b << ' '; } cout << endl; }
typedef vector<int> vi;
void dumpvi(const vi &vec) { for (auto i : vec) { cout << i << ' '; } cout << endl; }
typedef vector<pl> vpl;
void dumpvpi(const vpl &vec) { for (auto v : vec) { cout << '(' << v.first << ',' << v.second << ')' << ' '; } cout << endl; }
typedef vector<vi> vii;
void dumpvii(const vii &mat) {for (auto vec : mat) {for (auto v : vec){cout << v << ' ';} cout << endl;}}



#define  debu 0


int main(int argc, const char * argv[])
{
    int a, b;
    cin >> a >> b;
    if (a / 2 >= b) {
        cout << "YES" << endl;
    } else {
        cout << "NO" << endl;
    }
   
}

Submission Info

Submission Time
Task A - 閉路グラフ
User nida_001
Language C++11 (GCC 4.8.1)
Score 100
Code Size 1827 Byte
Status AC
Exec Time 25 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 804 KB
subtask0_sample_02.txt AC 23 ms 800 KB
subtask0_sample_03.txt AC 23 ms 796 KB
subtask0_sample_04.txt AC 21 ms 676 KB
subtask1_01.txt AC 21 ms 792 KB
subtask1_02.txt AC 22 ms 676 KB
subtask1_03.txt AC 23 ms 804 KB
subtask1_04.txt AC 23 ms 800 KB
subtask1_05.txt AC 22 ms 796 KB
subtask1_06.txt AC 23 ms 920 KB
subtask1_07.txt AC 21 ms 864 KB
subtask1_08.txt AC 22 ms 800 KB
subtask1_09.txt AC 22 ms 672 KB
subtask1_10.txt AC 24 ms 800 KB
subtask1_11.txt AC 22 ms 668 KB
subtask1_12.txt AC 22 ms 796 KB
subtask1_13.txt AC 21 ms 676 KB
subtask1_14.txt AC 23 ms 804 KB
subtask1_15.txt AC 21 ms 800 KB
subtask1_16.txt AC 22 ms 668 KB
subtask1_17.txt AC 21 ms 796 KB
subtask1_18.txt AC 22 ms 804 KB
subtask1_19.txt AC 25 ms 920 KB
subtask1_20.txt AC 22 ms 800 KB
subtask1_21.txt AC 21 ms 744 KB
subtask1_22.txt AC 22 ms 672 KB
subtask1_23.txt AC 23 ms 676 KB
subtask1_24.txt AC 21 ms 796 KB
subtask1_25.txt AC 21 ms 800 KB
subtask1_26.txt AC 21 ms 920 KB