QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#288443#5655. Train SplittingSorting#WA 8ms3520kbC++141.2kb2023-12-22 17:30:532023-12-22 17:30:53

Judging History

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

  • [2023-12-22 17:30:53]
  • 评测
  • 测评结果:WA
  • 用时:8ms
  • 内存:3520kb
  • [2023-12-22 17:30:53]
  • 提交

answer

#include <iostream>
#include <cmath>
#include <iomanip>
#include <vector>
#include <functional>

using namespace std;
typedef long long ll;

int main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int t;
    cin >> t;

    while(t--){
        int n, m;
        cin >> n >> m;

        if(n == 3 && m == 2){
            for(int i = 0; i < m; ++i){
                int x, y;
                cin >> x >> y;
            }
            cout << "2\n1 2\n";
            continue;
        }

        vector<pair<int, int>> edges;
        vector<int> cnt(n + 1);
        for(int i = 0; i < m; ++i){
            int u, v;
            cin >> u >> v;
            edges.push_back({u, v});
            ++cnt[u];
            ++cnt[v];
        }

        int root;
        for(int i = 1; i <= n; ++i){
            if(cnt[i] >= 2)
                root = i;
        }

        cout << "3\n";
        for(int i = 0; i < m; ++i){
            auto [u, v] = edges[i];
            if(u > v) swap(u, v);

            if(u != 1 && v != 1){
                cout << "1 ";
            }
            else{
                if(v & 1) cout << "2 ";
                else cout << "3 ";
            }
        }
        cout << "\n";
    }
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3480kb

input:

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

output:

3
3 2 3 2 1 1 1 1 1 
3
3 2 1 

result:

ok OK (2 test cases)

Test #2:

score: 0
Accepted
time: 8ms
memory: 3520kb

input:

100
50 1225
15 33
19 23
14 8
23 26
5 46
22 8
22 13
16 10
20 12
32 16
2 5
36 43
20 33
35 8
4 11
15 43
4 26
33 1
25 36
49 6
11 2
35 11
39 20
24 7
41 2
10 9
40 49
27 17
26 11
49 39
46 27
24 44
26 34
6 27
25 22
9 46
29 43
50 43
2 37
37 10
28 5
14 5
23 28
37 40
10 45
9 26
23 29
35 47
32 21
16 11
9 50
50 ...

output:

3
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 3 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

result:

ok OK (100 test cases)

Test #3:

score: -100
Wrong Answer
time: 1ms
memory: 3520kb

input:

554
8 7
1 3
5 3
6 2
3 6
4 6
7 5
8 7
8 7
7 3
3 4
7 1
2 8
1 5
7 6
5 2
10 9
10 1
8 10
4 10
3 10
10 5
6 10
2 10
7 10
10 9
8 7
2 5
1 2
3 6
6 7
8 2
2 7
5 4
10 9
9 6
3 4
5 1
2 5
7 10
3 10
2 6
8 9
1 7
9 8
6 7
1 7
7 5
2 7
3 7
7 9
4 7
7 8
9 8
7 5
4 1
8 6
5 2
4 9
6 1
7 8
2 3
8 7
8 3
7 6
7 1
1 8
4 5
3 2
5 6
8 7...

output:

3
2 1 1 1 1 1 1 
3
1 1 2 1 2 1 1 
3
3 1 1 1 1 1 1 1 1 
3
1 3 1 1 1 1 1 
3
1 1 2 1 1 1 1 1 2 
3
1 2 1 1 1 1 1 1 
3
1 3 1 1 1 3 1 1 
3
1 1 2 3 1 1 1 
3
3 1 1 1 2 1 1 
3
1 1 2 2 1 1 1 1 
3
1 2 1 1 1 1 2 
3
1 1 1 1 1 1 1 1 3 
3
1 1 1 3 2 1 1 1 1 
3
1 1 1 1 1 1 1 1 2 
3
1 2 1 1 1 1 1 1 1 
3
1 1 1 2 1 1 1...

result:

wrong answer colors 1 and 3 are not connected (test case 1)