#include "ramen.h" /* * Author: Nonoze * Created: Friday 19/12/2025 */ #include <bits/stdc++.h> using namespace std; #ifndef DEBUG #define dbg(...) #endif // #define cout cerr << "OUT: " #define endl '\n' #define endlfl '\n' << flush #define quit(x) return (void)(cout << x << endl) template<typename T> void read(T& x) { cin >> x; } template<typename T1, typename T2> void read(pair<T1, T2>& p) { read(p.first), read(p.second); } template<typename T> void read(vector<T>& v) { for (auto& x : v) read(x); } template<typename T1, typename T2> void read(T1& x, T2& y) { read(x), read(y); } template<typename T1, typename T2, typename T3> void read(T1& x, T2& y, T3& z) { read(x), read(y), read(z); } template<typename T1, typename T2, typename T3, typename T4> void read(T1& x, T2& y, T3& z, T4& zz) { read(x), read(y), read(z), read(zz); } template<typename T> void print(vector<T>& v) { for (auto& x : v) cout << x << ' '; cout << endl; } #define sz(x) (int)(x.size()) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define make_unique(v) sort(all(v)), v.erase(unique(all(v)), (v).end()) #define pb push_back #define mp(a, b) make_pair(a, b) #define fi first #define se second #define cmin(a, b) a = min(a, b) #define cmax(a, b) a = max(a, b) #define YES cout << "YES" << endl #define NO cout << "NO" << endl #define QYES quit("YES") #define QNO quit("NO") #define double long double const int inf = numeric_limits<int>::max() / 4; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); const int MOD = 1e9+7, LOG=20; void Ramen(int N) { vector<vector<int>> mini(1); vector<vector<int>> maxi(1); for (int i=0; i+1<N; i+=2) { if (Compare(i, i+1)==1) { mini[0].pb(i+1); maxi[0].pb(i); } else { mini[0].pb(i); maxi[0].pb(i+1); } } if (N%2==1) { mini[0].pb(N-1); maxi[0].pb(N-1); } int level=0; while (sz(mini[level])>1) { mini.pb({}); maxi.pb({}); for (int i=0; i+1<sz(mini[level]); i+=2) { if (Compare(mini[level][i], mini[level][i+1])==1) { mini[level+1].pb(mini[level][i+1]); } else { mini[level+1].pb(mini[level][i]); } } if (sz(mini[level])%2==1) { mini[level+1].pb(mini[level].back()); } for (int i=0; i+1<sz(maxi[level]); i+=2) { if (Compare(maxi[level][i], maxi[level][i+1])==1) { maxi[level+1].pb(maxi[level][i]); } else { maxi[level+1].pb(maxi[level][i+1]); } } if (sz(maxi[level])%2==1) { maxi[level+1].pb(maxi[level].back()); } level++; } Answer(mini[level][0], maxi[level][0]); }