結果
問題 | No.2247 01 ZigZag |
ユーザー |
![]() |
提出日時 | 2023-03-17 22:53:56 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 3,880 bytes |
コンパイル時間 | 3,714 ms |
コンパイル使用メモリ | 251,028 KB |
最終ジャッジ日時 | 2025-02-11 14:03:29 |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 49 WA * 1 |
ソースコード
#include "bits/stdc++.h"#include <unistd.h>using namespace std;#include "atcoder/all"using namespace atcoder;using i64 = long long;using i128 = __int128_t;using u64 = unsigned long long;using ld = long double;using i_i = pair<int, int>;using l_l = pair<i64, i64>;using d_d = pair<double, double>;using s_s = pair<string, string>;using i_i_i = tuple<int, int, int>;using i_i_i_i = tuple<int, int, int, int>;using l_l_l = tuple<i64, i64, i64>;using l_l_l_l = tuple<i64, i64, i64, i64>;using _bool = int;#define rep(i, n) for(int i = 0; i < n; i++)#define ifbit(n,k) ((n>>k)&1) //if kth bit of n is on then true (sitakara, 0-indexed)#define zpad(i) cout << setfill('0') << setw(i)#define dout cout << fixed << setprecision(10)#define douts(i) cout << fixed << setprecision(i) << scientific#define pcnt __builtin_popcountconstexpr int INF = 2147483647;constexpr i64 I64F = 9223372036854775807;template <class T> bool chmax(T &l, const T &r) { if (l < r) { l = r; return true; } return false; }template <class T> bool chmin(T &l, const T &r) { if (l > r) { l = r; return true; } return false; }template <class T> pair<int, bool> ub(const vector<T> &v, const T &key) { int ind = upper_bound(v.begin(), v.end(), key) - v.begin(); if (ind == (int)v.size()) return make_pair(0, false); return make_pair(ind, true); }template <class T> pair<int, bool> rub(const vector<T> &v, const T &key) { int ind = upper_bound(v.rbegin(), v.rend(), key, [](const T &l, const T &r) { return l > r; }) - v.rbegin(); if (ind == (int)v.size()) return make_pair(0, false); return make_pair((int)v.size() - 1 - ind, true); }template <class T> pair<int, bool> lb(const vector<T> &v, const T &key) { int ind = lower_bound(v.begin(), v.end(), key) - v.begin(); if (ind == (int)v.size()) return make_pair(0, false); return make_pair(ind, true); }template <class T> pair<int, bool> rlb(const vector<T> &v, const T &key) { int ind = lower_bound(v.rbegin(), v.rend(), key, [](const T &l, const T &r) { return l > r; }) - v.rbegin(); if (ind == (int)v.size()) return make_pair(0, false); return make_pair((int)v.size() - 1 - ind, true); }std::ostream &operator<<(std::ostream &dest, __int128_t value) {std::ostream::sentry s(dest);if (s) {__uint128_t tmp = value < 0 ? -value : value;char buffer[128];char *d = std::end(buffer);do {--d;*d = "0123456789"[tmp % 10];tmp /= 10;} while (tmp != 0);if (value < 0) {--d;*d = '-';}int len = std::end(buffer) - d;if (dest.rdbuf()->sputn(d, len) != len) {dest.setstate(std::ios_base::badbit);}}return dest;}int main() {char z = '0';char o = '1';int n, m, k; cin >> n >> m >> k;if (k % 2) {//0101int ma = min(n, m) * 2 - 1;if (k > ma) {cout << -1 << endl;return 0;}rep(i, n - (k + 1) / 2) {cout << '0';}rep(i, (k + 1) / 2) {cout << "01";}rep(i, m - (k + 1) / 2) {cout << '1';}cout << endl;return 0;} else {// move 0// 010if (k <= min(n - 1, m) * 2) {rep(i, n - 1 - k / 2) {cout << z;}rep(i, k / 2) {cout << z << o;}rep(i, m - k / 2) {cout << o;}cout << z << endl;return 0;}if (k <= min(m - 1, n) * 2) {cout << o;rep(i, n - k / 2) {cout << z;}rep(i, k / 2) {cout << z << o;}rep(i, m - k / 2 - 1) {cout << o;}cout << endl;return 0;}}cout << -1 << endl;}