#991514 (C++23) No.2797 Square Tile

• 問題: No.2797 Square Tile
• ユーザー: sgfc
• 提出日時: 2024-06-28 22:17:08
• 言語: C++23 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 87 ms / 2,000 ms
• コード長: 4,419 bytes
• コンパイル時間: 5,865 ms
• コンパイル使用メモリ: 323,888 KB
• 実行使用メモリ: 6,016 KB
• 最終ジャッジ日時: 2024-06-28 22:17:16
• 合計ジャッジ時間: 8,016 ms
• ジャッジサーバーID （参考情報）: judge4 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	87 ms; 6,016 KB
testcase_05	AC	78 ms; 5,632 KB
testcase_06	AC	47 ms; 5,376 KB
testcase_07	AC	3 ms; 5,376 KB
testcase_08	AC	9 ms; 5,376 KB
testcase_09	AC	39 ms; 5,376 KB
testcase_10	AC	59 ms; 5,376 KB
testcase_11	AC	29 ms; 5,376 KB
testcase_12	AC	36 ms; 5,376 KB
testcase_13	AC	10 ms; 5,376 KB
testcase_14	AC	41 ms; 5,376 KB
testcase_15	AC	26 ms; 5,376 KB
testcase_16	AC	16 ms; 5,376 KB
testcase_17	AC	9 ms; 5,376 KB
testcase_18	AC	7 ms; 5,376 KB
testcase_19	AC	38 ms; 5,376 KB
testcase_20	AC	26 ms; 5,376 KB
testcase_21	AC	62 ms; 5,376 KB
testcase_22	AC	10 ms; 5,376 KB

ソースコード

#include "bits/stdc++.h"

#include <stdio.h>
#include <math.h>

#include "atcoder/all"
#include <float.h>

//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;

using namespace std;
using namespace atcoder;

using ll = long long;
using ull = unsigned long long;
using mint = modint998244353;
using mint2 = modint1000000007;
const double eps = 1e-9;

#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define REPI(i, init, n) for (ll i = init; i < ll(n); ++i)
#define REPD(i, init) for (ll i = init; i >=0; --i)
#define REPDI(i, init, n) for (ll i = init; i >=n; --i)
#define REPE(i, c) for (const auto& i : c)
#define TCASE() ll _ttt; cin >> _ttt; while(_ttt--)

using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>;
#define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;
#define DLI(a, n) deque<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;
#define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x;
#define VVLI(a, n, m, init) vector<vector<ll>> a(n); for(auto& x : a) x.assign(m, init);
using vd = vector<double>; using pl = pair<ll, ll>; using vpl = vector<pl>;

struct uv { ll u; ll v; ll c; };
#define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0, 1}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;}
#define VUVCI(a, n) vector<uv> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;}
vvl to_edge(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].push_back(x.v); return ret; }
vvl to_edge_d(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].push_back(x.v); ret[x.v].push_back(x.u); } return ret; }

template <class T = long long> using pql = priority_queue<T>;
template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>;
using vm = vector<mint>; using vvm = vector<vm>;

ostream& operator<<(ostream& os, const mint& v) { os << v.val(); return os; }
void yn(bool f) { std::cout << (f ? "Yes" : "No") << endl; };
template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } };
template<> void ov(const vm& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << it->val(); } };

const ll llhuge = 1LL << 62; //十分でかいが多少足しても溢れない数値
auto gmax(const auto& a, const auto& b) { return a > b ? a : b; };
auto gmin(const auto& a, const auto& b) { return a < b ? a : b; };
bool chmin(auto& a, const auto& b) { const bool ret = a > b; a = gmin(a, b); return ret; }
bool chmax(auto& a, const auto& b) { const bool ret = a < b; a = gmax(a, b); return ret; }
void sort(auto& v) { std::ranges::sort(v); };
void rev(auto& v) { std::ranges::reverse(v); };
template<class T> auto p_sum(const T& v) { T ret(v.size()); std::partial_sum(begin(v), end(v), ret.begin()); return ret; };
template<class T, class K = T::key_type, class V = T::mapped_type> [[nodiscard]] V myat(const T& mp, const K& key) { return mp.find(key) == mp.end() ? V() : mp.at(key); }
long long ceil(const long long a, const long long b) { return (a + b - 1) / b; }

int main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	ll a, b;
	cin >> a >> b;

	ll l = a * a + b * b;

	set<pl> sa;
	set<pl> sb;

	queue<pl> qa;
	queue<pl> qb;

	qa.push({ 0, 0 });
	qb.push({ a, 0 });

	while (!qa.empty()) {
		auto [x, y] = qa.front();
		qa.pop();

		vpl v(4, { x, y });
		v[0].first += a;
		v[0].second += b;
		v[1].first += b;
		v[1].second -= a;
		v[2].first -= a;
		v[2].second -= b;
		v[3].first -= b;
		v[3].second += a;

		REP(i, 4) {
			v[i].first += l;
			v[i].first %= l;
			v[i].second += l;
			v[i].second %= l;
		}

		REP(i, 4) {
			if (sa.find(v[i]) == sa.end()) {
				sa.insert(v[i]);
				qa.push(v[i]);
			}
		}
	}

	while (!qb.empty()) {
		auto [x, y] = qb.front();
		qb.pop();

		vpl v(4, { x, y });
		v[0].first += a;
		v[0].second += b;
		v[1].first += b;
		v[1].second -= a;
		v[2].first -= a;
		v[2].second -= b;
		v[3].first -= b;
		v[3].second += a;

		REP(i, 4) {
			v[i].first += l;
			v[i].first %= l;
			v[i].second += l;
			v[i].second %= l;
		}

		REP(i, 4) {
			if (sb.find(v[i]) == sb.end()) {
				sb.insert(v[i]);
				qb.push(v[i]);
			}
		}
	}

	REPE(e, sa) {
		cout << e.first << " " << e.second << endl;
	}
	REPE(e, sb) {
		cout << e.first << " " << e.second << endl;
	}

}