QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#135994	#1139. Stations	bashkort^#	0	50ms	4100kb	C++20	1.3kb	2023-08-06 17:21:55	2024-07-04 01:20:01

Judging History

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

[2024-07-04 01:20:01]
评测

测评结果：0
用时：50ms
内存：4100kb

查看

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2023-08-06 17:21:55]
提交

stations

#include "stations.h"
#include <bits/stdc++.h>

using namespace std;

std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
    vector<vector<int>> adj(n);
    for (int i = 0; i + 1 < n; ++i) {
        adj[u[i]].push_back(v[i]);
        adj[v[i]].push_back(u[i]);
    }
	std::vector<int> labels(n);
    vector<int> siz(n);

    auto dfs1 = [&](auto dfs1, int v, int par) -> void {
        siz[v] = 1;
        for (int &to : adj[v]) {
            if (to != par) {
                dfs1(dfs1, to, v);
                siz[v] += siz[to];
                if (adj[v][0] == par || siz[adj[v][0]] < siz[to]) {
                    swap(to, adj[v][0]);
                }
            }
        }
    };

    dfs1(dfs1, 0, -1);

    int T = 0;

    auto dfs = [&](auto self, int v, int par) -> void {
        for (int to : adj[v]) {
            adj[to].erase(find(adj[to].begin(), adj[to].end(), v));
            if (to != adj[v][0]) {
                T += siz[to];
            }
            self(self, to, v);
        }
        labels[v] = T++;
    };

    dfs(dfs, 0, -1);

    return labels;
}

