#682900 (C++11) No.1626 三角形の構築

提出ソース

結果

問題	No.1626 三角形の構築
ユーザー	leaf_1415
提出日時	2021-07-23 23:05:31
言語	C++11 (gcc 11.4.0)
結果	AC
実行時間	65 ms / 2,000 ms
コード長	7,757 bytes
コンパイル時間	1,564 ms
コンパイル使用メモリ	124,320 KB
実行使用メモリ	6,820 KB
最終ジャッジ日時	2024-10-12 11:44:52
合計ジャッジ時間	3,121 ms
ジャッジサーバーID （参考情報）	judge3 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	4 ms 6,820 KB
testcase_01	AC	21 ms 6,820 KB
testcase_02	AC	3 ms 6,816 KB
testcase_03	AC	3 ms 6,816 KB
testcase_04	AC	3 ms 6,820 KB
testcase_05	AC	3 ms 6,816 KB
testcase_06	AC	2 ms 6,816 KB
testcase_07	AC	17 ms 6,816 KB
testcase_08	AC	26 ms 6,816 KB
testcase_09	AC	32 ms 6,816 KB
testcase_10	AC	23 ms 6,816 KB
testcase_11	AC	31 ms 6,820 KB
testcase_12	AC	9 ms 6,816 KB
testcase_13	AC	11 ms 6,816 KB
testcase_14	AC	19 ms 6,816 KB
testcase_15	AC	10 ms 6,816 KB
testcase_16	AC	23 ms 6,816 KB
testcase_17	AC	19 ms 6,820 KB
testcase_18	AC	13 ms 6,820 KB
testcase_19	AC	24 ms 6,816 KB
testcase_20	AC	25 ms 6,820 KB
testcase_21	AC	22 ms 6,820 KB
testcase_22	AC	32 ms 6,816 KB
testcase_23	AC	27 ms 6,816 KB
testcase_24	AC	65 ms 6,820 KB
testcase_25	AC	3 ms 6,820 KB
testcase_26	AC	5 ms 6,816 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#include <unordered_set>
#include <unordered_map>
#define rep(x, s, t) for(llint x = (s); (x) <= (t); (x)++)
#define per(x, s, t) for(llint x = (s); (x) >= (t); (x)--)
#define reps(x, s) for(llint x = 0; (x) < (llint)(s).size(); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define sz(x) ((ll)(x).size())
#define ceil(x, y) (((x)+(y)-1) / (y))
#define all(x) (x).begin(),(x).end()
#define outl(...) dump_func(__VA_ARGS__)
#define outf(x) cout << fixed << setprecision(16) << (x) << endl
#define inf 1e18

using namespace std;

typedef long long llint;
typedef long long ll;
typedef pair<ll, ll> P;

struct edge{
	ll to, cost;
	edge(){}
	edge(ll a, ll b){ to = a, cost = b;}
};
const ll dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};

const ll mod = 1000000007;
//const ll mod = 998244353;

struct mint{
	ll x = 0;
	mint(ll y = 0){x = y; if(x < 0 || x >= mod) x = (x%mod+mod)%mod;}
	mint(const mint &ope) {x = ope.x;}
	
	mint operator-(){return mint(-x);}
	mint operator+(const mint &ope){return mint(x) += ope;}
	mint operator-(const mint &ope){return mint(x) -= ope;}
	mint operator*(const mint &ope){return mint(x) *= ope;}
	mint operator/(const mint &ope){return mint(x) /= ope;}
	mint& operator+=(const mint &ope){
		x += ope.x;
		if(x >= mod) x -= mod;
		return *this;
	}
	mint& operator-=(const mint &ope){
		x += mod - ope.x;
		if(x >= mod) x -= mod;
		return *this;
	}
	mint& operator*=(const mint &ope){
		x *= ope.x, x %= mod;
		return *this;
	}
	mint& operator/=(const mint &ope){
		ll n = mod-2; mint mul = ope;
		while(n){
			if(n & 1) *this *= mul;
			mul *= mul;
			n >>= 1;
		}
		return *this;
	}
	mint inverse(){return mint(1) / *this;}
	bool operator ==(const mint &ope){return x == ope.x;}
	bool operator !=(const mint &ope){return x != ope.x;}
};
mint modpow(mint a, ll n){
	if(n == 0) return mint(1);
	if(n % 2) return a * modpow(a, n-1);
	else return modpow(a*a, n/2);
}
istream& operator >>(istream &is, mint &ope){
	ll t; is >> t, ope.x = t;
	return is;
}
ostream& operator <<(ostream &os, mint &ope){return os << ope.x;}
ostream& operator <<(ostream &os, const mint &ope){return os << ope.x;}

vector<mint> fact, fact_inv;
void make_fact(int n){
	fact.resize(n+1), fact_inv.resize(n+1);
	fact[0] = mint(1); rep(i, 1, n) fact[i] = fact[i-1] * mint(i);
	fact_inv[n] = fact[n].inverse(); per(i, n-1, 0) fact_inv[i] = fact_inv[i+1] * mint(i+1);
}
mint comb(ll n, ll k){ if(n < 0 || k < 0 || n < k) return mint(0); return fact[n] * fact_inv[k] * fact_inv[n-k];}
mint perm(ll n, ll k){ return comb(n, k) * fact[k]; }

vector<int> prime, pvec;
void make_prime(int n){
	prime.resize(n+1);
	rep(i, 2, n){
		if(prime[i]) continue;
		for(int j = i; j <= n; j+=i) prime[j] = i;
	}
	rep(i, 2, n) if(prime[i] == i) pvec.push_back(i);
}

