mmrz's library

This documentation is automatically generated by online-judge-tools/verification-helper

---

Project maintained by mm-rz Hosted on GitHub Pages — Theme by mattgraham

verify/yosupo/stern_brocot_tree.test.cpp

• View this file on GitHub
• Last update: 2025-07-01 03:22:56+09:00
• Problem: https://judge.yosupo.jp/problem/stern_brocot_tree

Depends on

• stern_brocot_tree (math/stern_brocot_tree.hpp)
• template/template.hpp

Code

#define PROBLEM "https://judge.yosupo.jp/problem/stern_brocot_tree"

#include "./../../template/template.hpp"
#include "./../../math/stern_brocot_tree.hpp"

using namespace mmrz;

void SOLVE(){
	string op;
	cin >> op;
	if(op == "ENCODE_PATH"){
		ll a, b;
		cin >> a >> b;
		vector<ll> path = sbt::encode_path(a, b);
		if(path.empty())cout << 0;
		else if(path.front() == 0)cout << ssize(path) - 1;
		else cout << ssize(path) << " R " << path.front();
		
		for(int i = 1; i < ssize(path); i++){
			cout << (i % 2 == 0 ? " R " : " L ") << path[i];
		}
		cout << "\n";
	}else if(op == "DECODE_PATH"){
		int k;
		cin >> k;
		vector<ll> path;
		rep(i, k){
			char c;
			ll x;
			cin >> c >> x;
			if(i == 0 && c == 'L'){
				path.emplace_back(0);
			}
			path.emplace_back(x);
		}
		auto [p, q, r, s] = sbt::decode_path(path);
		cout << p+r << ' ' << q+s << '\n';
	}else if(op == "LCA"){
		ll a, b, c, d;
		cin >> a >> b >> c >> d;
		auto [p, q, r, s] = sbt::lca(a, b, c, d);
		cout << p+r << ' ' << q+s << '\n';
	}else if(op == "ANCESTOR"){
		ll k, a, b;
		cin >> k >> a >> b;
		auto ret = sbt::ancestor(a, b, k);
		if(!ret){
			cout << "-1\n";
		}else{
			auto [p, q, r, s] = ret.value();
			cout << p+r << ' ' << q+s << '\n';
		}
	}else{
		ll a, b;
		cin >> a >> b;
		auto [p, q, r, s] = sbt::range(a, b);
		cout << p << ' ' << q << ' ' << r << ' ' << s << '\n';
	}
}

void mmrz::solve(){
	int t = 1;
	cin >> t;
	while(t--)SOLVE();
}

#line 1 "verify/yosupo/stern_brocot_tree.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/stern_brocot_tree"

