Task: | Sadonkorjuu |
Sender: | a256 |
Submission time: | 2022-10-31 21:22:56 +0200 |
Language: | C++ (C++11) |
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.01 s | 1, 2 | details |
#7 | WRONG ANSWER | 0.26 s | 2 | details |
#8 | WRONG ANSWER | 0.01 s | 1, 2 | details |
#9 | WRONG ANSWER | 0.26 s | 2 | details |
#10 | WRONG ANSWER | 0.01 s | 1, 2 | details |
#11 | WRONG ANSWER | 0.33 s | 2 | details |
#12 | ACCEPTED | 0.27 s | 2 | details |
#13 | ACCEPTED | 0.26 s | 2 | details |
#14 | ACCEPTED | 0.26 s | 2 | details |
#15 | ACCEPTED | 0.01 s | 1, 2 | details |
#16 | ACCEPTED | 0.01 s | 1, 2 | details |
#17 | ACCEPTED | 0.01 s | 1, 2 | details |
#18 | ACCEPTED | 0.01 s | 1, 2 | details |
#19 | ACCEPTED | 0.01 s | 1, 2 | details |
#20 | ACCEPTED | 0.01 s | 1, 2 | details |
#21 | ACCEPTED | 0.26 s | 2 | details |
#22 | ACCEPTED | 0.26 s | 2 | details |
#23 | ACCEPTED | 0.26 s | 2 | details |
#24 | ACCEPTED | 0.01 s | 1, 2 | details |
#25 | ACCEPTED | 0.36 s | 2 | details |
#26 | ACCEPTED | 0.01 s | 1, 2 | details |
#27 | ACCEPTED | 0.25 s | 2 | details |
#28 | ACCEPTED | 0.01 s | 1, 2 | details |
#29 | ACCEPTED | 0.24 s | 2 | details |
#30 | ACCEPTED | 0.01 s | 1, 2 | details |
#31 | ACCEPTED | 0.28 s | 2 | details |
Code
#include <bits/stdc++.h>using namespace std;#define FOR(i, n) for(decltype(n) i=0;i<(n);++i)#define FORI(i, s, n) for(decltype(n) i=(s);i<(n);++i)#define BE(t) t.begin(), t.end()#define RBE(t) t.rbegin(), t.rend()#define evn(n) (!((n) & 1))#define PB push_back#define MP(f, s) make_pair((f), (s))#define F first#define S second#define pmod(a, m) ((a)%(m)+(m))%(m)typedef unsigned long long ull;typedef long long ll;#define MOD ((ll)1e9+7)#define CEILDIV(a, b) (((a)-1)/(b)+1)typedef struct city city;ll n;vector<city> k;queue<ll> satamat;struct city {ll parent;ll length;bool satama;vector<ll> idx;vector<ll> len;ull distance;city(){parent = -1;distance = INT_MAX;}void prll(ll indent=0){cout << '(' << (satama ? 'S' : 'P');cout << '\n';indent += 2;// if(idx[0] != -1){// for(ll i = 0; i < indent; ++i)// cout << ' ';// ll l = k[idx[0]].distance;// if(l != INT_MAX)// cout << l;// k[idx[0]].prll(indent);// }//// if(idx[1] != -1){// for(ll i = 0; i < indent; ++i)// cout << ' ';// ll l = k[idx[1]].distance;// if(l != INT_MAX)// cout << l;// k[idx[1]].prll(indent);// }indent -= 2;for(ll i = 0; i < indent; ++i)cout << ' ';cout << ')';cout << "\n";}void solve(ull d=0){distance = d;if(parent != -1){ull nl = d+length;if(nl < k[parent].distance)k[parent].solve(nl);}for(ll i = 0; i < (ll)idx.size(); ++i){ull nl = d+len[i];if(nl < k[idx[i]].distance)k[idx[i]].solve(nl);}}};int main(){cin >> n;k.resize(n, city());FOR(i, n){ll pelto;cin >> pelto;k[i].satama = !pelto;if(!pelto){k[i].distance = 0;satamat.push(i);}}FOR(i, n-1){ll a, b, c;cin >> a >> b >> c;--a, --b;city &ac = k[a];ac.idx.push_back(b);ac.len.push_back(c);k[b].parent = a;k[b].length = c;}while(satamat.size()){k[satamat.front()].solve();satamat.pop();}//cout << k[0].distance;//k[0].prll();//cout << '\n';ull sum = 0;FOR(i, n){sum += k[i].distance;//cout << i+1 << ' ' << k[i].distance << '\n';}cout << sum << '\n';}
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 |
---|
2123861348284 |
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 |
---|
429460222224205 |
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 |
---|
307090375226 |
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 |
---|
415177321574192 |
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 |
---|
4294970483 |
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 |
---|
40802224459 |
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 |