結果

問題 No.5005 3-SAT
ユーザー trineutrontrineutron
提出日時 2022-03-29 02:46:12
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,914 ms / 2,000 ms
コード長 2,868 bytes
コンパイル時間 665 ms
実行使用メモリ 6,952 KB
スコア 99,077
最終ジャッジ日時 2022-04-29 13:50:01
合計ジャッジ時間 197,801 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge15
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,909 ms
4,900 KB
testcase_01 AC 1,910 ms
4,904 KB
testcase_02 AC 1,909 ms
4,904 KB
testcase_03 AC 1,909 ms
4,904 KB
testcase_04 AC 1,909 ms
4,900 KB
testcase_05 AC 1,909 ms
4,900 KB
testcase_06 AC 1,909 ms
4,908 KB
testcase_07 AC 1,908 ms
4,900 KB
testcase_08 AC 1,909 ms
5,160 KB
testcase_09 AC 1,909 ms
4,908 KB
testcase_10 AC 1,909 ms
4,900 KB
testcase_11 AC 1,909 ms
4,900 KB
testcase_12 AC 1,909 ms
4,900 KB
testcase_13 AC 1,908 ms
4,904 KB
testcase_14 AC 1,909 ms
4,900 KB
testcase_15 AC 1,910 ms
4,904 KB
testcase_16 AC 1,909 ms
4,904 KB
testcase_17 AC 1,909 ms
4,900 KB
testcase_18 AC 1,908 ms
4,900 KB
testcase_19 AC 1,909 ms
4,904 KB
testcase_20 AC 1,909 ms
4,900 KB
testcase_21 AC 1,911 ms
5,156 KB
testcase_22 AC 1,909 ms
4,900 KB
testcase_23 AC 1,910 ms
4,904 KB
testcase_24 AC 1,910 ms
4,904 KB
testcase_25 AC 1,908 ms
4,904 KB
testcase_26 AC 1,909 ms
4,904 KB
testcase_27 AC 1,909 ms
4,904 KB
testcase_28 AC 1,909 ms
4,904 KB
testcase_29 AC 1,911 ms
4,900 KB
testcase_30 AC 1,911 ms
4,904 KB
testcase_31 AC 1,908 ms
4,904 KB
testcase_32 AC 1,910 ms
4,904 KB
testcase_33 AC 1,909 ms
4,904 KB
testcase_34 AC 1,909 ms
4,908 KB
testcase_35 AC 1,912 ms
4,900 KB
testcase_36 AC 1,909 ms
6,952 KB
testcase_37 AC 1,908 ms
4,900 KB
testcase_38 AC 1,909 ms
6,952 KB
testcase_39 AC 1,909 ms
4,900 KB
testcase_40 AC 1,909 ms
4,904 KB
testcase_41 AC 1,909 ms
6,952 KB
testcase_42 AC 1,911 ms
4,904 KB
testcase_43 AC 1,909 ms
6,948 KB
testcase_44 AC 1,909 ms
4,900 KB
testcase_45 AC 1,912 ms
4,904 KB
testcase_46 AC 1,914 ms
6,948 KB
testcase_47 AC 1,909 ms
4,904 KB
testcase_48 AC 1,910 ms
6,948 KB
testcase_49 AC 1,908 ms
4,900 KB
testcase_50 AC 1,909 ms
4,904 KB
testcase_51 AC 1,909 ms
6,948 KB
testcase_52 AC 1,909 ms
6,948 KB
testcase_53 AC 1,909 ms
4,900 KB
testcase_54 AC 1,911 ms
4,900 KB
testcase_55 AC 1,908 ms
4,904 KB
testcase_56 AC 1,909 ms
4,908 KB
testcase_57 AC 1,909 ms
4,904 KB
testcase_58 AC 1,909 ms
4,900 KB
testcase_59 AC 1,909 ms
4,900 KB
testcase_60 AC 1,913 ms
6,948 KB
testcase_61 AC 1,914 ms
6,952 KB
testcase_62 AC 1,913 ms
4,904 KB
testcase_63 AC 1,909 ms
6,948 KB
testcase_64 AC 1,910 ms
4,904 KB
testcase_65 AC 1,909 ms
6,948 KB
testcase_66 AC 1,909 ms
4,900 KB
testcase_67 AC 1,908 ms
4,904 KB
testcase_68 AC 1,909 ms
6,948 KB
testcase_69 AC 1,909 ms
6,952 KB
testcase_70 AC 1,910 ms
4,900 KB
testcase_71 AC 1,910 ms
6,948 KB
testcase_72 AC 1,909 ms
4,904 KB
testcase_73 AC 1,908 ms
6,948 KB
testcase_74 AC 1,911 ms
6,952 KB
testcase_75 AC 1,910 ms
6,948 KB
testcase_76 AC 1,909 ms
4,900 KB
testcase_77 AC 1,911 ms
4,904 KB
testcase_78 AC 1,909 ms
4,900 KB
testcase_79 AC 1,908 ms
6,948 KB
testcase_80 AC 1,909 ms
4,900 KB
testcase_81 AC 1,909 ms
4,904 KB
testcase_82 AC 1,909 ms
4,908 KB
testcase_83 AC 1,909 ms
4,904 KB
testcase_84 AC 1,909 ms
4,904 KB
testcase_85 AC 1,909 ms
6,948 KB
testcase_86 AC 1,910 ms
4,904 KB
testcase_87 AC 1,912 ms
4,900 KB
testcase_88 AC 1,910 ms
4,900 KB
testcase_89 AC 1,909 ms
4,900 KB
testcase_90 AC 1,909 ms
6,952 KB
testcase_91 AC 1,908 ms
4,900 KB
testcase_92 AC 1,910 ms
4,900 KB
testcase_93 AC 1,909 ms
6,948 KB
testcase_94 AC 1,908 ms
6,952 KB
testcase_95 AC 1,909 ms
6,948 KB
testcase_96 AC 1,909 ms
4,904 KB
testcase_97 AC 1,911 ms
6,948 KB
testcase_98 AC 1,909 ms
6,948 KB
testcase_99 AC 1,909 ms
4,904 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bitset>
#include <iostream>
#include <random>
using namespace std;

