#850453 (C++23) No.2247 01 ZigZag

• 問題: No.2247 01 ZigZag
• ユーザー: k1suxu
• 提出日時: 2023-03-17 22:19:32
• 言語: C++23 (gcc 13.3.0 + boost 1.87.0)
• 結果: WA
• 実行時間: -
• コード長: 2,670 bytes
• コンパイル時間: 3,250 ms
• コンパイル使用メモリ: 255,672 KB
• 実行使用メモリ: 6,948 KB
• 最終ジャッジ日時: 2024-09-18 11:26:45
• 合計ジャッジ時間: 4,255 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

ファイルパターン	結果
sample	AC * 2
other	AC * 38 WA * 12

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
// #pragma GCC target("avx")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(n) for(int i = 0; i < (int)n; i++)
#define repi(i,a,b) for(int i = (int)a; i < (int)b; i++)
#define all(x) x.begin(),x.end()
//#define mp make_pair
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vvvvi vector<vvvi>
#define pii pair<int,int>
#define vpii vector<pair<int,int>>
template<typename T>
void chmax(T &a, const T &b) {a = (a > b? a : b);}
template<typename T>
void chmin(T &a, const T &b) {a = (a < b? a : b);}
using ll = long long;
using ld = long double;
using ull = unsigned long long;
const ll INF = numeric_limits<long long>::max() / 2;
const ld pi = 3.1415926535897932384626433832795028;
const ll mod = 998244353;
int dx[] = {1, 0, -1, 0, -1, -1, 1, 1};
int dy[] = {0, 1, 0, -1, -1, 1, -1, 1};
#define int long long
void solve() {
    int n, m, k;
    cin >> n >> m >> k;
    int mx = (n==m? n+m : min(n, m)*2+1);
    if(k > mx) {
        cout << -1 << endl;
        return;
    }else if(k == 0 && (n != 0 && m != 0)) {
        cout << -1 << endl;
        return;
    }else if(k == 0) {
        string ans;
        FOR(n) ans.push_back('0');
        FOR(m) ans.push_back('1');
        cout << ans << endl;
        return;
    }
    
    string ans1 = "0";
    {
        int one = 0, zero = 1;
        int pos = 1;
        FOR(k) {
            char push = (char)('1' - i%2);
            if(push == '0') zero++;
            else one++, pos = i+1;
            ans1.push_back(push);
        }
        reverse(all(ans1));
        FOR(n-zero) ans1.push_back('0');
        reverse(all(ans1));
        pos += n-zero;
        ans1 = ans1.substr(0, pos) + string(max(0LL, m-one), '1') + ans1.substr(pos, ans1.size()-pos);
    }
    string ans2 = "1";
    {
        int one = 1, zero = 0;
        int zero_pos = 1, one_pos = 0;
        FOR(k) {
            char push = (char)('0' + i%2);
            if(push == '0') zero++;
            else one++, one_pos = i+1;
            ans2.push_back(push);
        }
        ans2 = ans2.substr(0, zero_pos) + string(max(0LL, n-zero), '0') + ans2.substr(zero_pos, ans2.size()-zero_pos);
        if(zero_pos < one_pos) one_pos += n-zero;
        // cout << one_pos << endl;
        ans2 = ans2.substr(0, one_pos) + string(max(0LL, m-one), '1') + ans2.substr(one_pos, ans2.size()-one_pos);
    }
    cout << min(ans1, ans2) << endl;
    // cout << ans1 << " " << ans2 << endl;
}
signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX