#260478 (C++11) No.5002 stick xor

提出ソース

結果

問題	No.5002 stick xor
ユーザー	komori3
提出日時	2018-05-26 06:40:55
言語	C++11 (gcc 11.4.0)
結果	AC
実行時間	983 ms / 1,000 ms
コード長	7,251 bytes
コンパイル時間	35,527 ms
実行使用メモリ	1,656 KB
スコア	-3,723
最終ジャッジ日時	2018-05-26 06:42:09
ジャッジサーバーID （参考情報）	judge8 /
	純コード判定しない問題か言語

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	980 ms 1,648 KB
testcase_01	AC	981 ms 1,648 KB
testcase_02	AC	976 ms 1,652 KB
testcase_03	AC	973 ms 1,652 KB
testcase_04	AC	978 ms 1,648 KB
testcase_05	AC	979 ms 1,652 KB
testcase_06	AC	982 ms 1,652 KB
testcase_07	AC	974 ms 1,652 KB
testcase_08	AC	979 ms 1,652 KB
testcase_09	AC	983 ms 1,652 KB
testcase_10	AC	975 ms 1,652 KB
testcase_11	AC	979 ms 1,652 KB
testcase_12	AC	975 ms 1,652 KB
testcase_13	AC	978 ms 1,656 KB
testcase_14	AC	981 ms 1,652 KB
testcase_15	AC	977 ms 1,652 KB
testcase_16	AC	980 ms 1,652 KB
testcase_17	AC	974 ms 1,648 KB
testcase_18	AC	972 ms 1,652 KB
testcase_19	AC	975 ms 1,656 KB
testcase_20	AC	979 ms 1,648 KB
testcase_21	AC	975 ms 1,652 KB
testcase_22	AC	973 ms 1,648 KB
testcase_23	AC	974 ms 1,652 KB
testcase_24	AC	980 ms 1,652 KB
testcase_25	AC	973 ms 1,652 KB
testcase_26	AC	980 ms 1,652 KB
testcase_27	AC	983 ms 1,648 KB
testcase_28	AC	977 ms 1,648 KB
testcase_29	AC	980 ms 1,656 KB
testcase_30	AC	977 ms 1,652 KB
testcase_31	AC	978 ms 1,652 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#include <random>
#include <unordered_map>
#include <unordered_set>

using namespace std;

//呪文
#define DUMPOUT cerr
#define dump(...) DUMPOUT<<"  ";DUMPOUT<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl;DUMPOUT<<"    ";dump_func(__VA_ARGS__)

typedef unsigned uint; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef pair<double, double> pdd; typedef pair<string, string> pss;
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) { ostr << "{" << m.first << ", " << m.second << "}"; return ostr; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const map<_KTy, _Ty>& m) { if (m.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { ostr << ", " << *itr; } ostr << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const vector<_Ty>& v) { if (v.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { ostr << ", " << *itr; }	ostr << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const set<_Ty>& s) { if (s.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { ostr << ", " << *itr; }	ostr << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const stack<_Ty>& s) { if (s.empty()) { ostr << "{ }"; return ostr; } stack<_Ty> t(s); ostr << "{" << t.top(); t.pop(); while (!t.empty()) { ostr << ", " << t.top(); t.pop(); } ostr << "}";	return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const list<_Ty>& l) { if (l.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << l.front(); for (auto itr = ++l.begin(); itr != l.end(); ++itr) { ostr << ", " << *itr; } ostr << "}"; return ostr; }
template <typename _KTy, typename _Ty> istream& operator >> (istream& istr, pair<_KTy, _Ty>& m) { istr >> m.first >> m.second; return istr; }
template <typename _Ty> istream& operator >> (istream& istr, vector<_Ty>& v) { for (size_t i = 0; i < v.size(); i++) istr >> v[i]; return istr; }
namespace aux { // print tuple
	template<typename Ty, unsigned N, unsigned L> struct tp { static void print(ostream& os, const Ty& v) { os << get<N>(v) << ", "; tp<Ty, N + 1, L>::print(os, v); } };
	template<typename Ty, unsigned N> struct tp<Ty, N, N> { static void print(ostream& os, const Ty& value) { os << get<N>(value); } };
}
template<typename... Tys> ostream& operator<<(ostream& os, const tuple<Tys...>& t) { os << "{"; aux::tp<tuple<Tys...>, 0, sizeof...(Tys)-1>::print(os, t); os << "}"; return os; }

template<typename A, size_t N, typename T> inline void Fill(A(&array)[N], const T &val) { std::fill((T*)array, (T*)(array + N), val); }

void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) { DUMPOUT << head; if (sizeof...(Tail) == 0) { DUMPOUT << " "; } else { DUMPOUT << ", "; } dump_func(std::move(tail)...); }

#define PI 3.14159265358979323846
#define EPS 1e-11
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define fake false



struct SXor128 {
	unsigned x, y, z, w;
	SXor128() { x = 123456789; y = 362436069; z = 521288629; w = 88675123; }
	SXor128(int _w) { x = 123456789; y = 362436069; z = 521288629; w = _w; }
	void setSeed() { x = 123456789; y = 362436069; z = 521288629; w = 88675123; }
	void setSeed(int _w) { x = 123456789; y = 362436069; z = 521288629; w = _w; }
	unsigned nextUInt() {
		unsigned t = (x ^ (x << 11));
		x = y; y = z; z = w;
		return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
	}
	// [0, mod)
	unsigned nextUInt(unsigned mod) {
		unsigned t = (x ^ (x << 11));
		x = y; y = z; z = w;
		w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));
		return w % mod;
	}
	// [l, r)
	unsigned nextUInt(unsigned l, unsigned r) {
		unsigned t = (x ^ (x << 11));
		x = y; y = z; z = w;
		w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));
		return w % (r - l) + l;
	}
};

