#850345 (C++17) No.2247 01 ZigZag

提出ソース

結果

問題	No.2247 01 ZigZag
ユーザー	jabee
提出日時	2023-03-17 22:05:34
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	5,063 bytes
コンパイル時間	4,238 ms
コンパイル使用メモリ	267,228 KB
実行使用メモリ	19,084 KB
最終ジャッジ日時	2024-09-18 11:06:47
合計ジャッジ時間	6,844 ms
ジャッジサーバーID （参考情報）	judge3 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	25 ms 18,944 KB
testcase_01	AC	24 ms 18,920 KB
testcase_02	AC	24 ms 18,904 KB
testcase_03	AC	25 ms 19,044 KB
testcase_04	AC	25 ms 18,960 KB
testcase_05	AC	26 ms 18,944 KB
testcase_06	AC	27 ms 18,936 KB
testcase_07	AC	26 ms 18,908 KB
testcase_08	AC	26 ms 18,944 KB
testcase_09	AC	27 ms 18,940 KB
testcase_10	AC	25 ms 18,944 KB
testcase_11	AC	26 ms 18,904 KB
testcase_12	AC	29 ms 18,944 KB
testcase_13	AC	26 ms 18,920 KB
testcase_14	AC	24 ms 18,904 KB
testcase_15	AC	26 ms 18,944 KB
testcase_16	AC	28 ms 18,944 KB
testcase_17	AC	26 ms 18,944 KB
testcase_18	AC	26 ms 18,920 KB
testcase_19	AC	26 ms 18,944 KB
testcase_20	AC	25 ms 18,944 KB
testcase_21	AC	25 ms 18,944 KB
testcase_22	AC	28 ms 18,932 KB
testcase_23	AC	27 ms 18,940 KB
testcase_24	AC	26 ms 18,932 KB
testcase_25	AC	26 ms 18,944 KB
testcase_26	AC	27 ms 19,044 KB
testcase_27	AC	28 ms 18,896 KB
testcase_28	AC	27 ms 18,944 KB
testcase_29	AC	27 ms 18,940 KB
testcase_30	AC	28 ms 18,944 KB
testcase_31	AC	24 ms 18,880 KB
testcase_32	WA	-
testcase_33	WA	-
testcase_34	WA	-
testcase_35	WA	-
testcase_36	WA	-
testcase_37	AC	26 ms 18,944 KB
testcase_38	WA	-
testcase_39	WA	-
testcase_40	WA	-
testcase_41	AC	28 ms 18,944 KB
testcase_42	AC	28 ms 18,944 KB
testcase_43	AC	26 ms 18,944 KB
testcase_44	AC	25 ms 18,924 KB
testcase_45	AC	28 ms 18,976 KB
testcase_46	AC	29 ms 19,064 KB
testcase_47	AC	25 ms 19,004 KB
testcase_48	AC	25 ms 18,896 KB
testcase_49	AC	25 ms 18,944 KB
testcase_50	AC	25 ms 18,944 KB
testcase_51	AC	25 ms 18,920 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include<bits/stdc++.h>
#include <math.h>
#include <algorithm>
#include <iostream>
#include <vector>
#include <atcoder/all>
#include <atcoder/dsu>
#include <atcoder/segtree>
#include <atcoder/lazysegtree>
#include <atcoder/modint>
#include <atcoder/scc>
#include <chrono>
#include <random>
#include <cassert>
#ifndef templete
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()

//#include<boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
using namespace std;
using namespace atcoder;
//using atmint = modint998244353;
using atmint = modint;
using Graph = vector<vector<int>>;
using P = pair<long long,long long>;
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }

//---------------------------------------------------------------------------------------------------

template<int MOD> struct ModInt {
    static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
    ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    int get() const { return (int)x; }
    ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
    ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
    ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
    ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
    ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
    ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
    ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;
        while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
        return ModInt(u); }
    bool operator==(ModInt that) const { return x == that.x; }
    bool operator!=(ModInt that) const { return x != that.x; }
    ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
    ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }
template<typename T, int FAC_MAX> struct Comb { vector<T> fac, ifac;
    Comb(){fac.resize(FAC_MAX,1);ifac.resize(FAC_MAX,1);rep(i,1,FAC_MAX)fac[i]=fac[i-1]*i;
        ifac[FAC_MAX-1]=T(1)/fac[FAC_MAX-1];rrep(i,FAC_MAX-2,1)ifac[i]=ifac[i+1]*T(i+1);}
    T aPb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b]; }
    T aCb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b] * ifac[b]; }
    T nHk(int n, int k) { if (n == 0 && k == 0) return T(1); if (n <= 0 || k < 0) return 0;
        return aCb(n + k - 1, k); } // nHk = (n+k-1)Ck : n is separator
    T pairCombination(int n) {if(n%2==1)return T(0);return fac[n]*ifac[n/2]/(T(2)^(n/2));}
    // combination of paris for n com.aCb(h+w-2,h-1);
}; 
//typedef ModInt<1000000007> mint;
typedef ModInt<998244353> mint; 
//typedef ModInt<1000000000> mint; 
Comb<mint, 2010101> com;
//vector dp(n+1,vector(n+1,vector<ll>(n+1,0)));
//vector dp(n+1,vector<ll>(n+1,0));
  std::random_device seed_gen;
  std::mt19937 engine(seed_gen());
string ye = "Yes"; string no = "No"; string draw = "Draw";

#endif // templete
//---------------------------------------------------------------------------------------------------
void solve(ll n, ll nm, ll m){
    rep(i,0,n)cout << "0";
    rep(i,0,nm)cout << "01";
    rep(i,0,m)cout << "1";
    //cout << endl;
    return;    
}
void _main() {
  ll n,m,k;
  cin >> n >> m >> k;
  if(n == 0){
    if(k == 0){
        solve(0,0,m);
        return;
    }else{
        cout << -1 << endl;
        return;
    }
  }
  if(m == 0){
    if(k == 0){
        solve(n,0,0);
        return;
    }else{
        cout << -1 << endl;
        return;
    }
  }

  if(k == 0){
    cout << -1 << endl;
    return;    
  }


  if(k + 1 + n - k + m - k == n + m){
   
  }

  ll nowk = 1;
  ll nm = 1;
  n--; m--;
  while(nowk < k){
    nowk+=2;
    n--;
    m--;
    nm++;
  }
 // cout << n << " " << nm << " " << m << " " << nowk << endl;
  if(nowk > k){
    nowk--;
    nm--;
    n++;
    m++;
    if(n >= 1 && m >= 0){
        solve(n-1,nm,m);
        solve(1,0,0);
        return;
    }
  }
  
  
  if(n < 0 || m < 0 || nowk != k){
    cout << -1 << endl;
    return;
  }else solve(n,nm,m);
  
}

yukicoder

結果

テストケース

ソースコード