My learning note on AGC061C based on Little09's (Simplified) Chinese Blog

Revision en54, by CristianoPenaldo, 2023-02-15 19:06:57

I admit that AGC061C is too hard for me, and I don't even understand its official editorial. Today I see a Luogu blog with a very genius and clear idea on this problem. I learned a lot from it, and I would like to share it to you now. The writer of this blog is possibly Little09, but I am not quite sure.

Part1: Problem Statement and Constraints

There are N customers named 1, ..., N visiting a shop. Customer i arrives at time Ai and leaves at time Bi The queue order is first in first out, so Ai and Bi are both increasing. Additionally, all Ai and Bi are pairwise distinct.

At the entrance, there's a list of visitors to put their names in. Each customer will write down their name next in the list exactly once, either when they arrive or when they leave. How many different orders of names can there be in the end? Find the count modulo 998244353.

Constraints:

1N500000.

1AiBi2N.

Ai<Ai+1(1iN1).

Bi<Bi+1(1iN1).

AiBj(ij).

All values in the input are integers.

Part2: Idea of the blog

The complexity of the algorithm in the blog is O(N).

Consider two dynamic programming tables named f and g (dp in the original blog). The blog computes f,g in the reverse order. Formally,

f(i)(1in): The number of permutations when we have already considered persons i,i+1,...,n.

g(i)(1in): The number of permutations when we have already considered persons i,i+1,...,n, and the person i is forced to sign her (or his) name on Bi.

The blog defines c(i) as:

c(i):=max{j|Aj<Bi}. (1)

Obviously i{j|Aj<Bi} and c(i)i.

First, we consider f(i). If i signs on Ai, then no matter when i+1,i+2,...n sign their names, i is always placed in front of them. It is a bijection, given a permutation p of [i+1,i+2...n], just add i in the front of p. The number of distinct permutations when i signs on Ai is just f(i+1). If i signs on Bi, then i must not be placed the first among {i,i+1,...,n}, otherwise it is overlapped with a situation where i signs on Ai. Now we consider the number of permutations that i is placed the first among {i,i+1,...,n}. In this case (i is the first), x{i+1,i+2...,c(i)} should all sign on Bx because Ax<Bi (according to the definition of c in Eq.(1)), and the choices of x{c(i)+1,...,n} are not important. The number of the permutations that i signs on Bi and i is placed the first among {i,i+1,...,n} is g(c(i)), because c(i) must chooses Bc(i) and {c(i)+1,c(i)+2...,n} can choose freely. Therefore, the situation where i signed on Bi contributes g(i)g(c(i)) to f(i). f(i) depends on g(i):

f(i)=f(i+1)+g(i)g(c(i)). (2)

Second, we consider g(i). To count g(i), an important idea is to divide it into non-overlapping cases. The blog consider

Pj := The set of permutations where j is the least integer among {i+1,i+2...,c(i)} such that j chooses Bj. In other words, i chooses Bi, {i+1,i+2...,j1} all choose A, and j chooses Bj. Also, we should not forget Pc(i)+1, because {i+1,i+2...,c(i)} might all choose A!

(1)Do these Pj (including Pc(i)+1) overlap? No! Because the permutations in Pj has a unique prefix: [i+1,i+2...,j1].

(2)Do these Pj cover all situations? Yes, this is obvious.

(3)How to calculate the size of Pj, i.e., |Pj|? For jc(i), since the prefix is fixed ([i+1i+2...,j1] mentioned in (1)), there is a bijection from the set g(j) to Pj by adding the fixed prefix to the element in g(j). So the size of |Pj| is just g(j). For j=c(i)+1, |Pj|=f(c(i)+1) because all {i+1,i+2...,c(i)} have to choose A.

Therefore,

g(i)=c(i)j=i+1g(j)+f(c(i)+1) (3)

Although we consider f first, we should calculate g first because f(i) depends on g(i).

Part3: Implementation details

(1) You can use two pointers to calculate c.

(2) To make the computation of g faster, you can use the prefix sum trick.

(3) The original blog considers two cases: c(i)=i and c(i)<i. They can be unified into equations (2) and (3), i.e., it is not necessary to consider two cases.

(4) In the original blog Little09 calculates from n to 1. You can also calculate from 1 to n. Symmetrically, you should define c(i) as min{j|Bj>Ai}, and define g(i) as "The number of permutations when we have already considered persons 1,2,...,i1, and the person i is forced to sign her (or his) name on Ai". Here is my implementation that calculates from 1 to n.

Part4: What I have learned

(1) The most important idea in counting is dividing into non-overlapping sets whose unions are the whole set. Besides, the counting of each set should be much simpler.

(2) The most important thing of dp is defining states.

(3) Bijections are really important in combinatorics. For example, the Dyck path.

(4) Achieving (1) and (2) requires high IQ and talent. For example, the definition of f in the blog is normal, while the definition of g is genius!

Part5: The last

If you have any questions, please don't hesitate to ask me. It is beneficial for both of us. For you, I might resolve your confusion. For me, I can check whether I make a typo in the blog or not and whether I really understand this blog or not.