bool exceed(ll x, ll y, ll m){return x >= m / y + 1;}
void mark(){ cout << "*" << endl; }
void yes(){ cout << "YES" << endl; }
void no(){ cout << "NO" << endl; }
ll sgn(ll x){ if(x > 0) return 1; if(x < 0) return -1; return 0;}
ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);}
ll lcm(ll a, ll b){return a/gcd(a, b)*b;}
ll digitnum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret++; return ret;}
ll digitsum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret += x % b; return ret;}
string lltos(ll x){string ret; for(;x;x/=10) ret += x % 10 + '0'; reverse(ret.begin(), ret.end()); return ret;}
ll stoll(string &s){ll ret = 0; for(auto c : s) ret *= 10, ret += c - '0'; return ret;}
template<typename T>
void uniq(T &vec){ sort(vec.begin(), vec.end()); vec.erase(unique(vec.begin(), vec.end()), vec.end());}

template<class S, class T> pair<S, T>& operator+=(pair<S,T> &s, const pair<S,T> &t){
	s.first += t.first, s.second += t.second;
	return s;
}
template<class S, class T> pair<S, T>& operator-=(pair<S,T> &s, const pair<S,T> &t){
	s.first -= t.first, s.second -= t.second;
	return s;
}
template<class S, class T> pair<S, T> operator+(const pair<S,T> &s, const pair<S,T> &t){
	return pair<S,T>(s.first+t.first, s.second+t.second);
}
template<class S, class T> pair<S, T> operator-(const pair<S,T> &s, const pair<S,T> &t){
	return pair<S,T>(s.first-t.first, s.second-t.second);
}
template<typename T>
ostream& operator << (ostream& os, vector<T>& vec) {
	for(int i = 0; i < vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : " ");
	return os;
}
template<typename T>
ostream& operator << (ostream& os, deque<T>& deq) {
	for(int i = 0; i < deq.size(); i++) os << deq[i] << (i + 1 == deq.size() ? "" : " ");
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, pair<T, U>& pair_var) {
	os << "(" << pair_var.first << ", " << pair_var.second << ")";
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, const pair<T, U>& pair_var) {
	os << "(" << pair_var.first << ", " << pair_var.second << ")";
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, map<T, U>& map_var) {
	for(typename map<T, U>::iterator itr = map_var.begin(); itr != map_var.end(); itr++) {
		os << "(" << itr->first << ", " << itr->second << ")";
		itr++; if(itr != map_var.end()) os << ","; itr--;
	}
	return os;
}
template<typename T>
ostream& operator << (ostream& os, set<T>& set_var) {
	for(typename set<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {
		os << *itr; ++itr; if(itr != set_var.end()) os << " "; itr--;
	}
	return os;
}
template<typename T>
ostream& operator << (ostream& os, multiset<T>& set_var) {
	for(typename multiset<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {
		os << *itr; ++itr; if(itr != set_var.end()) os << " "; itr--;
	}
	return os;
}
template<typename T>
void outa(T a[], ll s, ll t){for(ll i = s; i <= t; i++){ cout << a[i]; if(i < t) cout << " ";}cout << endl;}
void dump_func(){cout << endl;}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail) {
	cout << head;
	if(sizeof...(Tail) > 0) cout << " ";
	dump_func(std::move(tail)...);
}

typedef pair<ll, P> Q;

ll T;
vector<P> vec;
vector<ll> dvec;

void dfs(int p, ll m)
{
	if(p == sz(vec)){
		dvec.push_back(m);
		return;
	}
	
	ll mul = m;
	rep(i, 0, vec[p].second){
		dfs(p+1, mul);
		mul *= vec[p].first;
	}
}

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	make_prime(100005);
	
	cin >> T;
	
	ll s, t;
	while(T--){
		cin >> s >> t;
		if(t % 2){
			outl(0);
			continue;
		}
		t /= 2;
		
		if(s*s%t){
			outl(0);
			continue;
		}
		
		map<ll, ll> mp;
		ll x = s;
		for(auto p : pvec){
			while(x % p == 0){
				mp[p]++;
				x /= p;
			}
		}
		if(x > 1) mp[x]++;
		for(auto &p : mp) p.second *= 2;
		
		x = t;
		for(auto p : pvec){
			while(x % p == 0){
				mp[p]--;
				x /= p;
			}
		}
		if(x > 1) mp[x]--;
		
		vec.clear(), dvec.clear();
		for(auto p : mp) vec.push_back(p);
		dfs(0, 1);
		sort(all(dvec));
		
		s = s*s/t;
		
		vector<Q> ans;
		reps(i, dvec){
			if(dvec[i] >= t) break;
			rep(j, i, sz(dvec)-1){
				if(dvec[j] >= t) break;
				if(exceed(dvec[i], dvec[j], s)) break;
				if(s % (dvec[i]*dvec[j])) continue;
				
				ll rem = s / (dvec[i]*dvec[j]);
				if(rem >= t) continue;
				if(rem < dvec[j]) break;
				
				ll a = t-rem, b = t-dvec[j], c = t-dvec[i];
				if((a+b+c) != t*2) continue;
				ans.push_back(Q(a, P(b, c)));
			}
		}
		
		outl(sz(ans));
		for(auto q : ans) cout << q.first << " " << q.second.first << " " << q.second.second << "\n";
	}
	
	return 0;
}

yukicoder

結果

テストケース

ソースコード