Task: | Sadonkorjuu |
Sender: | chaotic |
Submission time: | 2022-11-05 16:24:39 +0200 |
Language: | C++ (C++17) |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
#2 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.00 s | 1, 2 | details |
#2 | ACCEPTED | 0.00 s | 1, 2 | details |
#3 | ACCEPTED | 0.00 s | 1, 2 | details |
#4 | ACCEPTED | 0.00 s | 1, 2 | details |
#5 | ACCEPTED | 0.00 s | 1, 2 | details |
#6 | WRONG ANSWER | 0.00 s | 1, 2 | details |
#7 | WRONG ANSWER | 0.11 s | 2 | details |
#8 | WRONG ANSWER | 0.00 s | 1, 2 | details |
#9 | WRONG ANSWER | 0.11 s | 2 | details |
#10 | WRONG ANSWER | 0.00 s | 1, 2 | details |
#11 | WRONG ANSWER | 0.12 s | 2 | details |
#12 | ACCEPTED | 0.11 s | 2 | details |
#13 | ACCEPTED | 0.13 s | 2 | details |
#14 | ACCEPTED | 0.12 s | 2 | details |
#15 | ACCEPTED | 0.00 s | 1, 2 | details |
#16 | ACCEPTED | 0.00 s | 1, 2 | details |
#17 | ACCEPTED | 0.00 s | 1, 2 | details |
#18 | ACCEPTED | 0.00 s | 1, 2 | details |
#19 | ACCEPTED | 0.00 s | 1, 2 | details |
#20 | ACCEPTED | 0.00 s | 1, 2 | details |
#21 | ACCEPTED | 0.10 s | 2 | details |
#22 | ACCEPTED | 0.10 s | 2 | details |
#23 | ACCEPTED | 0.10 s | 2 | details |
#24 | ACCEPTED | 0.01 s | 1, 2 | details |
#25 | ACCEPTED | 0.10 s | 2 | details |
#26 | ACCEPTED | 0.00 s | 1, 2 | details |
#27 | ACCEPTED | 0.09 s | 2 | details |
#28 | ACCEPTED | 0.00 s | 1, 2 | details |
#29 | ACCEPTED | 0.09 s | 2 | details |
#30 | ACCEPTED | 0.00 s | 1, 2 | details |
#31 | ACCEPTED | 0.10 s | 2 | details |
Compiler report
input/code.cpp: In lambda function: input/code.cpp:37:9: warning: control reaches end of non-void function [-Wreturn-type] 37 | }; | ^ input/code.cpp: In member function 'City::Dir City::get_dir(City*)': input/code.cpp:52:5: warning: control reaches end of non-void function [-Wreturn-type] 52 | } | ^ input/code.cpp: In member function 'll City::shortest_not_in(City::Dir)': input/code.cpp:93:5: warning: control reaches end of non-void function [-Wreturn-type] 93 | } | ^
Code
#include <algorithm>#include <cassert>#include <chrono>#include <climits>#include <iostream>#include <memory>#include <numeric>#include <sstream>#include <thread>#include <vector>using ll = long long;struct City {enum class Dir {Up,Left,Right,None};City* up = nullptr;City* left = nullptr;City* right = nullptr;ll up_d = LLONG_MAX;ll left_d = LLONG_MAX;ll right_d = LLONG_MAX;bool port;void connect(City& o, ll dist) {auto choose = [](City& c) {if (!c.up) return std::pair{ &c.up, &c.up_d };if (!c.left) return std::pair{ &c.left, &c.left_d };if (!c.right) return std::pair{ &c.right, &c.right_d };// assert(false);};auto tgt = choose(*this);auto src = choose(o);*tgt.first = &o;*tgt.second = dist;*src.first = this;*src.second = dist;}Dir get_dir(City* c) {if (c == up) return Dir::Up;if (c == left) return Dir::Left;if (c == right) return Dir::Right;// assert(false);}static ll add(ll a, ll b) {if (a == LLONG_MAX || b == LLONG_MAX) return LLONG_MAX;return a + b;}ll fdist_port;Dir fdir_from;ll ud = LLONG_MAX;ll ld = LLONG_MAX;ll rd = LLONG_MAX;void first_pass(Dir dir) {ll pd = port ? 0 : LLONG_MAX;fdir_from = dir;if (dir != Dir::Up && up) {auto d = up->get_dir(this);up->first_pass(d);ud = add(up->fdist_port, up_d);}if (dir != Dir::Right && right) {auto d = right->get_dir(this);right->first_pass(d);rd = add(right->fdist_port, right_d);}if (dir != Dir::Left && left) {auto d = left->get_dir(this);left->first_pass(d);ld = add(left->fdist_port, left_d);}fdist_port = std::min({ ud, ld, rd, pd });}ll shortest_not_in(Dir d) {if (port) return 0;if (d == Dir::Left) return std::min(ud, rd);if (d == Dir::Right) return std::min(ud, ld);if (d == Dir::Up) return std::min(ld, rd);// assert(false);}inline static ll res = 0;ll shortest = LLONG_MAX;void second_pass() {if (fdir_from == Dir::None) {// Rootres += fdist_port;shortest = fdist_port;if (up) up->second_pass();if (right) right->second_pass();if (left) left->second_pass();return;}if (fdir_from == Dir::Up) {ll sd = shortest_not_in(fdir_from);shortest = std::min(add(up->shortest, up_d), sd);res += shortest;if (left) left->second_pass();if (right) right->second_pass();}if (fdir_from == Dir::Left) {ll sd = shortest_not_in(fdir_from);shortest = std::min(add(left->shortest, left_d), sd);res += shortest;if (up) up->second_pass();if (right) right->second_pass();}if (fdir_from == Dir::Right) {ll sd = shortest_not_in(fdir_from);shortest = std::min(add(right->shortest, right_d), sd);res += shortest;if (up) up->second_pass();if (left) left->second_pass();}}};int main() {std::cin.sync_with_stdio(false);auto& stream = std::cin;// std::stringstream ss{// R"(6// 1 0 0 0 1 1// 2 1 20// 2 3 30// 2 5 50// 6 3 60// 1 4 10// )"// };// ss.copyfmt(std::cin);// ss.exceptions(ss.badbit | ss.failbit);// auto& stream = ss;int n;stream >> n;std::vector<City> cities;cities.reserve(n);for (int i = 0; i < n; ++i) {//int v;stream >> v;City nw{};nw.port = v == 0 ? true : false;cities.push_back(nw);}for (int i = 0; i < n - 1; ++i) {int a, b, c;stream >> a >> b >> c;cities[a - 1].connect(cities[b - 1], c);}cities[0].first_pass(City::Dir::None);// for (auto& c : cities) { std::cout << c.fdist_port << "\n"; }cities[0].second_pass();std::cout << City::res;}
Test details
Test 1
Group: 1, 2
Verdict: ACCEPTED
input |
---|
1 0 |
correct output |
---|
0 |
user output |
---|
0 |
Test 2
Group: 1, 2
Verdict: ACCEPTED
input |
---|
5 0 0 0 0 0 1 2 1 2 3 2 3 4 3 ... |
correct output |
---|
0 |
user output |
---|
0 |
Test 3
Group: 1, 2
Verdict: ACCEPTED
input |
---|
4 1 0 1 1 1 2 10 2 3 20 2 4 30 |
correct output |
---|
60 |
user output |
---|
60 |
Test 4
Group: 1, 2
Verdict: ACCEPTED
input |
---|
5 0 1 1 1 0 1 2 10 2 3 20 3 4 30 ... |
correct output |
---|
80 |
user output |
---|
80 |
Test 5
Group: 1, 2
Verdict: ACCEPTED
input |
---|
5 0 1 0 1 1 1 2 1 2 3 5 3 4 3 ... |
correct output |
---|
6 |
user output |
---|
6 |
Test 6
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
5506363 |
user output |
---|
9223372036854775777 |
Test 7
Group: 2
Verdict: WRONG ANSWER
input |
---|
200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
1795118520 |
user output |
---|
-84 |
Test 8
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 0 0 1 0 1 1 0 1 0 1 1 0 0 0 1 ... |
correct output |
---|
293576 |
user output |
---|
7340 |
Test 9
Group: 2
Verdict: WRONG ANSWER
input |
---|
200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
816932444 |
user output |
---|
-56 |
Test 10
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
correct output |
---|
3089 |
user output |
---|
0 |
Test 11
Group: 2
Verdict: WRONG ANSWER
input |
---|
200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
correct output |
---|
40839 |
user output |
---|
0 |
Test 12
Group: 2
Verdict: ACCEPTED
input |
---|
200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
5683983203973 |
user output |
---|
5683983203973 |
Test 13
Group: 2
Verdict: ACCEPTED
input |
---|
200000 0 1 1 1 1 1 1 0 0 0 1 1 0 1 0 ... |
correct output |
---|
58572993 |
user output |
---|
58572993 |
Test 14
Group: 2
Verdict: ACCEPTED
input |
---|
200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
correct output |
---|
32755 |
user output |
---|
32755 |
Test 15
Group: 1, 2
Verdict: ACCEPTED
input |
---|
1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
126238345 |
user output |
---|
126238345 |
Test 16
Group: 1, 2
Verdict: ACCEPTED
input |
---|
1000 0 0 0 1 0 1 1 1 0 0 1 0 1 1 0 ... |
correct output |
---|
278678 |
user output |
---|
278678 |
Test 17
Group: 1, 2
Verdict: ACCEPTED
input |
---|
1000 1 0 0 0 1 0 0 0 1 0 0 0 0 0 0 ... |
correct output |
---|
34929 |
user output |
---|
34929 |
Test 18
Group: 1, 2
Verdict: ACCEPTED
input |
---|
1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
1543963 |
user output |
---|
1543963 |
Test 19
Group: 1, 2
Verdict: ACCEPTED
input |
---|
1000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
correct output |
---|
39606 |
user output |
---|
39606 |
Test 20
Group: 1, 2
Verdict: ACCEPTED
input |
---|
1000 1 0 1 0 1 0 0 0 0 1 1 0 0 0 1 ... |
correct output |
---|
321598 |
user output |
---|
321598 |
Test 21
Group: 2
Verdict: ACCEPTED
input |
---|
200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
978670626 |
user output |
---|
978670626 |
Test 22
Group: 2
Verdict: ACCEPTED
input |
---|
200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
correct output |
---|
375218 |
user output |
---|
375218 |
Test 23
Group: 2
Verdict: ACCEPTED
input |
---|
200000 1 1 1 1 0 0 0 0 0 1 0 1 0 1 1 ... |
correct output |
---|
60422556 |
user output |
---|
60422556 |
Test 24
Group: 1, 2
Verdict: ACCEPTED
input |
---|
1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
291990 |
user output |
---|
291990 |
Test 25
Group: 2
Verdict: ACCEPTED
input |
---|
200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
59607954 |
user output |
---|
59607954 |
Test 26
Group: 1, 2
Verdict: ACCEPTED
input |
---|
1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
990 |
user output |
---|
990 |
Test 27
Group: 2
Verdict: ACCEPTED
input |
---|
200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
199982 |
user output |
---|
199982 |
Test 28
Group: 1, 2
Verdict: ACCEPTED
input |
---|
1000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
7987 |
user output |
---|
7987 |
Test 29
Group: 2
Verdict: ACCEPTED
input |
---|
200000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
3137875 |
user output |
---|
3137875 |
Test 30
Group: 1, 2
Verdict: ACCEPTED
input |
---|
1000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
4657693 |
user output |
---|
4657693 |
Test 31
Group: 2
Verdict: ACCEPTED
input |
---|
200000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
1652889357 |
user output |
---|
1652889357 |