QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#553415	#9241. Sphinx	Hunster^#	18	30ms	4884kb	C++20	1.8kb	2024-09-08 12:58:45	2024-09-08 12:58:45

Judging History

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

[2024-09-08 12:58:45]
评测

测评结果：18
用时：30ms
内存：4884kb

查看

[2024-09-08 12:58:45]
提交

answer

#include <bits/stdc++.h>

int perform_experiment(std::vector<int>);

constexpr int N = 250;

int n, m;
std::vector<int> graph[N];

namespace sol1 {
    int col[N], vis[N];
    bool check(int x, std::vector<int> h) {
        std::vector<int> cur(n, n);
        cur[x] = -1;
        for (int y : h) cur[y] = col[y];
        std::vector<int> vis(n);
        const std::function<void(int)> dfs = [&](int u) {
            vis[u] = 1;
            for (int v : graph[u]) if (cur[v] == cur[u] && !vis[v]) dfs(v);
        };
        int cnt = 0;
        for (int j = 0; j < n; j++) if (!vis[j]) {
            cnt++;
            dfs(j);
        }
        for (int y : h) cur[y] = -1;
        return perform_experiment(cur) < cnt;
    }
    void dfs(int u) {
        vis[u] = 1;
        std::vector<int> h;
        for (int v : graph[u]) if (!vis[v]) h.push_back(v);
        while (check(u, h)) {
            int l = 0, r = h.size();
            while (l < r) {
                int mid = (l + r) >> 1;
                if (check(u, std::vector<int>(h.begin(), h.begin() + mid + 1))) r = mid;
                else l = mid + 1;
            }
            assert(r < h.size());
            col[h[r]] = col[u];
            dfs(h[r]);
            h.erase(h.begin() + r);
        }
    }
    std::vector<int> work() {
        int t = 0;
        for (int i = 0; i < n; i++) if (!vis[i]) {
            col[i] = t++;
            dfs(i);
        }
        std::vector<int> res;
        for (int i = 0; i < n; i++) res.push_back(col[i]);
        return res;
    }
}