int find_next_station(int s, int t, std::vector<int> c) {
    pair<int, int> best{1e9, -1};
    for (int to : c) {
        best = min(best, pair{abs(to - t), to});
    }
	return best.second;
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 0

Wrong Answer

Test #1:

score: 0

Wrong Answer

time: 0ms

memory: 3684kb

input:

output:

input:

1
-1
0

output:

result:

FAIL Unexpected end of file - int32 expected (/opt/uoj/judger/uoj_judger/work/channel_2_answer.txt)

Subtask #2:

score: 0

Wrong Answer

Test #11:

score: 0

Wrong Answer

time: 0ms

memory: 3964kb

input:

output:

input:

1
-1
0

output:

result:

FAIL Unexpected end of file - int32 expected (/opt/uoj/judger/uoj_judger/work/channel_2_answer.txt)

Subtask #3:

score: 0

Wrong Answer

Test #17:

score: 0

Wrong Answer

time: 36ms

memory: 3800kb

input:

0
10
2 1000000
1 0
997 1000000
830 513
223 672
727 200
763 415
581 440
34 42
267 325
912 693
753 59
401 289
198 641
982 214
41 49
453 107
940 806
905 732
153 482
248 405
102 79
480 837
534 620
564 856
679 178
278 247
899 206
333 672
297 308
407 863
26 752
272 178
204 603
208 10
715 562
785 285
184 5...

output:

input:

output:

result:

wrong answer Diff at 14-th number: read 1094 but expected 1096

Subtask #4:

score: 0

Wrong Answer

Test #34:

score: 10

Accepted

time: 48ms

memory: 3840kb

input:

0
10
2 1000000000
0 1
2 1000000000
0 1
2 1000000000
1 0
2 1000000000
1 0
2 1000000000
0 1
2 1000000000
1 0
2 1000000000
1 0
2 1000000000
0 1
2 1000000000
0 1
2 1000000000
0 1

output:

input:

output:

result:

ok

Test #35:

score: 10

Accepted

time: 40ms

memory: 4096kb

input:

0
10
3 1000000000
2 1
2 0
3 1000000000
1 0
2 0
3 1000000000
2 0
0 1
3 1000000000
0 2
1 2
3 1000000000
1 2
1 0
3 1000000000
1 0
2 1
3 1000000000
0 2
1 2
3 1000000000
1 2
1 0
3 1000000000
0 2
1 0
3 1000000000
2 0
1 2

output:

input:

output:

result:

ok

Test #36:

score: 10

Accepted

time: 30ms

memory: 3804kb

input:

0
10
4 1000000000
3 1
2 0
1 0
4 1000000000
0 3
1 2
3 1
4 1000000000
3 1
0 2
0 1
4 1000000000
2 1
2 3
1 0
4 1000000000
3 1
0 1
2 3
4 1000000000
0 1
3 0
2 3
4 1000000000
2 0
3 0
1 2
4 1000000000
0 2
2 3
1 3
4 1000000000
3 2
2 1
3 0
4 1000000000
2 3
3 0
0 1

output:

input:

output:

result:

ok

Test #37:

score: 10

Accepted

time: 0ms

memory: 3776kb

input:

0
10
4 1000000000
0 1
1 2
2 3
4 1000000000
0 1
1 3
3 2
4 1000000000
0 2
2 1
1 3
4 1000000000
0 2
2 3
3 1
4 1000000000
0 3
3 1
1 2
4 1000000000
0 3
3 2
2 1
4 1000000000
1 0
0 2
2 3
4 1000000000
1 0
0 3
3 2
4 1000000000
1 2
2 0
0 3
4 1000000000
1 3
3 0
0 2

output:

input:

output:

result:

ok

Test #38:

score: 10

Accepted

time: 0ms

memory: 4100kb

input:

0
10
6 1000000000
0 1
1 2
2 3
3 4
4 5
6 1000000000
0 1
1 2
2 3
3 5
5 4
6 1000000000
0 1
1 2
2 4
4 3
3 5
6 1000000000
0 1
1 2
2 4
4 5
5 3
6 1000000000
0 1
1 2
2 5
5 3
3 4
6 1000000000
0 1
1 2
2 5
5 4
4 3
6 1000000000
0 1
1 3
3 2
2 4
4 5
6 1000000000
0 1
1 3
3 2
2 5
5 4
6 1000000000
0 1
1 3
3 4
4 2
2 ...

output:

input:

output:

result:

ok

Test #39:

score: 10

Accepted

time: 0ms

memory: 4100kb

input:

0
3
3 1000000000
0 1
1 2
3 1000000000
0 2
2 1
3 1000000000
1 0
0 2

output:

input:

output:

result:

ok

Test #40:

score: 10

Accepted

time: 36ms

memory: 4096kb

input:

0
10
4 1000000000
1 3
1 2
0 1
4 1000000000
2 3
3 0
1 3
4 1000000000
2 0
1 3
0 1
4 1000000000
1 2
3 1
1 0
4 1000000000
3 1
0 2
3 2
4 1000000000
2 0
2 1
2 3
4 1000000000
1 2
1 3
2 0
4 1000000000
0 2
2 3
2 1
4 1000000000
2 1
2 0
3 0
4 1000000000
3 0
3 2
1 0

output:

input:

output:

result:

ok

Test #41:

score: 10

Accepted

time: 50ms

memory: 3836kb

input:

0
10
2 1000000000
1 0
2 1000000000
0 1
2 1000000000
1 0
2 1000000000
1 0
2 1000000000
1 0
2 1000000000
0 1
2 1000000000
1 0
2 1000000000
1 0
2 1000000000
1 0
2 1000000000
0 1

output:

input:

output:

result:

ok

Test #42:

score: 10

Accepted

time: 40ms

memory: 3772kb

input:

0
10
3 1000000000
0 1
0 2
3 1000000000
0 1
0 2
3 1000000000
1 0
2 0
3 1000000000
1 0
0 2
3 1000000000
1 0
2 0
3 1000000000
1 0
2 0
3 1000000000
1 0
0 2
3 1000000000
1 0
2 0
3 1000000000
1 0
0 2
3 1000000000
0 1
0 2

output:

input:

output:

result:

ok

Test #43:

score: 10

Accepted

time: 36ms

memory: 3808kb

input:

0
10
4 1000000000
0 1
2 0
1 3
4 1000000000
0 1
0 2
3 1
4 1000000000
0 1
0 2
3 1
4 1000000000
0 1
0 2
1 3
4 1000000000
0 1
0 2
3 1
4 1000000000
0 1
0 2
1 3
4 1000000000
0 1
0 2
3 1
4 1000000000
0 1
0 2
3 1
4 1000000000
1 0
0 2
1 3
4 1000000000
0 1
2 0
3 1

output:

input:

output:

result:

ok

Test #44:

score: 0

Wrong Answer

time: 2ms

memory: 4100kb

input:

0
10
7 1000000000
5 3
6 3
0 3
4 3
1 3
2 3
7 1000000000
3 0
4 0
5 0
1 0
2 0
6 0
7 1000000000
4 0
2 0
3 0
6 0
1 0
5 4
7 1000000000
4 1
0 1
5 1
3 1
2 1
6 4
7 1000000000
3 1
2 1
5 1
4 1
6 1
0 3
7 1000000000
6 3
1 3
0 3
2 3
4 6
5 6
7 1000000000
5 0
4 0
3 0
2 0
6 5
1 5
7 1000000000
0 1
6 1
5 1
3 1
4 0
2 0...

output:

input:

output:

result:

wrong answer Diff at 3-th number: read 0 but expected 10

Subtask #5:

score: 0

Wrong Answer

Test #54:

score: 0

Wrong Answer

time: 36ms

memory: 3816kb

input:

0
10
3 1000000000
1 0
2 1
998 1000000000
928 443
90 795
55 379
957 417
759 300
960 136
309 858
833 370
228 827
876 955
619 365
15 108
243 388
54 925
141 894
272 634
0 989
600 346
380 277
350 113
326 613
975 946
660 98
34 538
220 864
9 585
185 860
458 424
509 14
22 275
109 872
153 233
76 834
972 736
...

output:

input:

output:

result:

wrong answer Diff at 5-th number: read 1270 but expected 1272