結果
| 問題 | No.2247 01 ZigZag |
| ユーザー |
 SnowBeenDiding
|
| 提出日時 | 2023-03-17 21:48:43 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 7,046 bytes |
| コンパイル時間 | 5,287 ms |
| コンパイル使用メモリ | 311,748 KB |
| 実行使用メモリ | 5,376 KB |
| 最終ジャッジ日時 | 2024-09-18 10:38:51 |
| 合計ジャッジ時間 | 6,043 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 43 WA * 7 |
ソースコード
#include <atcoder/all>using namespace atcoder;using mint = modint998244353;const long long MOD = 998244353;// using mint = modint1000000007;// const long long MOD = 1000000007;// using mint = modint;//mint::set_mod(MOD);#include <bits/stdc++.h>#define rep(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)#define repeq(i, a, b) for (ll i = (ll)(a); i <= (ll)(b); i++)#define repreq(i, a, b) for (ll i = (ll)(a); i >= (ll)(b); i--)#define endl '\n' // fflush(stdout);#define cYes cout << "Yes" << endl#define cNo cout << "No" << endl#define sortr(v) sort(v, greater<>())#define pb push_back#define pob pop_back#define mp make_pair#define mt make_tuple#define FI first#define SE second#define ALL(v) (v).begin(), (v).end()#define INFLL 3000000000000000100LL#define INF 1000000100#define PI acos(-1.0L)#define TAU (PI * 2.0L)using namespace std;typedef long long ll;typedef pair<ll, ll> Pll;typedef tuple<ll, ll, ll> Tlll;typedef vector<int> Vi;typedef vector<Vi> VVi;typedef vector<ll> Vl;typedef vector<Vl> VVl;typedef vector<VVl> VVVl;typedef vector<Tlll> VTlll;typedef vector<mint> Vm;typedef vector<Vm> VVm;typedef vector<string> Vs;typedef vector<double> Vd;typedef vector<char> Vc;typedef vector<bool> Vb;typedef vector<Pll> VPll;typedef priority_queue<ll> PQl;typedef priority_queue<ll, vector<ll>, greater<ll>> PQlr;/* inout */ostream &operator<<(ostream &os, mint const &m) {os << m.val();return os;}template <typename T>ostream &operator<<(ostream &os, const vector<T> &v) {int n = v.size();rep(i, 0, n) { os << v[i] << " \n"[i == n - 1]; }return os;}template <typename T>ostream &operator<<(ostream &os, const vector<vector<T>> &v) {int n = v.size();rep(i, 0, n) os << v[i];return os;}template <typename T, typename S>ostream &operator<<(ostream &os, pair<T, S> const &p) {os << p.first << ' ' << p.second;return os;}template <typename T, typename S>ostream &operator<<(ostream &os, const map<T, S> &mp) {for (auto &[key, val] : mp) {os << key << ':' << val << '\n';}return os;}template <typename T>ostream &operator<<(ostream &os, const set<T> &st) {auto itr = st.begin();for (int i = 0; i < (int)st.size(); i++) {os << *itr << (i + 1 != (int)st.size() ? ' ' : '\n');itr++;}return os;}template <typename T>ostream &operator<<(ostream &os, multiset<T> &st) {auto itr = st.begin();for (int i = 0; i < (int)st.size(); i++) {os << *itr << (i + 1 != (int)st.size() ? ' ' : '\n');itr++;}return os;}template <typename T>ostream &operator<<(ostream &os, queue<T> q) {while (q.size()) {os << q.front();q.pop();os << " \n"[q.empty()];}return os;}template <typename T>ostream &operator<<(ostream &os, stack<T> st) {vector<T> v;while (st.size()) {v.push_back(st.top());st.pop();}reverse(ALL(v));os << v;return os;}template <class T, class Container, class Compare>ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq) {vector<T> v;while (pq.size()) {v.push_back(pq.top());pq.pop();}os << v;return os;}template <typename T>istream &operator>>(istream &is, vector<T> &v) {for (T &in : v) is >> in;return is;}template <typename T1, typename T2>istream &operator>>(istream &is, pair<T1, T2> &p) {is >> p.first >> p.second;return is;}/* useful */template <typename T>int SMALLER(vector<T> &a, T x) {return lower_bound(a.begin(), a.end(), x) - a.begin();}template <typename T>int orSMALLER(vector<T> &a, T x) {return upper_bound(a.begin(), a.end(), x) - a.begin();}template <typename T>int BIGGER(vector<T> &a, T x) {return a.size() - orSMALLER(a, x);}template <typename T>int orBIGGER(vector<T> &a, T x) {return a.size() - SMALLER(a, x);}template <typename T>int COUNT(vector<T> &a, T x) {return upper_bound(ALL(a), x) - lower_bound(ALL(a), x);}template <typename T, typename S>bool chmax(T &a, S b) {if (a < b) {a = b;return 1;}return 0;}template <typename T, typename S>bool chmin(T &a, S b) {if (a > b) {a = b;return 1;}return 0;}template <typename T>void press(T &v) {v.erase(unique(ALL(v)), v.end());}template <typename T>vector<int> zip(vector<T> b) {pair<T, int> p[b.size() + 10];int a = b.size();vector<int> l(a);for (int i = 0; i < a; i++) p[i] = mp(b[i], i);sort(p, p + a);int w = 0;for (int i = 0; i < a; i++) {if (i && p[i].first != p[i - 1].first) w++;l[p[i].second] = w;}return l;}template <typename T>vector<T> vis(vector<T> &v) {vector<T> S(v.size() + 1);rep(i, 1, S.size()) S[i] += v[i - 1] + S[i - 1];return S;}ll dem(ll a, ll b) { return ((a + b - 1) / (b)); }ll dtoll(double d, int g) { return round(d * pow(10, g)); }string tobin(ll n, ll d) {string ret;rep(i, 0, d) {ret += (n % 2) ? '1' : '0';n /= 2;}reverse(ALL(ret));return ret;}const double EPS = 1e-10;void init() {cin.tie(0);cout.tie(0);ios::sync_with_stdio(0);cout << fixed << setprecision(12);}// do {} while (next_permutation(ALL(vec)));/********************************** START **********************************/void sol();int main() {init();int q = 1;// cin >> q;while (q--) sol();return 0;}/********************************** SOLVE **********************************/void sol() {ll n, m, k;cin >> n >> m >> k;int inin = n, inim = m;if (n == 0) {if (k == 0) {string s(m, '1');cout << s << endl;} else {cout << -1 << endl;}return;}if (m == 0) {if (k == 0) {string s(n, '0');cout << s << endl;} else {cout << -1 << endl;}return;}int inik = k;string s;rep(i, 0, n) s += '0';rep(i, 0, m) s += '1';bool gu = 0;if (k == 0) {cout << -1 << endl;return;}int l = n - 1, r = n;if (k % 2 == 0) {n--;gu = 1;s[n - 1] = '1';s.back() = '0';k -= 2;l--, r--;} elsek--;string s10;int ct = k / 2;rep(i, 0, ct) { s10 += "10"; }string ans;rep(i, 0, n - ct) ans += '0';ans += s10;rep(i, 0, m - ct) ans += '1';if (gu) ans += '0';int sa = 0;rep(i, 0, s.size() - 1) if (ans[i] != ans[i + 1]) sa++;if (std::count(ans.begin(), ans.end(), '0') != inin) {cout << -1 << endl;return;}if (std::count(ans.begin(), ans.end(), '1') != inim) {cout << -1 << endl;return;}if (inik == sa)cout << ans << endl;elsecout << -1 << endl;}