結果
問題 | No.2247 01 ZigZag |
ユーザー |
![]() |
提出日時 | 2023-03-17 21:57:02 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 11 ms / 2,000 ms |
コード長 | 4,705 bytes |
コンパイル時間 | 2,084 ms |
コンパイル使用メモリ | 199,472 KB |
最終ジャッジ日時 | 2025-02-11 13:02:17 |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 50 |
ソースコード
#define MOD_TYPE 2#include <bits/stdc++.h>using namespace std;#if 1#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#endif#if 0#include <ext/pb_ds/assoc_container.hpp>#include <ext/pb_ds/tag_and_trait.hpp>#include <ext/pb_ds/tree_policy.hpp>#include <ext/rope>using namespace __gnu_pbds;using namespace __gnu_cxx;template <typename T>using extset =tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;#endif#if 0#include <boost/multiprecision/cpp_dec_float.hpp>#include <boost/multiprecision/cpp_int.hpp>using Int = boost::multiprecision::cpp_int;using lld = boost::multiprecision::cpp_dec_float_100;#endif#pragma region Macrosusing ll = long long int;using ld = long double;using pii = pair<int, int>;using pll = pair<ll, ll>;using pld = pair<ld, ld>;template <typename T>using smaller_queue = priority_queue<T, vector<T>, greater<T>>;constexpr ll MOD = (MOD_TYPE == 1 ? (ll)(1e9 + 7) : 998244353);constexpr int INF = (int)1e9 + 10;constexpr ll LINF = (ll)4e18;const double PI = acos(-1.0);constexpr double EPS = 1e-11;constexpr int Dx[] = {0, 0, -1, 1, -1, 1, -1, 1, 0};constexpr int Dy[] = {1, -1, 0, 0, -1, -1, 1, 1, 0};#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)#define rep(i, n) REP(i, 0, n)#define REPI(i, m, n) for (int i = m; i < (int)(n); ++i)#define repi(i, n) REPI(i, 0, n)#define YES(n) cout << ((n) ? "YES" : "NO") << "\n"#define Yes(n) cout << ((n) ? "Yes" : "No") << "\n"#define all(v) v.begin(), v.end()#define NP(v) next_permutation(all(v))#define dbg(x) cerr << #x << ":" << x << "\n";#define UNIQUE(v) v.erase(unique(all(v)), v.end())struct io_init {io_init() {cin.tie(nullptr);ios::sync_with_stdio(false);cout << setprecision(30) << setiosflags(ios::fixed);};} io_init;template <typename T>inline bool chmin(T &a, T b) {if (a > b) {a = b;return true;}return false;}template <typename T>inline bool chmax(T &a, T b) {if (a < b) {a = b;return true;}return false;}inline ll floor(ll a, ll b) {if (b < 0) a *= -1, b *= -1;if (a >= 0) return a / b;return -((-a + b - 1) / b);}inline ll ceil(ll a, ll b) { return floor(a + b - 1, b); }template <typename A, size_t N, typename T>inline void Fill(A (&array)[N], const T &val) {fill((T *)array, (T *)(array + N), val);}template <typename T>vector<T> compress(vector<T> &v) {vector<T> val = v;sort(all(val)), val.erase(unique(all(val)), val.end());for (auto &&vi : v) vi = lower_bound(all(val), vi) - val.begin();return val;}template <typename T, typename U>constexpr istream &operator>>(istream &is, pair<T, U> &p) noexcept {is >> p.first >> p.second;return is;}template <typename T, typename U>constexpr ostream &operator<<(ostream &os, pair<T, U> p) noexcept {os << p.first << " " << p.second;return os;}template <typename T>constexpr istream &operator>>(istream &is, vector<T> &v) noexcept {for (int i = 0; i < v.size(); i++) is >> v[i];return is;}template <typename T>constexpr ostream &operator<<(ostream &os, vector<T> &v) noexcept {for (int i = 0; i < v.size(); i++)os << v[i] << (i + 1 == v.size() ? "" : " ");return os;}template <typename T>constexpr void operator--(vector<T> &v, int) noexcept {for (int i = 0; i < v.size(); i++) v[i]--;}random_device seed_gen;mt19937_64 engine(seed_gen());#pragma endregion// --------------------------------------void _010(int n, int m, int k) {rep(_, n - (k - 2) / 2 - 1) cout << 0;rep(_, (k - 2) / 2) cout << "10";rep(_, m - (k - 2) / 2) cout << 1;cout << 0;cout << "\n";}void _0101(int n, int m, int k) {rep(_, n - (k - 1) / 2) cout << 0;rep(_, (k - 1) / 2) cout << "10";rep(_, m - (k - 1) / 2) cout << 1;cout << "\n";}void _101(int n, int m, int k) {rep(_, k / 2) cout << "10";rep(_, m - k / 2) cout << 1;cout << "\n";}void solve() {int n, m, k;cin >> n >> m >> k;if (n == 0) {if (k == 0) {rep(_, m) cout << 1;cout << "\n";} else {cout << -1 << "\n";}return;} else if (m == 0) {if (k == 0) {rep(_, n) cout << 0;cout << "\n";} else {cout << -1 << "\n";}return;}int Max;if (n < m)Max = n * 2;else if (n > m)Max = m * 2;elseMax = n * 2 - 1;if (k == 0 or k > Max) {cout << -1 << "\n";return;}if (n < m) {if (k == n * 2)_101(n, m, k);else if (k % 2 == 0)_010(n, m, k);else_0101(n, m, k);} else if (k % 2 == 0)_010(n, m, k);else_0101(n, m, k);}int main() { solve(); }