CF-1016-D. Skibidi Table · znzryb
## 思路讲解
其实这个题面应该是一个很经典的类似于莫顿编码的东西。
::: 莫顿编码图片
:::
当然，和莫顿编码还是稍微有点区别
思路就是针对每个询问递归的找就行了。
## AC代码
[https://codeforces.com/contest/2093/my](https://codeforces.com/contest/2093/my)
::: 源代码
```cpp
// Problem: D. Skibidi Table
// Contest: Codeforces - Codeforces Round 1016 (Div. 3)
// URL: https://codeforces.com/contest/2093/problem/D
// Memory Limit: 256 MB
// Time Limit: 2000 ms
// by znzryb
//
// Powered by CP Editor (https://cpeditor.org)
#include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define ROF(i, a, b) for (int i = (a); i >= (b); --i)
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define fi first
#define se second
#define pb push_back
#define SZ(a) ((int) a.size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 i128;
typedef pair<ll,ll> pll;
typedef array<ll,3> arr;
typedef double DB;
typedef pair<DB,DB> pdd;
typedef pair<ll,bool> plb;
constexpr ll MAXN=static_cast<ll>(1e6)+10,INF=static_cast<ll>(5e18)+3;
ll N,Q,T,A[MAXN];
inline ll binpow(ll x,ll k){ // 哈哈，复习一下快速幂
ll res=1;
while(k){
if(k&1) res*=x;
x*=x;
k>>=1;
}
return res;
}
inline bool isIn(ll x,ll y,ll x1,ll y1,ll x2,ll y2){
if(x<x1 || x>x2) return false;
if(y<y1 || y>y2) return false;
return true;
}
/*
1 4
3 2
*/
ll findNum(ll x,ll y,ll x1,ll y1,ll x2,ll y2,ll l,ll r){
if(l==r) return l;
ll midx=x1+x2>>1,midy=y1+y2>>1;
ll divPt1=l+(r-l)/4+1,divPt2=l+(r-l)/2+1,divPt3=l+3*(r-l)/4+1;
if(isIn(x,y,x1,y1,midx,midy)){
return findNum(x,y,x1,y1,midx,midy,l,divPt1-1);
}else if(isIn(x,y,midx+1,midy+1,x2,y2)){
return findNum(x,y,midx+1,midy+1,x2,y2,divPt1,divPt2-1);
}else if(isIn(x,y,midx+1,y1,x2,midy)){
return findNum(x,y,midx+1,y1,x2,midy,divPt2,divPt3-1);
}else{
return findNum(x,y,x1,midy+1,midx,y2,divPt3,r);
}
}
pll findPos(ll num,ll x1,ll y1,ll x2,ll y2,ll l,ll r){
if(x1==x2 && y1==y2) return {x1,y1};
ll midx=x1+x2>>1,midy=y1+y2>>1;
ll divPt1=l+(r-l)/4+1,divPt2=l+(r-l)/2+1,divPt3=l+3*(r-l)/4+1;
// #ifdef LOCAL
// cerr << x1<<" "<<y1<<" "<<x2<<" "<<y2<<" lr:"<<l<<" "<<r<<" "<<divPt1<<" "<<divPt2<<" "<<divPt3 << '\n';
// #endif
if(num>=l && num<divPt1){
return findPos(num,x1,y1,midx,midy,l,divPt1-1);
}else if(num>=divPt1 && num<divPt2){
return findPos(num,midx+1,midy+1,x2,y2,divPt1,divPt2-1);
}else if(num>=divPt2 && num<divPt3){
return findPos(num,midx+1,y1,x2,midy,divPt2,divPt3-1);
}else{
return findPos(num,x1,midy+1,midx,y2,divPt3,r);
}
}
inline void solve(){
cin>>N>>Q;
FOR(i,1,Q){
char op1,op2;
cin>>op1>>op2;
if(op2=='>'){
ll x,y;
cin>>x>>y;
cout<<findNum(x,y,1,1,binpow(2,N),binpow(2,N),1,binpow(2,2*N))<<"\n";
// #ifdef LOCAL
// cerr << "OK1" << '\n';
// #endif
}else{
ll num;
cin>>num;
pll res=findPos(num,1,1,binpow(2,N),binpow(2,N),1,binpow(2,2*N));
cout<<res.fi<<" "<<res.se<<"\n";
}
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
cin>>T;
while(T--){
solve();
}
// solve();
return 0;
}
/*
AC
https://codeforces.com/contest/2093/submission/314848827
*/
```
:::
## 心路历程（WA，TLE，MLE……）