提出 #75729602

---

ソースコード 拡げる

#include <bits/stdc++.h>
#define fastio cin.tie(0)->sync_with_stdio(0)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define compress(v) sort(all(v)), v.erase(unique(all(v)), v.end())
#define sz(x) (int)(x).size()
using namespace std;
typedef long long ll;

int main() {
    fastio; int T; cin >> T;
    for (int tc = 0; tc < T; tc++) {
        int H, W; cin >> H >> W;
        vector<string> sv(2*H);
        for (auto &i : sv) cin >> i;
        vector<pair<int,int>> v;
        for (int i = 0; i < 2*H; i++) {
            for (int j = 1; j < 2*W; j++) {
                if (i%2 == 0) v.push_back({ i, j });
                else v.push_back({ i, 2*W-j });
            }
        }
        for (int i = 2*H-1; i >= 0; i--) v.push_back({ i, 0 });
        int c = 0;
        for (int i = 0; i < 2*H*W; i++) {
            if (sv[v[i].first][v[i].second] == 'o') c++;
        }
        auto solve = [&]() {
            if (c == H*W) return 0;
            for (int i = 2*H*W; i < 4*H*W; i++) {
                if (sv[v[i-2*H*W].first][v[i-2*H*W].second] == 'o') c--;
                if (sv[v[i].first][v[i].second] == 'o') c++;
                if (c == W*H) return i-2*H*W+1;
            }
        };
        int t = solve();
        vector<vector<bool>> ans(2*H, vector<bool>(2*W));
        for (int i = t; i < t+2*H*W; i++) {
            ans[v[i].first][v[i].second] = 1;
        }
        for (auto i : ans) {
            for (auto j : i) {
                cout << (j ? "A" : "B");
            }
            cout << "\n";
        }
    }
    return 0;
}

提出情報

コンパイルエラー

./Main.cpp: In lambda function:
./Main.cpp:35:9: warning: control reaches end of non-void function [-Wreturn-type]
   35 |         };
      |         ^

ジャッジ結果