結果

問題 No.5002 stick xor
ユーザー komori3komori3
提出日時 2018-05-26 05:34:33
言語 C++11
(gcc 11.4.0)
結果
AC  
実行時間 918 ms / 1,000 ms
コード長 6,094 bytes
コンパイル時間 33,242 ms
実行使用メモリ 1,656 KB
スコア 3,715
最終ジャッジ日時 2018-05-26 05:35:09
ジャッジサーバーID
(参考情報)
judge6 /
純コード判定しない問題か言語
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 907 ms
1,652 KB
testcase_01 AC 908 ms
1,652 KB
testcase_02 AC 902 ms
1,652 KB
testcase_03 AC 912 ms
1,652 KB
testcase_04 AC 906 ms
1,652 KB
testcase_05 AC 912 ms
1,656 KB
testcase_06 AC 915 ms
1,656 KB
testcase_07 AC 915 ms
1,656 KB
testcase_08 AC 904 ms
1,656 KB
testcase_09 AC 904 ms
1,652 KB
testcase_10 AC 917 ms
1,652 KB
testcase_11 AC 904 ms
1,652 KB
testcase_12 AC 907 ms
1,652 KB
testcase_13 AC 909 ms
1,656 KB
testcase_14 AC 906 ms
1,652 KB
testcase_15 AC 914 ms
1,656 KB
testcase_16 AC 911 ms
1,652 KB
testcase_17 AC 907 ms
1,652 KB
testcase_18 AC 915 ms
1,656 KB
testcase_19 AC 918 ms
1,652 KB
testcase_20 AC 912 ms
1,656 KB
testcase_21 AC 909 ms
1,652 KB
testcase_22 AC 908 ms
1,656 KB
testcase_23 AC 905 ms
1,656 KB
testcase_24 AC 911 ms
1,656 KB
testcase_25 AC 906 ms
1,648 KB
testcase_26 AC 909 ms
1,656 KB
testcase_27 AC 914 ms
1,652 KB
testcase_28 AC 905 ms
1,652 KB
testcase_29 AC 909 ms
1,656 KB
testcase_30 AC 917 ms
1,656 KB
testcase_31 AC 906 ms
1,652 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#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;

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

	vector<vector<int>> op;

	State(vector<vector<bool>> 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++) 
			cout << s.board[i] << 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);
		}

		if (row) {
			for (int x = sx; x < sx + length; x++) {
				score += (board[sy][x] ? 1 : -1);
				board[sy][x] = !board[sy][x];
			}
		}
		else {
			for (int y = sy; y < sy + length; y++) {
				score += (board[y][sx] ? 1 : -1);
				board[y][sx] = !board[y][sx];
			}
		}

		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 });
	}
};


int main() {

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

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

	vector<vector<bool>> init_board(N, vector<bool>(N)); // あとで long long で

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

	State init_state(init_board);
	State bestState = init_state;

	while ((double)clock() / CLOCKS_PER_SEC < 0.9) {
		State state = init_state;
		for (int i = 0; i < K; i++) {
			state.randomFlip(i);
		}
		if (state.score > bestState.score) {
			bestState = state;
		}
	}
	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;
}
0