std::vector<int> find_colours(int N, std::vector<int> X, std::vector<int> Y) {
    n = N, m = X.size();
    for (int i = 0; i < m; i++) {
        graph[X[i]].push_back(Y[i]);
        graph[Y[i]].push_back(X[i]);
    }
    return sol1::work();
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 1.5

Acceptable Answer

Test #1:

score: 3

Accepted

time: 1ms

memory: 3736kb

input:

output:

result:

ok #experiments: 4

Test #2:

score: 3

Accepted

time: 1ms

memory: 3784kb

input:

output:

result:

ok #experiments: 2

Test #3:

score: 1.5

Acceptable Answer

time: 1ms

memory: 4080kb

input:

output:

result:

points 0.50 points  0.5

Test #4:

score: 1.5

Acceptable Answer

time: 0ms

memory: 3812kb

input:

output:

result:

points 0.50 points  0.5

Subtask #2:

score: 0

Runtime Error

Dependency #1:

50%

Acceptable Answer

Test #5:

score: 3.5

Acceptable Answer

time: 2ms

memory: 3792kb

input:

1978433568
50
49
0
1
1
2
2
3
3
4
4
5
5
6
6
7
7
8
8
9
9
10
10
11
11
12
12
13
13
14
14
15
15
16
16
17
17
18
18
19
19
20
20
21
21
22
22
23
23
24
24
25
25
26
26
27
27
28
28
29
29
30
30
31
31
32
32
33
33
34
34
35
35
36
36
37
37
38
38
39
39
40
40
41
41
42
42
43
43
44
44
45
45
46
46
47
47
48
48
49
19784335...

output:

result:

points 0.50 points  0.5

Test #6:

score: 3.5

Acceptable Answer

time: 2ms

memory: 3788kb

input:

output:

result:

points 0.50 points  0.5

Test #7:

score: 3.5

Acceptable Answer

time: 1ms

memory: 4080kb

input:

1978433568
50
49
0
1
1
2
2
3
3
4
4
5
5
6
6
7
7
8
8
9
9
10
10
11
11
12
12
13
13
14
14
15
15
16
16
17
17
18
18
19
19
20
20
21
21
22
22
23
23
24
24
25
25
26
26
27
27
28
28
29
29
30
30
31
31
32
32
33
33
34
34
35
35
36
36
37
37
38
38
39
39
40
40
41
41
42
42
43
43
44
44
45
45
46
46
47
47
48
48
49
19784335...

output:

result:

points 0.50 points  0.5

Test #8:

score: 3.5

Acceptable Answer

time: 0ms

memory: 3784kb

input:

output:

result:

points 0.50 points  0.5

Test #9:

score: 3.5

Acceptable Answer

time: 1ms

memory: 4076kb

input:

1978433568
50
49
0
1
1
2
2
3
3
4
4
5
5
6
6
7
7
8
8
9
9
10
10
11
11
12
12
13
13
14
14
15
15
16
16
17
17
18
18
19
19
20
20
21
21
22
22
23
23
24
24
25
25
26
26
27
27
28
28
29
29
30
30
31
31
32
32
33
33
34
34
35
35
36
36
37
37
38
38
39
39
40
40
41
41
42
42
43
43
44
44
45
45
46
46
47
47
48
48
49
19784335...

output:

result:

points 0.50 points  0.5

Test #10:

score: 3.5

Acceptable Answer

time: 2ms

memory: 4072kb

input:

output:

result:

points 0.50 points  0.5

Test #11:

score: 3.5

Acceptable Answer

time: 0ms

memory: 3812kb

input:

1978433568
50
49
0
1
1
2
2
3
3
4
4
5
5
6
6
7
7
8
8
9
9
10
10
11
11
12
12
13
13
14
14
15
15
16
16
17
17
18
18
19
19
20
20
21
21
22
22
23
23
24
24
25
25
26
26
27
27
28
28
29
29
30
30
31
31
32
32
33
33
34
34
35
35
36
36
37
37
38
38
39
39
40
40
41
41
42
42
43
43
44
44
45
45
46
46
47
47
48
48
49
19784335...

output:

result:

points 0.50 points  0.5

Test #12:

score: 3.5

Acceptable Answer

time: 1ms

memory: 3784kb

input:

1978433568
50
49
0
1
1
2
2
3
3
4
4
5
5
6
6
7
7
8
8
9
9
10
10
11
11
12
12
13
13
14
14
15
15
16
16
17
17
18
18
19
19
20
20
21
21
22
22
23
23
24
24
25
25
26
26
27
27
28
28
29
29
30
30
31
31
32
32
33
33
34
34
35
35
36
36
37
37
38
38
39
39
40
40
41
41
42
42
43
43
44
44
45
45
46
46
47
47
48
48
49
19784335...

output:

result:

points 0.50 points  0.5

Test #13:

score: 3.5

Acceptable Answer

time: 0ms

memory: 3804kb

input:

output:

result:

points 0.50 points  0.5

Test #14:

score: 3.5

Acceptable Answer

time: 1ms

memory: 4052kb

input:

output:

result:

points 0.50 points  0.5

Test #15:

score: 3.5

Acceptable Answer

time: 1ms

memory: 3752kb

input:

output:

result:

points 0.50 points  0.5

Test #16:

score: 3.5

Acceptable Answer

time: 1ms

memory: 4084kb

input:

output:

result:

points 0.50 points  0.5

Test #17:

score: 0

Runtime Error

input:

output:

877694080
-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
877694080
-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
50
50
50
50
50
50
50
50
50
50
50
50
50
50
50
50
50
5...

result:

Subtask #3:

score: 16.5

Acceptable Answer

Test #34:

score: 16.5

Acceptable Answer

time: 11ms

memory: 3828kb

input:

output:

result:

points 0.50 points  0.5

Test #35:

score: 16.5

Acceptable Answer

time: 9ms

memory: 4112kb

input:

output:

result:

points 0.50 points  0.5

Test #36:

score: 16.5

Acceptable Answer

time: 14ms

memory: 3908kb

input:

output:

result:

points 0.50 points  0.5

Test #37:

score: 16.5

Acceptable Answer

time: 15ms

memory: 3912kb

input:

output:

result:

points 0.50 points  0.5

Test #38:

score: 16.5

Acceptable Answer

time: 7ms

memory: 3840kb

input:

output:

result:

points 0.50 points  0.5

Test #39:

score: 16.5

Acceptable Answer

time: 0ms

memory: 3904kb

input:

output:

result:

points 0.50 points  0.5

Test #40:

score: 16.5

Acceptable Answer

time: 7ms

memory: 4096kb

input:

output:

result:

points 0.50 points  0.5

Test #41:

score: 16.5

Acceptable Answer

time: 11ms

memory: 4120kb

input:

output:

result:

points 0.50 points  0.5

Test #42:

score: 16.5

Acceptable Answer

time: 5ms

memory: 3832kb

input:

output:

result:

points 0.50 points  0.5

Subtask #4:

score: 0

Wrong Answer

Test #43:

score: 0

Wrong Answer

time: 30ms

memory: 4884kb

input:

output:

877694080
-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
-1
-1
-1
-1
-1
-1...

result:

wrong answer Vertices 0 and 3 do have the same color, but they do not in returned answer

Subtask #5:

score: 0

Skipped

Dependency #1:

50%

Acceptable Answer