[Solution] Segmentation Fault CodeChef Solution

[Solution] Segmentation Fault CodeChef Solution

There are N$N$ people numbered from 1$1$ to N$N$ such that:

• Exactly one of these people is a thief and always lies;
• All the others are honest and always tell the truth.

If the ith$i^{th}$ person claims that the thief is one person out of Li,Li+1,Li+2,⋯,Ri$L_i,L_i+1,L_i+2,\cdots ,R_i$, determine how many people could be the thief.

It is guaranteed that at least one person can be the thief.

Input Format

• First line will contain T$T$, the number of test cases. Then the test cases follow.

Solution Click Below:-  👉CLICK HERE👈

👇👇👇👇👇

• First line of each test case will contain N$N$, the number of people. N$N$ lines follow.
• The ith$i^{th}$ line contains two space-separated integers - Li$L_i$ and Ri$R_i$, the range of people amongst which the ith$i^{th}$ person claims the thief is.

Output Format

• For each test case, in the first line, output K$K$, the number of possible thieves.

Enough Space CodeChef Solution

Chef Drinks Tea CodeChef Solution

High Accuracy CodeChef Solution

K-MEX CodeChef Solution

Xor Permutation CodeChef Solution

Permutation And Median CodeChef Solution

Segmentation Fault CodeChef Solution

• In the next K$K$ lines, output the list of people that could be the thieves, in ascending order.

Constraints

• 1≤T≤105$1\le T\le {10}^5$
• 3≤N≤105$3\le N\le {10}^5$
• 1≤Li≤Ri≤N$1\le L_i\le R_i\le N$
• Sum of N$N$ over all test cases does not exceed 105${10}^5$.
• It is guaranteed that at least one person can be the thief.