QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#473810#8517. Interesting Pathsw4p3rRE 1ms3848kbC++20954b2024-07-12 14:19:012024-07-12 14:19:02

Judging History

你现在查看的是最新测评结果

  • [2024-07-12 14:19:02]
  • 评测
  • 测评结果：RE
  • 用时：1ms
  • 内存：3848kb
查看
  • [2024-07-12 14:19:01]
  • 提交

answer

#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
#define eps 1e-6
#define N 200010
int n, m;
vector<int>e[N], g[N];
int be[N], bg[N];
void bfs(int st, const vector<int>e[N], int b[])
{
    queue<int>q;
    q.push(st); b[st] = 1;
    while(!q.empty())
    {
        int u = q.front(); q.pop();
        for (int v : e[u])
        {
            if (!b[v])
            {
                b[v] = 1;
                q.push(v);
            }
        }
    }
}
int main()
{
    cin >> n >> m;
    for (int i = 1; i <= m; i ++)
    {
        int u, v;
        cin >> u >> v;
        e[u].push_back(v);
        g[v].push_back(u);
    }
    
    bfs(1, e, be);
    bfs(n, g, bg);

    int ans = 0;
    for (int i = 2; i < n; i ++) if (be[i] && bg[i])ans --;
    for (int u = 1; u <= n; u ++)
    {
        for (int v : e[u]) if (be[u] && bg[v]) ans ++;
    }
    cout << ans << '\n';
    return 0;
}
Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3780kb

input:

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

output:

4

result:

ok 1 number(s): "4"

Test #2:

score: 0
Accepted
time: 1ms
memory: 3616kb

input:

5 3
1 3
2 3
2 5

output:

0

result:

ok 1 number(s): "0"

Test #3:

score: 0
Accepted
time: 1ms
memory: 3616kb

input:

2 0

output:

0

result:

ok 1 number(s): "0"

Test #4:

score: 0
Accepted
time: 1ms
memory: 3552kb

input:

2 1
1 2

output:

1

result:

ok 1 number(s): "1"

Test #5:

score: 0
Accepted
time: 1ms
memory: 3616kb

input:

10 20
2 8
5 8
4 8
3 10
3 7
2 7
2 5
1 7
6 9
6 10
2 4
5 9
2 10
3 9
7 8
4 10
3 6
2 3
5 7
6 8

output:

0

result:

ok 1 number(s): "0"

Test #6:

score: 0
Accepted
time: 1ms
memory: 3560kb

input:

10 30
8 9
1 5
3 6
4 6
4 7
6 9
3 5
5 6
3 8
1 4
3 4
7 8
2 4
4 5
1 8
6 10
2 10
9 10
1 2
8 10
2 7
2 8
2 5
7 9
2 6
4 8
1 7
1 6
7 10
4 9

output:

19

result:

ok 1 number(s): "19"

Test #7:

score: 0
Accepted
time: 0ms
memory: 3788kb

input:

20 57
6 20
5 9
8 11
6 17
5 18
14 16
6 18
8 18
1 3
17 20
2 16
4 19
2 15
7 17
17 19
8 16
11 15
13 16
5 20
4 14
5 16
7 12
10 12
3 12
8 13
1 5
6 11
13 17
11 16
2 6
4 5
14 15
3 14
9 13
8 10
18 20
15 17
6 12
5 17
2 10
8 17
15 16
15 20
5 19
10 15
1 2
4 20
4 18
3 16
2 12
8 19
10 19
2 11
12 17
12 20
5 7
1 15

output:

21

result:

ok 1 number(s): "21"

Test #8:

score: 0
Accepted
time: 1ms
memory: 3616kb

input:

16 19
5 10
10 13
12 13
15 16
7 11
1 6
14 15
3 4
6 8
11 12
4 5
13 14
5 7
9 12
1 2
2 4
5 12
8 9
1 3

output:

5

result:

ok 1 number(s): "5"

Test #9:

score: 0
Accepted
time: 1ms
memory: 3848kb

input:

14 91
3 13
1 9
4 12
1 12
11 14
8 10
9 14
5 11
9 11
1 11
1 2
10 14
1 7
4 9
2 10
13 14
2 6
4 6
12 13
5 13
2 8
1 14
9 10
3 8
2 11
5 14
7 9
6 10
7 11
1 10
12 14
3 14
3 7
7 8
1 13
10 11
2 14
6 14
8 9
6 9
2 4
4 7
4 14
9 13
2 7
6 12
5 7
4 5
2 9
11 12
6 8
8 11
4 8
7 14
7 12
5 12
2 5
11 13
6 7
6 11
7 13
3 4
...

output:

79

result:

ok 1 number(s): "79"

Test #10:

score: -100
Runtime Error

input:

1000000 0

output:

result:
English 繁體中文 简体中文

Server Time: 2024-12-05 08:45:53 | OpenSource Project