結果

問題 No.5002 stick xor
ユーザー iiljjiiljj
提出日時 2020-06-28 17:10:04
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 936 ms / 1,000 ms
コード長 9,459 bytes
コンパイル時間 2,341 ms
実行使用メモリ 1,700 KB
スコア 28,005
最終ジャッジ日時 2020-06-28 17:10:41
ジャッジサーバーID
（参考情報） 		judge12 / judge8
純コード判定しない問題か言語
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 930 ms
1,692 KB
testcase_01 AC 935 ms
1,692 KB
testcase_02 AC 913 ms
1,692 KB
testcase_03 AC 930 ms
1,692 KB
testcase_04 AC 927 ms
1,696 KB
testcase_05 AC 930 ms
1,700 KB
testcase_06 AC 917 ms
1,696 KB
testcase_07 AC 934 ms
1,692 KB
testcase_08 AC 933 ms
1,692 KB
testcase_09 AC 929 ms
1,692 KB
testcase_10 AC 912 ms
1,696 KB
testcase_11 AC 928 ms
1,696 KB
testcase_12 AC 933 ms
1,688 KB
testcase_13 AC 914 ms
1,692 KB
testcase_14 AC 928 ms
1,696 KB
testcase_15 AC 912 ms
1,688 KB
testcase_16 AC 932 ms
1,700 KB
testcase_17 AC 919 ms
1,692 KB
testcase_18 AC 929 ms
1,692 KB
testcase_19 AC 916 ms
1,696 KB
testcase_20 AC 929 ms
1,700 KB
testcase_21 AC 915 ms
1,692 KB
testcase_22 AC 930 ms
1,692 KB
testcase_23 AC 914 ms
1,692 KB
testcase_24 AC 930 ms
1,692 KB
testcase_25 AC 917 ms
1,696 KB
testcase_26 AC 931 ms
1,692 KB
testcase_27 AC 919 ms
1,692 KB
testcase_28 AC 921 ms
1,692 KB
testcase_29 AC 913 ms
1,688 KB
testcase_30 AC 914 ms
1,692 KB
testcase_31 AC 936 ms
1,688 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define EVAL 1 // 提出時に有効にする
/* #region Head */

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;

#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define PERM(c)                                                                                                        \
    sort(ALL(c));                                                                                                      \
    for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());

#define endl '\n'
#define sqrt sqrtl
#define floor floorl
#define log2 log2l

constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;

template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
    for (T &x : vec) is >> x;
    return is;
}
template <typename T> ostream &operator<<(ostream &os, vc<T> &vec) { // vector 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}
template <typename T> ostream &operator>>(ostream &os, vc<T> &vec) { // vector 出力 (inline)
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
    return os;
}

template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
    is >> pair_var.first >> pair_var.second;
    return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, pair<T, U> &pair_var) { // pair 出力
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, T &map_var) {
    os << "{";
    REPI(itr, map_var) {
        os << *itr;
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    return os << "}";
}
template <typename T, typename U> ostream &operator<<(ostream &os, map<T, U> &map_var) { return out_iter(os, map_var); }
template <typename T, typename U> ostream &operator<<(ostream &os, um<T, U> &map_var) {
    os << "{";
    REPI(itr, map_var) {
        auto [key, value] = *itr;
        os << "(" << key << ", " << value << ")";
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    os << "}";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, us<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, pq<T> &pq_var) {
    pq<T> pq_cp(pq_var);
    os << "{";
    if (!pq_cp.empty()) {
        os << pq_cp.top(), pq_cp.pop();
        while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();
    }
    return os << "}";
}

// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) DUMPOUT << ", ";
    dump_func(move(tail)...);
}

// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
    if (comp(xmax, x)) {
        xmax = x;
        return true;
    }
    return false;
}

// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
    if (comp(x, xmin)) {
        xmin = x;
        return true;
    }
    return false;
}

// ローカル用
#define DEBUG_

#ifdef DEBUG_
#define DEB
#define dump(...)                                                                                                      \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                                                                    \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl                                        \
            << "    ",                                                                                                 \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

struct AtCoderInitialize {
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = false;
    AtCoderInitialize() {
        ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
        cout << fixed << setprecision(IOS_PREC);
        if (AUTOFLUSH) cout << unitbuf;
    }
} ATCODER_INITIALIZE;

