結果

問題 No.5002 stick xor
ユーザー maimai
提出日時 2018-05-25 21:34:59
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 993 ms / 1,000 ms
コード長 7,278 bytes
コンパイル時間 35,666 ms
実行使用メモリ 1,500 KB
スコア 4,775
最終ジャッジ日時 2018-05-25 21:35:38
ジャッジサーバーID
（参考情報） 		judge10 /
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 993 ms
1,496 KB
testcase_01 AC 993 ms
1,500 KB
testcase_02 AC 993 ms
1,496 KB
testcase_03 AC 993 ms
1,500 KB
testcase_04 AC 993 ms
1,500 KB
testcase_05 AC 992 ms
1,500 KB
testcase_06 AC 993 ms
1,496 KB
testcase_07 AC 992 ms
1,500 KB
testcase_08 AC 993 ms
1,496 KB
testcase_09 AC 993 ms
1,496 KB
testcase_10 AC 993 ms
1,496 KB
testcase_11 AC 992 ms
1,500 KB
testcase_12 AC 993 ms
1,496 KB
testcase_13 AC 993 ms
1,500 KB
testcase_14 AC 993 ms
1,500 KB
testcase_15 AC 993 ms
1,492 KB
testcase_16 AC 992 ms
1,500 KB
testcase_17 AC 993 ms
1,500 KB
testcase_18 AC 993 ms
1,500 KB
testcase_19 AC 992 ms
1,496 KB
testcase_20 AC 992 ms
1,496 KB
testcase_21 AC 992 ms
1,496 KB
testcase_22 AC 992 ms
1,496 KB
testcase_23 AC 993 ms
1,496 KB
testcase_24 AC 993 ms
1,496 KB
testcase_25 AC 993 ms
1,496 KB
testcase_26 AC 992 ms
1,500 KB
testcase_27 AC 991 ms
1,500 KB
testcase_28 AC 992 ms
1,496 KB
testcase_29 AC 993 ms
1,496 KB
testcase_30 AC 993 ms
1,496 KB
testcase_31 AC 993 ms
1,500 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize ("O3")
#include "bits/stdc++.h"

using namespace std;
using ll = long long int;

#define debug(v) {printf("L%d %s > ",__LINE__,#v);cout<<(v)<<endl;}
#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:(v)){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;}
#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(remove_const<decltype(l)>::type cnt=0;(cnt)<(l);++(cnt))
#define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define diterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);--(cnt))
const ll MD = 1000000007ll; const long double PI = 3.1415926535897932384626433832795L;
template<typename T1, typename T2> inline void assert_equal(T1 expected, T2 actual) { if (!(expected == actual)) { cerr << "assertion fault: expected=" << expected << " actual=" << actual << endl; abort(); } }
template<typename T1, typename T2> inline void assert_less(T1 actual, T2 threshold) { if (!(actual < threshold)) { cerr << "assertion fault: " << actual << " < (const)" << threshold << endl; abort(); } }
template<typename T1, typename T2> inline void assert_eqless(T1 actual, T2 threshold) { if (!(actual <= threshold)) { cerr << "assertion fault: " << actual << " <= (const)" << threshold << endl; abort(); } }
template<typename T1, typename T2> inline ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << '(' << p.first << ':' << p.second << ')'; return o; }
template<typename Vec> inline ostream& _ostream_vecprint(ostream &o, const Vec& p) { o << '['; for (auto& e : p) o << e << ','; o << ']'; return o; }
template<typename T> inline ostream& operator<<(ostream& o, const vector<T>& v) { return _ostream_vecprint(o, v); }
template<typename T, size_t S> inline ostream& operator<<(ostream& o, const array<T, S>& v) { return _ostream_vecprint(o, v); }
template<typename T> inline T& maxset(T& to, const T& val) { return to = max(to, val); }
template<typename T> inline T& minset(T& to, const T& val) { return to = min(to, val); }
void bye(string s, int code = 0) { cout << s << endl; exit(code); }
mt19937_64 randdev(8901016);
template<typename T> inline T rand(T l, T h) { return uniform_int_distribution<T>(l, h)(randdev); }
template<> inline double rand<double>(double l, double h) { return uniform_real_distribution<double>(l, h)(randdev); }
template<> inline float rand<float>(float l, float h) { return uniform_real_distribution<float>(l, h)(randdev); }

