Winter Vacation Training Topic Set 2B - Harbor

B - Harbor

topic background

NOIP2016 Popularization Group T3

topic description

Little K is a customs officer at a seaport. Many ships arrive at the seaport every day, and there are usually many passengers from different countries on board.

Little K is very interested in these ships arriving at the harbor, and he recorded the situation of each ship arriving at the harbor according to time $i$ ship arrived, he recorded the arrival time$t_i$(unit: second), the number of passengers on board $k_i$, and each passenger's nationality $x_{i,1},x_{i,2},\dots ,x_{i,k}$。

Little K has counted $The\; information\; of\; n$ ships, I hope you can help to calculate 24 24from the arrival time of each ship$24$ hours ($24$ hours$=86400$ seconds) how many different countries all passengers arriving by boat come from.

Formally, you need to compute $n$ pieces of information. For output$For\; i$ pieces of information, you need to count$t_i-86400<t_p\le t_i$ship $p$ , in all$x_{p,j}$, how many different numbers are there in total.

input format

Enter a positive integer $n$ , means small K counts$Information\; about\; n$ ships.

Next $n$ lines, each line describes the information of a ship: the first two integers$t_i$sum $k_i$Respectively indicate the time when the ship arrives at the harbor and the number of passengers on board, then $k_i$Integers $x_{i,j}$Indicates the nationality of the passengers on board.

Guaranteed input $t_i$It is incremental, and the unit is second; it means that the timing starts from the first time when K starts to go to work, and the ship is at the t $t_i$Seconds to the harbor.

Guarantee that $1\le n\le 10^5$，$\sum{k_i} \le 3\times 10^5 $，$1\le x_{i,j}\le 10^5$ ,$1\le t_{i-1}\le t_i\le 10^9$。

Among them $\sum k_i$means all $k_i$of and.

output format

output nnline$n$$Line\; i$ outputs an integer representing theiiStats after$i\; ship\; arrives.$

Example #1

Sample Input #1

3
1 4 4 1 2 2
2 2 2 3
10 1 3

Sample output #1

3
4
4

Example #2

Sample Input #2

4
1 4 1 2 2 3
3 2 2 3
86401 2 3 4
86402 1 5

Sample output #2

3
3
3
4

hint

[Example Explanation 1]

first boat at $1$ second to reach the harbor, nearest24 24The boat that arrived in$24$$4$ passengers from countries$4,1,2,2$ of 3 out of$3$ different countries;

second boat at $2$ seconds to reach the harbor, nearest24 24The boats arriving in$24$$4+2=6$ passengers from countries$4,1,2,2,2,3$ out of$4$ different countries;

3rd boat at $10$ seconds to reach the harbor, nearest24 24The ships arriving in$24$$4+2+1=7$ passengers from countries$4,1,2,2,2,3,3$ out of$4$ different countries.

[Example Explanation 2]

first boat at $1$ second to reach the harbor, nearest24 24The boat that arrived in$24$$4$ passengers from countries$1,2,2,3$ of 3 from$3$ different countries.

second boat at $3$ seconds to reach the harbor, nearest24 24The ships arriving in$24$$4+2=6$ passengers from countries$1,2,2,3,2,3$ of 3 from$3$ different countries.

The third boat is at $86401$ seconds to reach the harbor, the nearest24 24The ships arriving in$24$$2+2=4$ passengers from countries$2,3,3,4$ of$3$ different countries.

The fourth boat is at $86402$ seconds to reach the harbor, the nearest24 24The ships arriving in$24$$2+2+1=5$ passengers from countries$2,3,3,4,5$ of 4 out of$4$ different countries.

【data range】

• For $10\%$ 的测试点，$n=1,\sum k_i\le 10,1\le x_{i,j}\le 10,1\le t_i\le 10$。
• For $20\%$ 的测试点，$1\le n\le 10,\sum k_i\le 100,1\le x_{i,j}\le 100,1\le t_i\le 32767$。
• For $40\%$ 的测试点，$1\le n\le 100,\sum k_i\le 100,1\le x_{i,j}\le 100,1\le t_i\le 86400$。
• For $70\%$ 的测试点，$1\le n\le 1000,\sum k_i\le 3000,1\le x_{i,j}\le 1000,1\le t_i\le 10^9$。
• For $100\%$ 的测试点，$1\le n\le 10^5,\sum k_i\le 3\times 10^5,1\le x_{i,j}\le 10^5,1\le t_i\le 10^9$。

answer

You can use an array plus a queue. The array is used to record the corresponding number of people in each city, and the queue is used to record the sequence. These data are not always valid. As long as the time and current of the ship that first came in exceed 86400, we will It can be discarded, which means that it can be dequeued. The title says that the input time is incremental, so it can be dequeued directly.

Every time we input, we judge, if the current array corresponds to 0, it means that there is no such city, we add one to the city, and then put it in the queue, after inputting, we start to judge, if the head of the queue exceeds 24 hours , Then discard, subtract one from the corresponding city array, and then check whether the array is 0 now, if it is 0, it means that the city is gone, we subtract one from cnt, and then go out of the team.

#include<bits/stdc++.h>
using namespace std;

struct node{
    
    
	int t;
	int c;
};

int a[3000001],N,n,k,t,cnt;

int main(){
    
    
	queue<node> q;
	cin >> N;
	for(int i=0;i<N;i++){
    
    
		cin >> t >> n;
		for(int i=0;i<n;i++){
    
    
			cin >> k;
			q.push({
    
    t,k});
			if(a[k]==0) cnt++;
			a[k]++;
		}
		while(!q.empty()&&t-q.front().t>=86400){
    
    
			a[q.front().c]--;
			if(a[q.front().c]==0) cnt--;
			q.pop();
		}
		cout << cnt << endl;
	}
	return 0;
}