1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"CodeViewer"] 1c:T5e3,#include using namespace std; #define int long long const int LOG = 20; int dp[LOG][300000]; int32_t main() { ios::sync_with_stdio(0);cin.tie(0); int n; cin >> n; vector> a(n), ast; vector num(2*n); for(int i=0; i> a[i].first >> a[i].second; num[2*i] = a[i].first; num[2*i+1] = a[i].second; } sort(num.begin(), num.end()); num.erase(unique(num.begin(), num.end()), num.end()); for(int i=0; i> q; while(q--) { int x, y; cin >> x >> y; x--, y--; if((a[y].first <= a[x].first && a[x].first <= a[y].second) || (a[y].first <= a[x].second && a[x].second <= a[y].second) || (a[x].first <= a[y].first && a[y].first <= a[x].second)) { cout << "1\n"; continue; } if(a[x].first > a[y].first) swap(x, y); int t = a[x].second, ans = 2; for(int i=LOG-1; i>=0; i--) { if(dp[i][t] < a[y].first) { t = dp[i][t]; ans += (1<

코드 #5231