結果

問題 No.1123 Afforestation
ユーザー yosupotyosupot
提出日時 2020-07-22 22:18:00
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
RE  
実行時間 -
コード長 7,734 bytes
コンパイル時間 1,972 ms
コンパイル使用メモリ 132,196 KB
実行使用メモリ 23,408 KB
最終ジャッジ日時 2023-09-04 21:18:03
合計ジャッジ時間 14,292 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge15
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 2 ms
4,380 KB
testcase_04 AC 4 ms
4,380 KB
testcase_05 AC 26 ms
7,996 KB
testcase_06 AC 108 ms
22,780 KB
testcase_07 AC 1 ms
4,376 KB
testcase_08 AC 2 ms
4,380 KB
testcase_09 AC 2 ms
4,376 KB
testcase_10 RE -
testcase_11 RE -
testcase_12 RE -
testcase_13 AC 214 ms
22,980 KB
testcase_14 AC 1 ms
4,380 KB
testcase_15 AC 2 ms
4,380 KB
testcase_16 AC 1 ms
4,380 KB
testcase_17 AC 2 ms
4,376 KB
testcase_18 RE -
testcase_19 AC 7 ms
4,376 KB
testcase_20 AC 55 ms
8,356 KB
testcase_21 WA -
testcase_22 RE -
testcase_23 AC 362 ms
23,316 KB
testcase_24 AC 340 ms
23,340 KB
testcase_25 AC 225 ms
23,364 KB
testcase_26 AC 1 ms
4,376 KB
testcase_27 AC 2 ms
4,376 KB
testcase_28 AC 69 ms
22,788 KB
testcase_29 AC 2 ms
4,380 KB
testcase_30 AC 2 ms
4,380 KB
testcase_31 AC 68 ms
22,748 KB
testcase_32 AC 2 ms
4,376 KB
testcase_33 AC 1 ms
4,376 KB
testcase_34 AC 2 ms
4,380 KB
testcase_35 AC 2 ms
4,376 KB
testcase_36 AC 2 ms
4,380 KB
testcase_37 AC 2 ms
4,380 KB
testcase_38 AC 1 ms
4,376 KB
testcase_39 AC 2 ms
4,384 KB
testcase_40 AC 2 ms
4,380 KB
testcase_41 AC 2 ms
4,376 KB
testcase_42 AC 4 ms
4,380 KB
testcase_43 AC 7 ms
4,380 KB
testcase_44 AC 12 ms
4,376 KB
testcase_45 AC 12 ms
4,376 KB
testcase_46 AC 14 ms
4,376 KB
testcase_47 AC 20 ms
4,380 KB
testcase_48 AC 2 ms
4,380 KB
testcase_49 AC 2 ms
4,380 KB
testcase_50 AC 2 ms
4,376 KB
testcase_51 AC 2 ms
4,376 KB
testcase_52 AC 2 ms
4,376 KB
testcase_53 AC 1 ms
4,376 KB
testcase_54 AC 1 ms
4,376 KB
testcase_55 AC 2 ms
4,376 KB
testcase_56 AC 2 ms
4,376 KB
testcase_57 AC 2 ms
4,380 KB
testcase_58 AC 5 ms
4,380 KB
testcase_59 AC 7 ms
4,380 KB
testcase_60 AC 15 ms
4,380 KB
testcase_61 AC 15 ms
4,380 KB
testcase_62 AC 16 ms
4,376 KB
testcase_63 AC 21 ms
4,380 KB
testcase_64 AC 1 ms
4,380 KB
testcase_65 AC 1 ms
4,376 KB
testcase_66 AC 2 ms
4,380 KB
testcase_67 AC 1 ms
4,380 KB
testcase_68 AC 2 ms
4,376 KB
testcase_69 AC 3 ms
4,376 KB
testcase_70 AC 3 ms
4,380 KB
testcase_71 AC 8 ms
4,380 KB
testcase_72 AC 1 ms
4,376 KB
testcase_73 AC 2 ms
4,376 KB
testcase_74 AC 2 ms
4,380 KB
testcase_75 AC 2 ms
4,380 KB
testcase_76 AC 2 ms
4,380 KB
testcase_77 AC 1 ms
4,380 KB
testcase_78 AC 2 ms
4,380 KB
testcase_79 AC 2 ms
4,376 KB
testcase_80 AC 1 ms
4,380 KB
testcase_81 AC 2 ms
4,376 KB
testcase_82 AC 1 ms
4,376 KB
testcase_83 AC 1 ms
4,380 KB
testcase_84 AC 85 ms
22,788 KB
testcase_85 AC 127 ms
22,788 KB
testcase_86 AC 2 ms
4,376 KB
testcase_87 AC 1 ms
4,376 KB
testcase_88 AC 73 ms
22,768 KB
testcase_89 AC 75 ms
22,772 KB
testcase_90 AC 1 ms
4,376 KB
testcase_91 AC 1 ms
4,376 KB
testcase_92 AC 2 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx")
//#undef LOCAL