int N, K;
vector<int> L;
SXor128 rnd;
vector<ull> init_board;

unsigned long long popcountll(unsigned long long x)
{
	x = ((x & 0xaaaaaaaaaaaaaaaaUL) >> 1) + (x & 0x5555555555555555UL);
	x = ((x & 0xccccccccccccccccUL) >> 2) + (x & 0x3333333333333333UL);
	x = ((x & 0xf0f0f0f0f0f0f0f0UL) >> 4) + (x & 0x0f0f0f0f0f0f0f0fUL);
	x = ((x & 0xff00ff00ff00ff00UL) >> 8) + (x & 0x00ff00ff00ff00ffUL);
	x = ((x & 0xffff0000ffff0000UL) >> 16) + (x & 0x0000ffff0000ffffUL);
	x = ((x & 0xffffffff00000000UL) >> 32) + (x & 0x00000000ffffffffUL);
	return x;
}

template<typename Ty> void print_bit(Ty n, int len = 32)
{
	for (int i = 0; i < len; i++)
		cout << ((n & (Ty(1) << i)) ? 1 : 0);
}

int score_naive(const vector<ull>& board) {
	int res = 0;
	for (int i = 0; i < board.size(); i++)
		res += popcountll(board[i]) - popcountll(init_board[i]);
	return res;
}


struct State {
	vector<ull> board;
	int score;

	vector<vector<int>> op;

	State(vector<ull> init_board) : board(init_board), score(0) {}

	friend ostream& operator << (ostream& os, const State& s) {
		cout << "Score = " << s.score << endl;
		for (int i = 0; i < s.board.size(); i++) {
			print_bit<ll>(s.board[i], N);
			cout << endl;
		}
		return os;
	}

	void randomFlip(int index) {
		int length = L[index];

		bool row = rnd.nextUInt() & 1;
		int sx, sy;
		if (row) {
			sy = rnd.nextUInt(N);
			sx = rnd.nextUInt(N - length + 1);
		}
		else {
			sy = rnd.nextUInt(N - length + 1);
			sx = rnd.nextUInt(N);
		}

		//cerr << (row ? "row" : "col") << endl;
		if (row) {
			ull mask = ((1LL << (sx + length)) - 1) ^ ((1LL << sx) - 1);
			score += L[index] - (popcountll(mask & board[sy]) << 1);
			board[sy] ^= mask;
		}
		else {
			ull mask = 1LL << sx;
			for (int y = sy; y < sy + length; y++) {
				score += (board[y] & mask ? -1 : 1);
				board[y] ^= mask;
			}
		}

		if (row)
			op.push_back({ sy + 1, sx + 1, sy + 1, sx + length });
		else
			op.push_back({ sy + 1, sx + 1, sy + length, sx + 1 });

		//dump(row ? "row" : "col", length, sy, sx);
		//dump(score, score_naive(board));
		//cout << *this << endl;
	}
};


int main() {

	cin.tie(0);
	ios::sync_with_stdio(false);

	cin >> N >> K;
	L.resize(K);
	cin >> L;
	vector<string> input(N);
	cin >> input;

	init_board.resize(N, 0); // あとで long long で

	for (int i = 0; i < N; i++) for (int j = 0; j < N; j++)
		init_board[i] |= ll(input[i][j] - '0') << j;

	State init_state(init_board);
	State bestState = init_state;

	int loopcnt = 0;
	while ((double)clock() / CLOCKS_PER_SEC < 0.97) {
		loopcnt++;
		//dump(loopcnt);
		State state = init_state;
		//cout << init_state << endl;
		for (int i = 0; i < K; i++) {
			state.randomFlip(i);
		}
		if (state.score > bestState.score) {
			//dump(state.score, score_naive(state.board));
			bestState = state;
		}
	}
	//cout << loopcnt << endl;
	for (int i = 0; i < bestState.op.size(); i++) {
		cout << bestState.op[i][0] << " " << bestState.op[i][1] << " " << bestState.op[i][2] << " " << bestState.op[i][3] << endl;
	}

	return 0;
}

yukicoder

結果

テストケース

ソースコード