QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#874155#8593. Cointatyam3 1ms3712kbC++261.1kb2025-01-27 17:22:562025-01-27 17:22:57

Judging History

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

  • [2025-01-27 17:22:57]
  • 评测
  • 测评结果:3
  • 用时:1ms
  • 内存:3712kb
  • [2025-01-27 17:22:56]
  • 提交

answer

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

int main() {
    cin.tie(0)->sync_with_stdio(0);
    
    int N, M;
    cin >> N >> M;
    vector g(N, vector<int>{});
    for (int _ : views::iota(0, M)) {
        int a, b;
        cin >> a >> b;
        a--; b--;
        g[a].push_back(b);
    }

    auto topo = [&](auto cmp) {
        vector<int> indeg(N);
        vector<int> order;
        for (auto& v : g) for (int i : v) indeg[i]++;
        priority_queue<int, vector<int>, decltype(cmp)> q;
        for (int i : views::iota(0, N)) if (indeg[i] == 0) q.push(i);
        while (size(q)) {
            int i = q.top(); q.pop();
            order.push_back(i);
            for (int j : g[i]) if (--indeg[j] == 0) q.push(j);
        }
        return order;
    };

    auto order1 = topo(greater<int>());
    auto order2 = topo(less<int>());

    vector<int> ans(N, -1);
    for (int i : views::iota(0, N)) {
        if (order1[i] != order2[i]) continue;
        ans[order1[i]] = 1;
    }

    for (int i : ans) cout << i << ' ';
    cout << '\n';
}

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 3
Acceptable Answer

Test #1:

score: 3
Acceptable Answer
time: 0ms
memory: 3584kb

input:

4 4
2 4
3 1
4 1
2 3

output:

1 1 -1 -1 

result:

points 0.50 -1 correct

Test #2:

score: 3
Acceptable Answer
time: 0ms
memory: 3712kb

input:

6 8
1 5
5 4
6 2
2 5
4 3
6 1
6 5
2 1

output:

1 1 1 1 1 1 

result:

points 0.50 -1 correct

Test #3:

score: 6
Accepted
time: 0ms
memory: 3712kb

input:

2 1
1 2

output:

1 1 

result:

ok ac

Test #4:

score: 3
Acceptable Answer
time: 1ms
memory: 3712kb

input:

6 12
1 5
5 4
6 2
2 5
4 3
6 5
1 5
1 5
2 4
6 3
1 3
4 3

output:

-1 -1 1 1 1 -1 

result:

points 0.50 -1 correct

Test #5:

score: 3
Acceptable Answer
time: 1ms
memory: 3584kb

input:

7 20
1 6
6 3
1 4
1 5
1 7
1 2
1 5
2 3
4 5
7 2
2 4
5 3
6 3
1 3
4 3
7 5
2 6
4 6
7 2
7 5

output:

1 1 1 1 -1 -1 1 

result:

points 0.50 -1 correct

Test #6:

score: 3
Acceptable Answer
time: 1ms
memory: 3712kb

input:

7 20
5 6
1 3
3 6
4 1
7 4
2 5
4 3
2 6
7 5
4 6
2 6
2 1
4 5
1 3
1 5
7 1
7 6
4 1
7 6
3 6

output:

1 -1 -1 -1 -1 1 -1 

result:

points 0.50 -1 correct

Test #7:

score: 3
Acceptable Answer
time: 0ms
memory: 3712kb

input:

7 20
7 6
4 5
6 4
3 6
4 1
6 2
3 5
5 2
7 6
1 2
3 6
6 4
7 1
6 1
7 1
4 5
3 6
3 5
4 5
3 1

output:

-1 1 -1 1 -1 1 -1 

result:

points 0.50 -1 correct

Subtask #2:

score: 0
Wrong Answer

Dependency #1:

50%
Acceptable Answer

Test #8:

score: 0
Wrong Answer
time: 1ms
memory: 3712kb

input:

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

output:

-1 -1 -1 1 1 1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 

result:

wrong answer wa

Subtask #3:

score: 0
Skipped

Dependency #1:

50%
Acceptable Answer

Dependency #2:

0%

Subtask #4:

score: 0
Skipped

Dependency #1:

50%
Acceptable Answer

Dependency #2:

0%