【Codeforces】Round 891 (Div. 3) D Strong Vertices 题解

Strong Vertices

题目链接

Strong Vertices

题面翻译

给定两个数组 $a$ 和 $b$，对此构造一张有向图：

• 若 $a_u-a_v\ge b_u-b_v$，则 $u$ 向 $v$ 连边。

求所有向其他所有顶点连边的顶点个数，并按从小到大顺序输出它们。

题目描述

Given two arrays $a$ and $b$ , both of length $n$ . Elements of both arrays indexed from $1$ to $n$ . You are constructing a directed graph, where edge from $u$ to $v$ ( $u\ne v$ ) exists if $a_u-a_v\ge b_u-b_v$ .

A vertex $V$ is called strong if there exists a path from $V$ to all other vertices.

A path in a directed graph is a chain of several vertices, connected by edges, such that moving from the vertex $u$ , along the directions of the edges, the vertex $v$ can be reached.

Your task is to find all strong vertices.

For example, if $a=[3,1,2,4]$ and $b=[4,3,2,1]$ , the graph will look like this:

The graph has only one strong vertex with number $4$

输入格式

The first line contains an integer $t$ ( $1\le t\le 10^4$ ) — the number of test cases.

The first line of each test case contains an integer $n$ ( $2\le n\le 2\cdot 10^5$ ) — the length of $a$ and $b$ .

The second line of each test case contains $n$ integers $a_1,a_2\dots a_n$ ( $-10^9\le a_i\le 10^9$ ) — the array $a$ .

The third line of each test case contains $n$ integers $b_1,b_2\dots b_n$ ( $-10^9\le b_i\le 10^9$ ) — the array $b$ .

It is guaranteed that the sum of $ n $ for all test cases does not exceed $2\cdot 10^5$ .

输出格式

For each test case, output two lines: in the first line, output the number of strong vertices, and in the second line, output all strong vertices in ascending order.

样例 #1

样例输入 #1

5
4
3 1 2 4
4 3 2 1
5
1 2 4 1 2
5 2 3 3 1
2
1 2
2 1
3
0 2 1
1 3 2
3
5 7 4
-2 -3 -6

样例输出 #1

1
4 
2
3 5 
1
2 
3
1 2 3 
2
2 3

提示

The first sample is covered in the problem statement.

For the second sample, the graph looks like this:

The graph has two strong vertices with numbers $3$ and $5$ . Note that there is a bidirectional edge between vertices $3$ and $5$ .In the third sample, the vertices are connected by a single directed edge from vertex $2$ to vertex $1$ , so the only strong vertex is $2$ .

In the fourth sample, all vertices are connected to each other by bidirectional edges, so there is a path from every vertex to any other vertex.

做题思路

由题面所给公式 $a_u-a_v\ge b_u-b_v$ ，可以得到 $a_u-b_u\ge a_v-b_v$，此时有从 $u$ 到 $v$ 的路径。取 $c_i=a_i-b_i$。而题目要求的是有到达所有点路径的那个起始点，那么就需要求出 $c_i$ 的最大值。对于第 $i$ 个点，如果有 $c_i==max(c_i)$，那么点 $i$ 即为所求。

参考程序

#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
int a[N], b[N];

int main()
{
    int t;
    cin >> t;
    while (t--)
    {
        int n;
        cin >> n;
        for (int i = 1; i <= n; i++)
            cin >> a[i];
        for (int i = 1; i <= n; i++)
            cin >> b[i];
        int mx = INT_MIN;
        for (int i = 1; i <= n; i++)
            mx = max(mx, a[i] - b[i]);
        int c = 0;
        for (int i = 1; i <= n; i++)
            c += (a[i] - b[i] == mx);
        cout << c << "\n";
        for (int i = 1; i <= n; i++)
            if (a[i] - b[i] == mx)
                cout << i << ' ';
        cout << "\n";
    }
}