結果

問題 No.5002 stick xor
コンテスト
ユーザー naimonon77
提出日時 2019-01-01 16:26:44
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 6 ms / 1,000 ms
コード長 5,012 bytes
コンパイル時間 2,868 ms
実行使用メモリ 1,616 KB
スコア 9,441
最終ジャッジ日時 2019-01-01 16:26:49
ジャッジサーバーID
（参考情報） 		judge6 /
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 32
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define NOMINMAX
#define TEST_MODE true

#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES

#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, a, b) for (int i = (a)-1; i >= (int)b; --i)
#define range(i, a, b, c) for (int i = a;             \
                                   c > 0 ? i < b : i > b; \
                                   i += c)
#define chmax(a, b) (a = (a) < (b) ? (b) : (a))
#define chmin(a, b) (a = (a) > (b) ? (b) : (a))
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define all(a) begin(a), end(a)
#define ifnot(a) if (not(a))
#define int long long

#ifdef LOCAL_ENV

#if TEST_MODE == true
const bool test = true;
#define dump(x) //cerr << #x << " : " << (x) << " "
#define dumpl(x) dump(x) << endl
#else
const bool test = false;
#define dump(x) 
#define dumpl(x)
#endif

#else
const bool test = false;
#define dump(x) 
#define dumpl(x)
#endif

int dx[] = { 1, 0, -1, 0 };
int dy[] = { 0, 1, 0, -1 };
const int INF = (int)1 << 60;
const int undefined = INF;
const ll INFL = (ll)1 << 60;
ll mod_n = (int)1e9 + 7;
const double eps = 1e-10;
typedef long double Real;
// return -1, 0, 1
int sgn(const Real &r) { return (r > eps) - (r < -eps); }
int sgn(const Real &a, const Real &b) { return sgn(a - b); }

//.....................
const int MAX = (int)2e5 + 5;

vector<string> split(const string &str, char sep)
{
	vector<string> v;
	stringstream ss(str);
	string buffer;
	while (getline(ss, buffer, sep))
	{
		v.push_back(buffer);
	}
	return v;
}

string join(const vector<string>& v, const string delim = 0) {
	string s;
	if (!v.empty()) {
		s += v[0];
		for (decltype(v.size()) i = 1, c = v.size(); i < c; ++i) {
			if (delim != "") s += delim;
			s += v[i];
		}
	}
	return s;
}

string operator * (const string& s, const int& n) {
	string res = "";
	rep(i, n) res += s;
	return res;
}

template <class InputIterator>
int sum(InputIterator begin, InputIterator end)
{
	return accumulate(begin, end, 0ll);
}

template<typename T>
T gcd(T a, T b)
{
	T c;
	while (a != 0) {
		c = a; a = b%a;  b = c;
	}
	return b;
}

template<typename T>
T bit_count(T N) {
	T cnt = 0;
	while (N) {
		if (N & 1) cnt++;
		N >>= 1;
	}
	return cnt;
}

template<typename T>
void print_vec(ostream& ostream, vector<T> a) {
	rep(i, a.size() - 1) ostream << a[i] << " ";
	ostream << a.back() << endl;
}

ll pow_n(ll x, ll n) {
	ll res = 1;
	while (n > 0) {
		if (n & 1) res = res * x;
		x = x * x;
		n >>= 1;
	}
	return res;
}

class Solver {
public:
	int H, W;

	bool grid_ng(int y, int x) {
		return y < 0 || y >= H || x < 0 || x >= W;
	}

	struct Point {
		int x, y, v;
		Point(int x_, int y_, int v_) : x(x_), y(y_), v(v_) {}
		bool operator < (const Point& r) const {
			if (y != r.y) return y < r.y;
			return x < r.x;
		}
	};

	int N, K;
	vector<int> L;
	vector<vector<int>> field;

	void input() {
		cin >> N >> K;
		H = N; W = N;
		L.resize(K); rep(i, K) cin >> L[i];
		field.resize(H);
		rep(y, H) {
			string A; cin >> A;
			field[y].resize(W);
			rep(x, W) field[y][x] = A[x] - '0';
		}
	}

	void reverse(int a, int b, int c, int d) {
		rep2(y, a, c + 1) rep2(x, b, d + 1) {
			auto& cur = field[y][x];
			cur = (cur == 0 ? 1 : 0);
		}
	}	
	
	void reverse(vector<int>& a) {
		rep2(y, a[0], a[2] + 1) rep2(x, a[1], a[3] + 1) {
			auto& cur = field[y][x];
			cur = (cur == 0 ? 1 : 0);
		}
	}

	void field_output() {
		//cerr << "------" << endl;
		rep(y, H) {
			string A;
			A.resize(W);
			rep(x, W) A[x] = field[y][x] + '0';
			//cerr << A << endl;
		}
	}

	void output(const vector<int>& vec_i) {
		vector<string> vec;
		for (auto& v : vec_i) vec.push_back(to_string(v + 1));
		cout << join(vec, " ") << endl;
	}

	int reverse_score(vector<int>& a) {
		int res = 0;
		rep2(y, a[0], a[2] + 1) rep2(x, a[1], a[3] + 1) {
			auto& cur = field[y][x];
			res += (cur == 0 ? -1 : 1);
		}
		return res;
	}

	void output() {
		rep(i, K - H) {
			vector<int> vec = { 0 , 0 , 0 , L[i] - 1 };
			output(vec);
		}
		rep(y, H) {
			int cur_l = L[K - H + y];
			vector<int> vec = { y , 0 , y , cur_l - 1 };
			Point best(0, 0, -INF);
			rep(x, W) {
				//dump(vec[3]); dumpl(W);
				if (vec[3] >= W) break;
				int cur_score = reverse_score(vec);
				if (cur_score > best.v) {
					best.x = x;
					best.v = cur_score;
				}
				vec[1] += 1; vec[3] += 1;
			}
			{
				int x = best.x;
				vec[1] = x;
				vec[3] = x + cur_l - 1;
				output(vec);
			}
		}
	}

	void test() {
		// reverse(0, 0, 1, 2);
		vector<int> vec = { 0, 0, 1, 2 };
		reverse(vec);
		field_output();
	}

	void solve() {
		input();
		test();
		output();
	}
};

signed main()
{
	srand((unsigned int)time(NULL));
	cout << fixed << setprecision(20);
	auto ptr = new Solver();
	ptr->solve();
	delete ptr;
	//while (true) {
	//	if (cin.eof() == true) break;
	//	auto ptr = new Solver();
	//	ptr->solve();
	//	delete ptr;
	//}
	return 0;
}
0