結果

問題 No.1052 電子機器X
ユーザー ningenMeningenMe
提出日時 2020-05-15 22:22:59
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 332 ms / 1,000 ms
コード長 4,186 bytes
コンパイル時間 1,965 ms
コンパイル使用メモリ 201,608 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-09-19 11:09:56
合計ジャッジ時間 5,054 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 1 ms
5,376 KB
testcase_02 AC 1 ms
5,376 KB
testcase_03 AC 61 ms
5,376 KB
testcase_04 AC 108 ms
5,376 KB
testcase_05 AC 106 ms
5,376 KB
testcase_06 AC 243 ms
5,376 KB
testcase_07 AC 41 ms
5,376 KB
testcase_08 AC 305 ms
5,376 KB
testcase_09 AC 332 ms
5,376 KB
testcase_10 AC 169 ms
5,376 KB
testcase_11 AC 222 ms
5,376 KB
testcase_12 AC 309 ms
5,376 KB
testcase_13 AC 219 ms
5,376 KB
testcase_14 AC 44 ms
5,376 KB
testcase_15 AC 28 ms
5,376 KB
testcase_16 AC 178 ms
5,376 KB
testcase_17 AC 119 ms
5,376 KB
testcase_18 AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;

constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433L;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

int main() {
    ll N,K,X,ans = 0; cin >> N >> K;
    corner(N==1, 1);
    if(N%2==0) {
        if(K%2==0) {
            ans++;
            X = 1;
            for(ll i = 0; i < K; i += 2) {
                X += 2;
                if(X > N) break;
                ans++;
            }
            X = N+1;
            for(ll i = 0; i < K; i += 2) {
                X -= 2;
                if(X < 1) break;
                ans++;
            }
            chmin(ans,N/2);
        }
        else {
            ans+=2;
            K--;
            X = 2;
            for(ll i = 0; i < K; i += 2) {
                X += 2;
                if(X > N) break;
                ans++;
            }
            X = N;
            for(ll i = 0; i < K; i += 2) {
                X -= 2;
                if(X < 1) break;
                ans++;
            }
            chmin(ans,N/2);
        }
    }
    else {
        if(K%2==0) {
            ans++;
            X = 1;
            for(ll i = 0; i < K; i += 2) {
                X += 2;
                if(X > N) break;
                ans++;
            }
            X = N+1;
            for(ll i = 0; i < K; i += 2) {
                X -= 2;
                if(X < 1) break;
                ans++;
            }
        }
        else {
            ans+=2;
            K--;
            X = 2;
            for(ll i = 0; i < K; i += 2) {
                X += 2;
                if(X > N) break;
                ans++;
            }
            X = N;
            for(ll i = 0; i < K; i += 2) {
                X -= 2;
                if(X < 1) break;
                ans++;
            }
        }
    }
    cout << ans << endl;
    return 0;
}
0