#include <algorithm>

#include <array>

#include <bitset>

#include <cassert>

#include <complex>

#include <cstdio>

#include <cstring>

#include <iostream>

#include <map>

#include <numeric>

#include <queue>

#include <set>

#include <string>

#include <unordered_map>

#include <unordered_set>

#include <vector>

using namespace std;

using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;



#include <unistd.h>

struct Scanner {
    int fd = -1;
    char line[(1 << 15) + 1];
    size_t st = 0, ed = 0;
    void reread() {
        memmove(line, line + st, ed - st);
        ed -= st;
        st = 0;
        ed += ::read(fd, line + ed, (1 << 15) - ed);
        line[ed] = '\0';
    }
    bool succ() {
        while (true) {
            if (st == ed) {
                reread();
                if (st == ed) return false;
            }
            while (st != ed && isspace(line[st])) st++;
            if (st != ed) break;
        }
        if (ed - st <= 50) {
            bool sep = false;
            for (size_t i = st; i < ed; i++) {
                if (isspace(line[i])) {
                    sep = true;
                    break;
                }
            }
            if (!sep) reread();
        }
        return true;
    }
    template <class T, enable_if_t<is_same<T, string>::value, int> = 0>
    bool read_single(T& ref) {
        if (!succ()) return false;
        while (true) {
            size_t sz = 0;
            while (st + sz < ed && !isspace(line[st + sz])) sz++;
            ref.append(line + st, sz);
            st += sz;
            if (!sz || st != ed) break;
            reread();
        }
        return true;
    }
    template <class T, enable_if_t<is_integral<T>::value>* = nullptr>
    bool read_single(T& ref) {
        if (!succ()) return false;
        bool neg = false;
        if (line[st] == '-') {
            neg = true;
            st++;
        }
        ref = T(0);
        while (isdigit(line[st])) {
            ref = 10 * ref + (line[st++] & 0xf);
        }
        if (neg) ref = -ref;
        return true;
    }
    template <class T> bool read_single(V<T>& ref) {
        for (auto& d : ref) {
            if (!read_single(d)) return false;
        }
        return true;
    }
    void read() {}
    template <class H, class... T> void read(H& h, T&... t) {
        bool f = read_single(h);
        assert(f);
        read(t...);
    }
    int read_unsafe() { return 0; }
    template <class H, class... T> int read_unsafe(H& h, T&... t) {
        bool f = read_single(h);
        if (!f) return 0;
        return 1 + read_unsafe(t...);
    }
    Scanner(FILE* fp) : fd(fileno(fp)) {}
};

struct Printer {
  public:
    template <bool F = false> void write() {}
    template <bool F = false, class H, class... T>
    void write(const H& h, const T&... t) {
        if (F) write_single(' ');
        write_single(h);
        write<true>(t...);
    }
    template <class... T> void writeln(const T&... t) {
        write(t...);
        write_single('\n');
    }

    Printer(FILE* _fp) : fp(_fp) {}
    ~Printer() { flush(); }