Tags combinatorics, dp

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en55 English CristianoPenaldo 2023-02-18 13:01:26 4 Tiny change: ' and $c(i)<i$. They c' -> ' and $c(i) > i$. They c'
en54 English CristianoPenaldo 2023-02-15 19:06:57 5 Tiny change: '{c(i)+1,\,j+2\,...,\,' -> '{c(i)+1,\,c(i)+2\,...,\,'
en53 English CristianoPenaldo 2023-02-15 19:06:01 1 Tiny change: 'fix: $[i+1\,i+2\,...' -> 'fix: $[i+1,\,i+2\,...'
en52 English CristianoPenaldo 2023-02-15 19:00:40 9
en51 English CristianoPenaldo 2023-02-15 18:26:48 58
en50 English CristianoPenaldo 2023-02-15 18:06:47 4 Tiny change: 'rt2: Idea in the blog*' -> 'rt2: Idea of the blog*'
en49 English CristianoPenaldo 2023-02-15 17:36:32 14 Tiny change: '3), i.e., there is actually not neces' -> '3), i.e., it is not neces'
en48 English CristianoPenaldo 2023-02-15 17:31:03 1 Tiny change: 'their name, $i$ is a' -> 'their names, $i$ is a'
en47 English CristianoPenaldo 2023-02-15 17:19:57 150
en46 English CristianoPenaldo 2023-02-15 17:11:30 2 Tiny change: '\n\n**Part4: The last' -> '\n\n**Part5: The last'
en45 English CristianoPenaldo 2023-02-15 17:09:23 62
en44 English CristianoPenaldo 2023-02-15 17:05:53 32 Tiny change: 'he first**, otherwis' -> 'he first** among $\\{i,\,i+1,\,...,\,n\\}$, otherwis'
en43 English CristianoPenaldo 2023-02-15 17:04:42 4 Tiny change: 'dd $i$ in front of ' -> 'dd $i$ in the front of '
en42 English CristianoPenaldo 2023-02-15 17:03:34 6
en41 English CristianoPenaldo 2023-02-15 17:02:11 11 Tiny change: 'e $A$.\n\nFinally, although we' -> 'e $A$.\n\nAlthough we'
en40 English CristianoPenaldo 2023-02-15 17:01:24 11 Tiny change: 'th a very clear ide' -> 'th a very genius and clear ide'
en39 English CristianoPenaldo 2023-02-15 17:00:40 178
en38 English CristianoPenaldo 2023-02-15 16:52:57 216
en37 English CristianoPenaldo 2023-02-15 16:48:30 1 Tiny change: 'i \neq j)$\n\n$\cdot' -> 'i \neq j)$.\n\n$\cdot'
en36 English CristianoPenaldo 2023-02-15 16:48:07 6
en35 English CristianoPenaldo 2023-02-15 16:47:40 272 (published)
en34 English CristianoPenaldo 2023-02-15 16:44:14 651
en33 English CristianoPenaldo 2023-02-15 16:32:35 2 Tiny change: 'j=i+1}^{c(j)} g(j) + ' -> 'j=i+1}^{c(i)} g(j) + '
en32 English CristianoPenaldo 2023-02-15 16:25:16 4
en31 English CristianoPenaldo 2023-02-15 16:06:22 74 Tiny change: '\geq i$.\n\n![ ](htt' -> '\geq i$.\n![ ](htt'
en30 English CristianoPenaldo 2023-02-15 16:05:39 64
en29 English CristianoPenaldo 2023-02-15 16:03:18 60
en28 English CristianoPenaldo 2023-02-15 16:01:46 149
en27 English CristianoPenaldo 2023-02-15 15:51:47 56
en26 English CristianoPenaldo 2023-02-15 15:50:00 2 Tiny change: 's_{j=i+1}^c(j) g(j) + f(' -> 's_{j=i+1}^{c(j)} g(j) + f('
en25 English CristianoPenaldo 2023-02-15 15:48:45 191
en24 English CristianoPenaldo 2023-02-15 15:45:44 542
en23 English CristianoPenaldo 2023-02-15 15:36:54 6
en22 English CristianoPenaldo 2023-02-15 15:36:08 44
en21 English CristianoPenaldo 2023-02-15 15:34:44 139
en20 English CristianoPenaldo 2023-02-15 15:30:07 742
en19 English CristianoPenaldo 2023-02-15 15:22:23 8
en18 English CristianoPenaldo 2023-02-15 15:20:53 327
en17 English CristianoPenaldo 2023-02-15 15:17:02 241
en16 English CristianoPenaldo 2023-02-15 15:12:05 355
en15 English CristianoPenaldo 2023-02-15 15:05:27 708
en14 English CristianoPenaldo 2023-02-15 14:57:22 153
en13 English CristianoPenaldo 2023-02-15 14:55:41 359
en12 English CristianoPenaldo 2023-02-15 14:52:52 75 Tiny change: 'eq i$.\n\n\n' -> 'eq i$.\n\n![ ](https://mirror.codeforces.com/633ccf/blog.png)\n\n\n'
en11 English CristianoPenaldo 2023-02-15 14:41:38 55
en10 English CristianoPenaldo 2023-02-15 14:33:54 279
en9 English CristianoPenaldo 2023-02-15 14:28:39 696
en8 English CristianoPenaldo 2023-02-15 14:20:37 15 Tiny change: '\text{All inputs are integ' -> '\text{All values in the input are integ'
en7 English CristianoPenaldo 2023-02-15 14:19:48 214
en6 English CristianoPenaldo 2023-02-15 14:16:46 46 Tiny change: '98244353$.' -> '98244353$.\n\nConstraints:\n$\cdot 1 \leq N \leq 500000$'
en5 English CristianoPenaldo 2023-02-15 14:16:07 30
en4 English CristianoPenaldo 2023-02-15 14:14:35 565
en3 English CristianoPenaldo 2023-02-15 14:11:37 116
en2 English CristianoPenaldo 2023-02-15 14:10:18 278
en1 English CristianoPenaldo 2023-02-15 13:31:51 165 Initial revision (saved to drafts)