40pts悬棺

#include <queue>
#include <iostream>
#include <map>
#include <set>
#include <algorithm>
#include <string>
using namespace std;

int main() {
    int n = 0, ans = 0, cnt[100010] = {};
    cin >> n;
    queue<pair<int, int>> q;
    for (int i = 0; i < n; ++i) {
        int t = 0, k = 0;
        cin >> t >> k;
        for (int j = 0; j < k; ++j) {
            int x = 0;
            cin >> x;
            q.push({x, t});
            if ((++cnt[x]) == 1) ++ans;
            while (!q.empty() && q.front().second + 86400 <= t) {
                q.pop();
                if ((--cnt[q.front().first]) == 0) --ans;
            }
        }
        cout << ans << endl;
    }
    return 0;
}