class xrand {
    uint64_t x;

   public:
    using result_type = uint32_t;
    static constexpr result_type min() {
        return numeric_limits<result_type>::min();
    }
    static constexpr result_type max() {
        return numeric_limits<result_type>::max();
    }
    xrand(uint64_t k) : x(k) {}
    xrand() : xrand(1) {}
    result_type operator()() {
        x ^= x << 9;
        x ^= x >> 7;
        return (x * 0x123456789abcdef) >> 32;
    }
};

constexpr int n = 256, len = 2048;
uint32_t a[len], b[len], c[len], a1[len], b1[len], c1[len];

xrand rng;
uniform_int_distribution<int> dist(0, n - 1), dist2(0, 1);
uniform_real_distribution<double> d1(0, 1);

int calc_score(const bitset<n> &s) {
    for (int i = 0; i < len; i++) {
        if (s[a[i]] != a1[i] and s[b[i]] != b1[i] and s[c[i]] != c1[i]) {
            return i;
        }
    }
    return len;
}

int main() {
    const clock_t start = clock();
    for (int i = 0; i < len; i++) {
        cin >> a[i] >> b[i] >> c[i] >> a1[i] >> b1[i] >> c1[i];
    }
    bitset<n> best, s;

    int best_score = calc_score(best), prev_score = best_score;
    constexpr double start_temp = 1, end_temp = 0.1;

    while (true) {
        const double phase = (clock() - start) / (1.9 * CLOCKS_PER_SEC);
        if (phase >= 1) break;
        const double temp = start_temp * pow(end_temp / start_temp, phase);

        bitset<n> locked;
        for (int i = 0; i < len; i++) {
            if (s[a[i]] == a1[i] and locked[a[i]]) continue;
            if (s[b[i]] == b1[i] and locked[b[i]]) continue;
            if (s[c[i]] == c1[i] and locked[c[i]]) continue;
            if (s[a[i]] == a1[i]) {
                locked.set(a[i]);
            } else if (s[b[i]] == b1[i]) {
                locked.set(b[i]);
            } else if (s[c[i]] == c1[i]) {
                locked.set(c[i]);
            } else if (not locked[a[i]]) {
                s.flip(a[i]);
                locked.set(a[i]);
            } else if (not locked[b[i]]) {
                s.flip(b[i]);
                locked.set(b[i]);
            } else if (not locked[c[i]]) {
                s.flip(c[i]);
                locked.set(c[i]);
            } else {
                break;
            }
        }

        for (int i = 0; i < 100; i++) {
            const int idx = dist(rng);
            s.flip(idx);
            const int score = calc_score(s);
            const double prob = exp(min(0, score - prev_score) / temp);
            if (prob < 1 and d1(rng) >= prob) {
                s.flip(idx);
            } else {
                prev_score = score;
                if (score > best_score) {
                    best_score = score;
                    best = s;
                }
            }
        }
    }
    cout << best << endl;
    return 0;
}
0