void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; }
void YN(bool p) { cout << (p ? "YES" : "NO") << endl; }

/* #endregion */

struct Query {
    ll sRow, sCol, tRow, tCol;

    friend ostream &operator<<(ostream &os, const Query &entity) {
        os << (entity.sRow + 1) << " " << (entity.sCol + 1) << " " << (entity.tRow + 1) << " " << (entity.tCol + 1);
        return os;
    }
};

class Rand {
    std::random_device rd; // Will be used to obtain a seed for the random number engine
    std::mt19937 gen;      // Standard mersenne_twister_engine seeded with rd()
    std::uniform_int_distribution<> dis;

  public:
    Rand(ll lb, ll ub) : rd(), gen(rd()), dis(lb, ub) {}
    int operator()() { return dis(gen); }
};

class RandDouble {
    std::random_device seed_gen;
    std::default_random_engine engine;
    std::uniform_real_distribution<> dist;

  public:
    RandDouble(double lb, double ub) : seed_gen(), engine(seed_gen()), dist(lb, ub) {}
    double operator()() { return dist(engine); }
};

ll add(Query &query, vc<vc<bool>> &tbl) {
    ll score = 0;
    auto [sRow, sCol, tRow, tCol] = query;
    REPM(row, sRow, tRow) REPM(col, sCol, tCol) {
        // 0 になったら加点，1になったら減点
        tbl[row][col] = !tbl[row][col];
        if (!tbl[row][col])
            score++;
        else
            score--;
    }
    return score;
}

// クエリ列，テーブル
ll play(vc<Query> &queries, vc<vc<bool>> &tbl) {
    ll score = 0;
    for (Query &query : queries) {
        score += add(query, tbl);
    }
    return score;
}

ll update(Query &query_old, Query &query_new, vc<vc<bool>> &tbl) {
    ll dscore = 0;
    dscore += add(query_old, tbl);
    dscore += add(query_new, tbl);
    return dscore;
}

Query create_query(ll n, ll li, Rand &r, Rand &rb) {
    if (rb()) {
        // 横方向 (1行)
        ll sRow = r() % n;
        ll sCol = r() % (n - li + 1);
        return {sRow, sCol, sRow, sCol + li - 1};
    } else {
        // 縦方向 (1列)
        ll sCol = r() % n;
        ll sRow = r() % (n - li + 1);
        return {sRow, sCol, sRow + li - 1, sCol};
    }
}

// Problem
void solve() {
    ll n, k;
    cin >> n >> k;
    vll l(k);
    cin >> l;
    vc<string> a(n);
    cin >> a;

    Rand r(0, INF);
    Rand rk(0, k - 1);
    Rand rb(0, 1);
    RandDouble rd(0, 1);

    ll timespan_ms = 900;
    ll timespan_clocks = (ll)(CLOCKS_PER_SEC * timespan_ms / 1000);
    clock_t start_time = clock();
    clock_t end_time = start_time + timespan_clocks;

    vc<Query> queries(k);
    REP(i, 0, k) queries[i] = create_query(n, l[i], r, rb);

    // 純白 (0) がなるべく多くなるようにする
    vc<vc<bool>> tbl(n, vc<bool>(n));
    REP(row, 0, n) REP(col, 0, n) tbl[row][col] = (a[row][col] - '0');
    ll score_ans = play(queries, tbl);

    while (true) {
        int selected = rk();
        Query query_old = queries[selected];
        Query query_new = create_query(n, l[selected], r, rb);

        ll dscore = update(query_old, query_new, tbl); // TODO

        clock_t cur_time = clock();
        double ms = (double)(cur_time - start_time) * 1000.0 / CLOCKS_PER_SEC;
        double force_line =
            (double)(end_time - cur_time) / timespan_clocks / 100; // 100 は要調整 1/100 から 0/100 に近づく
        // if (chmin(cost_ans, cost)) {
        if (dscore > 0 || rd() < force_line) {
            score_ans += dscore;
#ifndef EVAL
            cerr << score_ans << endl;
#endif
            queries[selected] = query_new;
            // diffs = diffs_new;
        } else {
            update(query_new, query_old, tbl);
        }

        if (ms > timespan_ms) break; //
    }
#ifndef EVAL
    cout << score_ans << endl;
#else
    REP(i, 0, k) cout << queries[i] << endl;
#endif
}

// entry point
int main() {
    solve();
    return 0;
}
0