#458971 (C++17) No.1019 最小格子三角形

• 問題: No.1019 最小格子三角形
• ユーザー: satashun
• 提出日時: 2020-04-05 03:05:49
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 739 ms / 2,000 ms
• コード長: 3,082 bytes
• コンパイル時間: 2,132 ms
• コンパイル使用メモリ: 209,952 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-07-03 07:57:56
• 合計ジャッジ時間: 11,504 ms
• ジャッジサーバーID （参考情報）: judge5 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	1 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	1 ms; 5,376 KB
testcase_05	AC	1 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	2 ms; 5,376 KB
testcase_08	AC	2 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	2 ms; 5,376 KB
testcase_11	AC	2 ms; 5,376 KB
testcase_12	AC	2 ms; 5,376 KB
testcase_13	AC	513 ms; 5,376 KB
testcase_14	AC	679 ms; 5,376 KB
testcase_15	AC	654 ms; 5,376 KB
testcase_16	AC	506 ms; 5,376 KB
testcase_17	AC	599 ms; 5,376 KB
testcase_18	AC	545 ms; 5,376 KB
testcase_19	AC	611 ms; 5,376 KB
testcase_20	AC	510 ms; 5,376 KB
testcase_21	AC	569 ms; 5,376 KB
testcase_22	AC	662 ms; 5,376 KB
testcase_23	AC	714 ms; 5,376 KB
testcase_24	AC	716 ms; 5,376 KB
testcase_25	AC	739 ms; 5,376 KB
testcase_26	AC	710 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using pii = pair<int, int>;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define ALL(c) (c).begin(),(c).end()

#ifdef LOCAL
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else 
#define dump(x) true
#endif

constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }

template<class T, class U> void chmin(T& t, const U& u) { if (t > u) t = u; }
template<class T, class U> void chmax(T& t, const U& u) { if (t < u) t = u; }

template<class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
	os<<"("<<p.first<<","<<p.second<<")";
	return os;
}

template<class T>
ostream& operator<<(ostream& os, const vector<T>& v) {
	os<<"{";
	rep(i, v.size()) {
		if (i) os<<",";
		os<<v[i];
	}
	os<<"}";
	return os;
}

template <unsigned int MOD>
struct ModInt {
	using uint = unsigned int;
	using ull = unsigned long long;
	using M = ModInt;

	uint v;

	ModInt(ll _v = 0) { set_norm(_v % MOD + MOD); }
	M& set_norm(uint _v) { //[0, MOD * 2)->[0, MOD)
		v = (_v < MOD) ? _v : _v - MOD;
		return *this;
	}

	explicit operator bool() const { return v != 0; }
	M operator+(const M& a) const { return M().set_norm(v + a.v); }
	M operator-(const M& a) const { return M().set_norm(v + MOD - a.v); }
	M operator*(const M& a) const { return M().set_norm(ull(v) * a.v % MOD); }
	M operator/(const M& a) const { return *this * a.inv(); }
	M& operator+=(const M& a) { return *this = *this + a; }
	M& operator-=(const M& a) { return *this = *this - a; }
	M& operator*=(const M& a) { return *this = *this * a; }
	M& operator/=(const M& a) { return *this = *this / a; }
	M operator-() const { return M() - *this; }
	M& operator++(int) { return *this = *this + 1; }
	M& operator--(int) { return *this = *this - 1; }

	M pow(ll n) const {
		if (n < 0) return inv().pow(-n);
		M x = *this, res = 1;
		while (n) {
			if (n & 1) res *= x;
			x *= x;
			n >>= 1;
		}
		return res;
	}

	M inv() const {
		ll a = v, b = MOD, p = 1, q = 0, t;
		while (b != 0) {
			t = a / b;
			swap(a -= t * b, b);
			swap(p -= t * q, q);
		}
		return M(p);
	}

	bool operator==(const M& a) const { return v == a.v; }
	bool operator!=(const M& a) const { return v != a.v; }
	friend ostream& operator<<(ostream& os, const M& a) { return os << a.v; }
	static int get_mod() { return MOD; }	
};

using Mint = ModInt<998244353>;

//sum of abs(x) + abs(y)

Mint calc_all(ll n) { //do not care about gcd
	Mint res;
	for (ll x = 1; x * x <= n; ++x) {
		ll y = (ll)sqrt(n - x * x) * 2 + 1;
		res += (Mint)y * x * 2;
	}
	return res * 2;
}

map<ll, Mint> dp;

Mint calc(ll n) {
	if (dp.count(n)) {
		return dp[n];
	}
	Mint x = calc_all(n);
	for (ll d = 2; d * d <= n; ++d) {
		x -= calc(n / d / d) * d; 
	}
	return dp[n] = x;
}

int main() {
	ll N; cin >> N;
	auto ret = calc(N);
	cout << ret * 6 - 16 << endl;

	return 0;
}