func_code_string: #include <bits/stdc++.h>   using namespace std;   inline const char nl =   n ;   inline const long long MOD = 1000000007;   inline const long double pi = 3.141592653589793238;   struct query {     int a, b;   } q[105];   bool vis[105];   int n, cnt;   void dfs(int x) {     vis[x] = 1;     for (int i = 1; i <= cnt; i++) {       query y = q[i];       if (vis[i]) continue;       if ((y.a < q[x].a && q[x].a < y.b) || (y.a < q[x].b && q[x].b < y.b))         dfs(i);     }   }   int main() {     cin >> n;     while (n--) {       int op, x, y;       cin >> op >> x >> y;       if (op == 1) q[++cnt].a = x, q[cnt].b = y;       if (op == 2) {         for (int i = 1; i <= 100; i++) vis[i] = 0;         dfs(x);         if (vis[y])           cout <<  YES n ;         else           cout <<  NO n ;       }     }     return 0;   }   