#if defined(_WIN32) || defined(_WIN64)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#elif defined(__GNUC__)
#else
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
namespace {
#define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E)
    class MaiScanner {
    public:
        template<typename T> void input_integer(T& var) {
            var = 0; T sign = 1;
            int cc = getchar_unlocked();
            for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
                if (cc == '-') sign = -1;
            for (; '0' <= cc && cc <= '9'; cc = getchar_unlocked())
                var = (var << 3) + (var << 1) + cc - '0';
            var = var * sign;
        }
        inline int c() { return getchar_unlocked(); }
        inline MaiScanner& operator>>(int& var) { input_integer<int>(var); return *this; }
        inline MaiScanner& operator>>(long long& var) { input_integer<long long>(var); return *this; }
        inline MaiScanner& operator>>(string& var) {
            int cc = getchar_unlocked();
            for (; !isvisiblechar(cc); cc = getchar_unlocked());
            for (; isvisiblechar(cc); cc = getchar_unlocked())
                var.push_back(cc);
            return *this;
        }
        template<typename IT> void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; }
    };
    class MaiPrinter {
    public:
        template<typename T>
        void output_integer(T var) {
            if (var == 0) { putchar_unlocked('0'); return; }
            if (var < 0)
                putchar_unlocked('-'),
                var = -var;
            char stack[32]; int stack_p = 0;
            while (var)
                stack[stack_p++] = '0' + (var % 10),
                var /= 10;
            while (stack_p)
                putchar_unlocked(stack[--stack_p]);
        }
        inline MaiPrinter& operator<<(char c) { putchar_unlocked(c); return *this; }
        inline MaiPrinter& operator<<(int var) { output_integer<int>(var); return *this; }
        inline MaiPrinter& operator<<(long long var) { output_integer<long long>(var); return *this; }
        inline MaiPrinter& operator<<(char* str_p) { while (*str_p) putchar_unlocked(*(str_p++)); return *this; }
        inline MaiPrinter& operator<<(const string& str) {
            const char* p = str.c_str();
            const char* l = p + str.size();
            while (p < l) putchar_unlocked(*p++);
            return *this;
        }
        template<typename IT> void join(IT begin, IT end, char sep = '\n') { for (auto it = begin; it != end; ++it) *this << *it << sep; }
    };
}
MaiScanner scanner;
MaiPrinter printer;

#define TIME chrono::system_clock::now()
#define MILLISEC(t) (chrono::duration_cast<chrono::milliseconds>(t).count())
namespace {
    std::chrono::system_clock::time_point ttt;
    inline void tic() { ttt = TIME; }
    inline void toc() { clog << "TIME : " << MILLISEC(TIME - ttt) << '\n'; }
}

int N, K;
int L[555];
int aa[60][60];

auto begintime = TIME;

int ans[555][4]; // 
int nice[555][4];

int score, best;

inline void reset(int idx) {
    iterate(y, ans[idx][0], ans[idx][2])
        iterate(x, ans[idx][1], ans[idx][3])
            score += (aa[y][x] = -aa[y][x]);

}

inline void set_random(int idx) {
    int l = L[idx];
    if (rand(0, 1)) {
        int y = rand(0, N - l);
        int x = rand(0, N - 1);
        ans[idx][0] = y;
        ans[idx][1] = x;
        ans[idx][2] = y + l;
        ans[idx][3] = x + 1;
        repeat(i, l)
            score += (aa[y + i][x] = -aa[y + i][x]);
    }
    else {
        int y = rand(0, N - 1);
        int x = rand(0, N - l);
        ans[idx][0] = y;
        ans[idx][1] = x;
        ans[idx][2] = y + 1;
        ans[idx][3] = x + l;
        repeat(i, l)
            score += (aa[y][x + i] = -aa[y][x + i]);
    }
}

int main() {

    scanner >> N >> K;
    scanner.in(L, L + K);
    repeat(y, N) {
        string str;
        scanner >> str;
        repeat(x, N) {
            aa[y][x] = str[x] == '0' ? 1 : -1;
            score += str[x] == '0';
        }
    }

    repeat(i, K) {
        set_random(i);
    }

    best = score;

    auto begintime = TIME;

    while (MILLISEC(TIME - begintime) < 990) {
        int i = rand(0, K - 1);
        reset(i);
        set_random(i);
        if (best < score) {
            copy(ans[0], ans[K], nice[0]);
            best = score;
        }
    }
    

    repeat(i, K) {
        printer << nice[i][0]+1 << ' ' << nice[i][1]+1 << ' ' << nice[i][2] << ' ' << nice[i][3] << '\n';
    }

    return 0;
}
0