  private:
    static constexpr size_t SIZE = 1 << 15;
    FILE* fp;
    char line[SIZE], small[50];
    size_t pos = 0;
    void flush() {
        fwrite(line, 1, pos, fp);
        pos = 0;
    }
    void write_single(const char& val) {
        if (pos == SIZE) flush();
        line[pos++] = val;
    }
    template <class T, enable_if_t<is_integral<T>::value>* = nullptr>
    void write_single(T val) {
        if (pos > (1 << 15) - 50) flush();
        if (val == 0) {
            write_single('0');
            return;
        }
        if (val < 0) {
            write_single('-');
            val = -val; // todo min
        }
        size_t len = 0;
        while (val) {
            small[len++] = char(0x30 | (val % 10));
            val /= 10;
        }
        for (size_t i = 0; i < len; i++) {
            line[pos + i] = small[len - 1 - i];
        }
        pos += len;
    }
    void write_single(__int128 val) {
        if (pos > (1 << 15) - 50) flush();
        if (val == 0) {
            write_single('0');
            return;
        }
        if (val < 0) {
            write_single('-');
            val = -val; // todo min
        }
        size_t len = 0;
        while (val) {
            small[len++] = char(0x30 | (val % 10));
            val /= 10;
        }
        for (size_t i = 0; i < len; i++) {
            line[pos + i] = small[len - 1 - i];
        }
        pos += len;
    }

    void write_single(const string& s) {
        for (char c : s) write_single(c);
    }
    void write_single(const char* s) {
        size_t len = strlen(s);
        for (size_t i = 0; i < len; i++) write_single(s[i]);
    }
    template <class T> void write_single(const V<T>& val) {
        auto n = val.size();
        for (size_t i = 0; i < n; i++) {
            if (i) write_single(' ');
            write_single(val[i]);
        }
    }
};

Scanner sc = Scanner(stdin);
Printer pr = Printer(stdout);

VV<int> base(V<int> a, V<int> b) {
    int h = int(a.size());
    int w = int(b.size());
    V<int> idx(h);
    iota(idx.begin(), idx.end(), 0);
    sort(idx.begin(), idx.end(), [&](int x, int y) {
        return a[x] > a[y];
    });

    VV<int> answer(h, V<int>(w));

    V<int> widx(w);
    iota(widx.begin(), widx.end(), 0);
    for (int r: idx) {
        sort(widx.begin(), widx.end(), [&](int x, int y) { return b[x] > b[y]; });

        for (int i = 0; i < a[r]; i++) {
            int c = widx[i];
            answer[r][c] = 1;
            b[c]--;
        }
    }
    for (int c = 0; c < w; c++) {
        if (b[c] != 0) return {};
    }
    return answer;
}

int main() {
    int h, w;
    sc.read(h, w);
    V<int> a(h), b(w);
    for (int i = 0; i < h; i++) {
        sc.read(a[i]);
    }
    for (int i = 0; i < w; i++) {
        sc.read(b[i]);
    }
    auto g = V<string>(h, string(w, '.'));
    auto answer = base(a, b);
    if (answer.empty()) {
        pr.writeln(":(");
        return 0;
    }


    int k;
    sc.read(k);
    for (int i = 0; i < k; i++) {
        int r, c;
        sc.read(r, c); r--; c--;
        g[r][c] = 'x';
        if (!answer[r][c]) continue;

        V<int> vis(h + w);
        auto dfs = [&](auto self, int p) -> bool {
            if (p == w + c) return true;
            if (vis[p]) return false;
            vis[p] = true;
            if (p < h) {
                for (int q = 0; q < w; q++) {
                    if (answer[p][q] || g[p][q] == 'x') continue;
                    if (self(self, h + q)) {
                        answer[p][q] = true;
                        return true;
                    }
                }
            } else {
                for (int q = 0; q < h; q++) {
                    if (!answer[q][p - w] || g[q][p - w] == 'x') continue;
                    if (self(self, q)) {
                        answer[q][p - w] = false;
                        return true;
                    }
                }
            }
            return false;
        };
        if (!dfs(dfs, r)) {
            pr.writeln(":(");
            return 0;
        }
        answer[r][c] = false;
    }

    for (int r = 0; r < h; r++) {
        for (int c = 0; c < w; c++) {
            if (answer[r][c]) {
                assert(g[r][c] == '.');
                g[r][c] = 'o';
            }
        }
    }

    pr.writeln("Yay!");
    for (auto s: g) {
        pr.writeln(s);
    }

    return 0;
}
0