結果
問題 | No.2247 01 ZigZag |
ユーザー |
|
提出日時 | 2023-03-18 01:49:17 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 46 ms / 2,000 ms |
コード長 | 3,374 bytes |
コンパイル時間 | 1,861 ms |
コンパイル使用メモリ | 202,580 KB |
最終ジャッジ日時 | 2025-02-11 14:46:06 |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 50 |
ソースコード
# include <bits/stdc++.h>using namespace std;using LL = long long;using ULL = unsigned long long;const double PI = acos(-1);template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }template<class T>constexpr T HINF() { return INF<T>() / 2; }template <typename T_char>T_char TL(T_char cX) { return tolower(cX); }template <typename T_char>T_char TU(T_char cX) { return toupper(cX); }template<class T> bool chmin(T& a,T b) { if(a > b){a = b; return true;} return false; }template<class T> bool chmax(T& a,T b) { if(a < b){a = b; return true;} return false; }template<class T> bool is_sqare(T a) { if(floor(sqrt(a)) * floor(sqrt(a)) == a){ return true; }return false; }int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }int d_sum(LL n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }int d_cnt(LL n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }template<class T> using dijk = priority_queue<T, vector<T>, greater<T>>;# define ALL(qpqpq) (qpqpq).begin(),(qpqpq).end()# define UNIQUE(wpwpw) sort(ALL((wpwpw)));(wpwpw).erase(unique(ALL((wpwpw))),(wpwpw).end())# define LOWER(epepe) transform(ALL((epepe)),(epepe).begin(),TL<char>)# define UPPER(rprpr) transform(ALL((rprpr)),(rprpr).begin(),TU<char>)# define REP(i,upupu) for(LL i = 0, i##_len = (upupu);(i) < (i##_len);(i)++)# define REPS(i,opopo) for(LL i = 1, i##_len = (opopo);(i) <= (i##_len);(i)++)# define len(x) ((int)(x).size())# define BIT(n) (1LL << (n))# define pb push_back#ifdef LOCAL# include "_debug_print.hpp"# define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)#else# define debug(...) (static_cast<void>(0))#endifstruct INIT{INIT(){std::ios::sync_with_stdio(false);std::cin.tie(0);cout << fixed << setprecision(20);}}INIT;void solve(){int n, m, k;cin >> n >> m >> k;if(n == 0 || m == 0){if(k == 0){cout << (m == 0 ? string(n, '0') : string(m, '1')) << endl;}else{cout << -1 << endl;}return;}if(k == 0){cout << -1 << endl;return;}string ans = "2";if(n >= k / 2 + 1 && m >= (k + 1) / 2){int n_sub = k / 2 + 1;int m_sub = (k + 1) / 2;vector<string> zeros(n_sub), ones(m_sub);REP(i, n_sub)zeros[i] = '0';REP(i, n - n_sub)zeros[0] += '0';REP(i, m_sub)ones[i] = '1';REP(i, m - m_sub)ones[m_sub - 1] += '1';string tmp = "";REP(i, k + 1){tmp += (i % 2 == 0 ? zeros : ones)[i / 2];}chmin(ans, tmp);}if(n >= (k + 1) / 2 && m >= k / 2 + 1){int n_sub = (k + 1) / 2;int m_sub = k / 2 + 1;vector<string> zeros(n_sub), ones(m_sub);REP(i, n_sub)zeros[i] = '0';REP(i, n - n_sub)zeros[0] += '0';REP(i, m_sub)ones[i] = '1';REP(i, m - m_sub)ones[m_sub - 1] += '1';string tmp = "";REP(i, k + 1){tmp += (i % 2 == 0 ? ones : zeros)[i / 2];}chmin(ans, tmp);}if(ans == "2")ans = "-1";cout << ans << endl;}int main(){int t = 1;//cin >> t;while(t--)solve();}