P8843 [传智杯 #4 初赛] 萝卜数据库

#include <bits/stdc++.h>
#define bug printf("************************\n");
#define fuck(x) cout << #x << " -> " << x << endl
#define endl '\n'
#define int long long
using namespace std;
constexpr int N = 1e6, inf = 0x3f3f3f3f;
#define x first
#define y second
typedef pair<int, int> pii;
vector<pii> arr;
void solve()
{
    int n, k;
    cin >> n >> k;
    while (n--)
    {
        int op;
        cin >> op;
        if (op == 1)
        {
            int p;
            cin >> p;
            while (p--)
            {
                int a, b;
                cin >> a >> b;
                arr.push_back({b, a});
            }
        }
        else
        {
            int ans = 0;
            int tar;
            cin >> tar;
            int low, high;
            cin >> low >> high;
            for (auto it : arr)
            {
                if (it.first <= high && it.first >= low)
                {
                    if (it.second == tar)
                    {
                        ans++;
                    }
                }
            }
            cout << ans << endl;
        }
    }
}

signed main()
{
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    solve();

    return 0;
}