#line 1 "template/template.hpp"
# include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const double pi = acos(-1);
template<class T>constexpr T inf() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T hinf() { return inf<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); }
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); }
template<class T> bool chmin(T& a,T b) { if(a > b){a = b; return true;} return false; }
template<class T> bool chmax(T& a,T b) { if(a < b){a = b; return true;} return false; }
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(ll n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(ll n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
ll gcd(ll a, ll b) { if (b == 0)return a; return gcd(b, a%b); };
ll lcm(ll a, ll b) { ll g = gcd(a, b); return a / g*b; };
ll MOD(ll x, ll m){return (x%m+m)%m; }
ll FLOOR(ll x, ll m) {ll r = (x%m+m)%m; return (x-r)/m; }
template<class T> using dijk = priority_queue<T, vector<T>, greater<T>>;
# define all(qpqpq)           (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw)        (wpwpw).erase(unique(all((wpwpw))),(wpwpw).end())
# define LOWER(epepe)         transform(all((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr)         transform(all((rprpr)),(rprpr).begin(),TU<char>)
# define rep(i,upupu)         for(ll i = 0, i##_len = (upupu);(i) < (i##_len);(i)++)
# define reps(i,opopo)        for(ll i = 1, i##_len = (opopo);(i) <= (i##_len);(i)++)
# define len(x)                ((ll)(x).size())
# define bit(n)               (1LL << (n))
# define pb push_back
# define eb emplace_back
# define exists(c, e)         ((c).find(e) != (c).end())

struct INIT{
	INIT(){
		std::ios::sync_with_stdio(false);
		std::cin.tie(0);
		cout << fixed << setprecision(20);
	}
}INIT;

namespace mmrz {
	void solve();
}

int main(){
	mmrz::solve();
}
#line 2 "math/stern_brocot_tree.hpp"

#line 4 "math/stern_brocot_tree.hpp"
#include<optional>
#include<ranges>
#line 8 "math/stern_brocot_tree.hpp"

namespace sbt{

	template<class T>
	std::tuple<T, T, T, T> child(T p, T q, T r, T s, T d, bool is_left){
		if(is_left){
			r += d*p;
			s += d*q;
		}else{
			p += d*r;
			q += d*s;
		}
		return std::make_tuple(p, q, r, s);
	}

	template<class T>
	std::tuple<T, T, T, T> parent(T p, T q, T r, T s){
		if(p == 0 && q == 1 && r == 1 && s == 0){
			return std::make_tuple(0, 0, 0, 0);
		}
		if(p < r || q < s){
			r -= p, s -= q;
		}else{
			p -= r, q -= s;
		}
		return std::make_tuple(p, q, r, s);
	}

	template<class T>
	std::vector<T> encode_path(T p, T q){
		std::vector<T> a;
		if(p < q){
			a.emplace_back(0);
			std::swap(p, q);
		}
		while(p != 1){
			a.emplace_back(p/q);
			p %= q;
			std::swap(p, q);
		}
		if(not a.empty()){
			if(a.back() == 1){
				a.pop_back();
			}else{
				a.back()--;
			}
		}
		return a;
	}

	template<class T>
	std::tuple<T, T, T, T> decode_path(const std::vector<T> &a){
		T p = 0, q = 1, r = 1, s = 0;
		for(int i = 0;i < std::ssize(a);i++){
			std::tie(p, q, r, s) = child(p, q, r, s, a[i], i&1);
		}
		return std::make_tuple(p, q, r, s);
	}

	template<class T>
	std::tuple<T, T, T, T> lca(T p, T q, T r, T s){
		std::vector<T> a = encode_path(p, q), b = encode_path(r, s);

		int n = std::min(std::ssize(a), std::ssize(b));

		T P = 0, Q = 1, R = 1, S = 0;
		for(int i = 0;i < n;i++){
			T c = std::min(a[i], b[i]);
			std::tie(P, Q, R, S) = child(P, Q, R, S, c, i&1);
			if(a[i] != b[i])break;
		}
		return std::make_tuple(P, Q, R, S);
	}

	template<class T>
	std::optional<std::tuple<T, T, T, T>> ancestor(T p, T q, T d){
		std::vector<T> a = encode_path(p, q);
		T P = 0, Q = 1, R = 1, S = 0;
		for(int i = 0;i < std::ssize(a);i++){
			T c = std::min(d, a[i]);
			std::tie(P, Q, R, S) = child(P, Q, R, S, c, i&1);
			d -= c;
			if(d == 0)break;
		}
		if(d == 0){
			return std::make_tuple(P, Q, R, S);
		}
		return std::nullopt;
	}

	template<class T>
	std::tuple<T, T, T, T> range(T p, T q){
		return decode_path(encode_path(p, q));
	}
}
#line 5 "verify/yosupo/stern_brocot_tree.test.cpp"

using namespace mmrz;

void SOLVE(){
	string op;
	cin >> op;
	if(op == "ENCODE_PATH"){
		ll a, b;
		cin >> a >> b;
		vector<ll> path = sbt::encode_path(a, b);
		if(path.empty())cout << 0;
		else if(path.front() == 0)cout << ssize(path) - 1;
		else cout << ssize(path) << " R " << path.front();
		
		for(int i = 1; i < ssize(path); i++){
			cout << (i % 2 == 0 ? " R " : " L ") << path[i];
		}
		cout << "\n";
	}else if(op == "DECODE_PATH"){
		int k;
		cin >> k;
		vector<ll> path;
		rep(i, k){
			char c;
			ll x;
			cin >> c >> x;
			if(i == 0 && c == 'L'){
				path.emplace_back(0);
			}
			path.emplace_back(x);
		}
		auto [p, q, r, s] = sbt::decode_path(path);
		cout << p+r << ' ' << q+s << '\n';
	}else if(op == "LCA"){
		ll a, b, c, d;
		cin >> a >> b >> c >> d;
		auto [p, q, r, s] = sbt::lca(a, b, c, d);
		cout << p+r << ' ' << q+s << '\n';
	}else if(op == "ANCESTOR"){
		ll k, a, b;
		cin >> k >> a >> b;
		auto ret = sbt::ancestor(a, b, k);
		if(!ret){
			cout << "-1\n";
		}else{
			auto [p, q, r, s] = ret.value();
			cout << p+r << ' ' << q+s << '\n';
		}
	}else{
		ll a, b;
		cin >> a >> b;
		auto [p, q, r, s] = sbt::range(a, b);
		cout << p << ' ' << q << ' ' << r << ' ' << s << '\n';
	}
}

void mmrz::solve(){
	int t = 1;
	cin >> t;
	while(t--)SOLVE();
}

Back to top page