提出 dfad78f8-e0fd-466d-a86b-1c3482cda863

コード

#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
using namespace std;
using ll = long long;

struct Op
{
	int id, H, W, a, b;
	bool operator<(const Op &rhs) const
	{
		return H * W >= rhs.H * rhs.W;
	}
};

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int N, T;
	if (!(cin >> N >> T))
		return 0;
	vector<vector<int>> A(N, vector<int>(N)), B(N, vector<int>(N));
	for (int i = 0; i < N; ++i)
		for (int j = 0; j < N; ++j)
			cin >> A[i][j];
	for (int i = 0; i < N; ++i)
		for (int j = 0; j < N; ++j)
			cin >> B[i][j];
	vector<Op> ops(T);
	for (int t = 0; t < T; ++t)
	{
		ops[t].id = t;
		cin >> ops[t].H >> ops[t].W >> ops[t].a >> ops[t].b;
	}
	const int LIMIT = 100000;
	vector<tuple<int, int, int>> out;
	out.reserve(10000);
	clock_t clk = clock();
	vector<char> used(T, 0);
	struct XORShiftRandom
	{
		uint64_t x = 88172645463325252ULL;
		inline uint64_t next()
		{
			x ^= x << 13;
			x ^= x >> 7;
			x ^= x << 17;
			return x;
		}
		inline int nextInt(int mod)
		{
			return next() % mod;
		}
		inline double nextDouble()
		{
			return (double)next() / (double)((uint64_t)-1);
		}
	} rng;
	sort(ops.begin(), ops.end());

	while ((double)(clock() - clk) / CLOCKS_PER_SEC < 2.9)
	{
		shuffle(ops.begin(), ops.end(), rng);
		for (int t = 0; t < T; ++t)
		{
			int id = ops[t].id, H = ops[t].H, W = ops[t].W, a = ops[t].a, b = ops[t].b;
			int uses = 0;
			while (used[id] < 3 && (int)out.size() < LIMIT)
			{
				vector<vector<int>> pref(N + 1, vector<int>(N + 1, 0));
				bool anyPossible = false;
				for (int i = 0; i < N; ++i)
				{
					int rowSum = 0;
					for (int j = 0; j < N; ++j)
					{
						int w = 0;
						if (A[i][j] == a)
						{
							int before = (int)A[i][j] - (int)B[i][j];
							int after = (int)b - (int)B[i][j];
							w = after * after - before * before;
							anyPossible = true;
						}
						rowSum += w;
						pref[i + 1][j + 1] = pref[i][j + 1] + rowSum;
					}
				}
				if (!anyPossible)
					break;
				int bestDelta = 0;
				int bestX = -1, bestY = -1;
				for (int x = 0; x + H <= N; ++x)
				{
					for (int y = 0; y + W <= N; ++y)
					{
						int x2 = x + H, y2 = y + W;
						int s = pref[x2][y2] - pref[x][y2] - pref[x2][y] + pref[x][y];
						if (s < bestDelta)
						{
							bestDelta = s;
							bestX = x;
							bestY = y;
						}
					}
				}
				if (bestX == -1)
					break;
				for (int i = bestX; i < bestX + H; ++i)
				{
					for (int j = bestY; j < bestY + W; ++j)
					{
						if (A[i][j] == a)
							A[i][j] = b;
					}
				}
				out.emplace_back(id, bestX, bestY);
				++used[id];
			}
			if ((int)out.size() >= LIMIT)
				break;
		}
	}

	cout << out.size() << '\n';
	for (auto &tp : out)
	{
		int id, x, y;
		tie(id, x, y) = tp;
		cout << id << " " << x << " " << y << "\n";
	}
	return 0;
}
結果

問題	点数	言語	結果	実行時間	メモリ
A. Replace() は Replace() されました	0	C++ (gcc)	IE	0 ms	0 KiB
テストセット

テストセット	結果	得点	実行時間	メモリ
詳細結果

テストケース	結果	実行時間	メモリ