Task: | Tietoverkko |
Sender: | okkokko |
Submission time: | 2021-10-12 17:41:43 +0300 |
Language: | C++ (C++11) |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | RUNTIME ERROR | 0 |
#2 | RUNTIME ERROR | 0 |
#3 | RUNTIME ERROR | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | RUNTIME ERROR | 0.61 s | 1, 2, 3 | details |
#2 | RUNTIME ERROR | 0.01 s | 2, 3 | details |
#3 | RUNTIME ERROR | 0.28 s | 3 | details |
Code
#include <iostream>#include <map>using namespace std;using std::map;map<int,int> *koneet;int total = 0;map<int,int> Crossroads(int kone,int source,int sourceSpeed) {map<int,int> yhteydet;yhteydet[sourceSpeed] = 1;int addTotal = 0;map<int,int> &ko = koneet[kone];//int haaSize=ko.size()-1;/*if (haaSize==0){//return map<int,int> {{sourceSpeed,1}};map<int,int> a;a[sourceSpeed]=1;return a;}if (source==0){haaSize+=1;}*///map<int,int> haarat[haaSize+1];int i_k = 0;for (auto &item : ko){if (item.first !=source){//haarat[i_k]=Crossroads(item.first,kone,item.second);i_k+=1;}}/*for (int i = 0; i<haaSize; i++){for (auto &item : haarat[i]){int a = std::min(item.first, sourceSpeed);yhteydet.emplace(a,0);yhteydet[a]+=item.second;addTotal+=item.second*item.first;}}*if (haaSize>1 && false){int addTotalHalf = 0;map<int,int> yhtyhaara;for (int i = 0; i<haaSize; i++){for (auto &item : haarat[i]){yhtyhaara.emplace(item.first,0);yhtyhaara[item.first]+=item.second;}}//int yhSize = yhtyhaara.size();int ta = 0;int tb = 0;for (auto &item : yhtyhaara){tb+=item.second;}for (auto &item : yhtyhaara){ta+=item.first*item.second;tb-=item.second;addTotalHalf+=(ta+tb*item.first)*item.second;}for (auto &item1 : haarat){int ta = 0;int tb = 0;for (auto &item : item1){tb+=item.second;}for (auto &item : item1){ta+=item.first*item.second;tb-=item.second;addTotalHalf-=(ta+tb*item.first)*item.second;}}addTotal+=addTotalHalf/2;}*/total+=addTotal;return yhteydet;}int main(){int n;cin >> n;koneet =new map<int,int>[n];for (int i = 0; i<n; i++){int c0,c1,c2;cin >> c0;cin >> c1;cin >> c2;koneet[c0][c1]=c2;koneet[c1][c0]=c2;}Crossroads(1,0,0);cout << total;return 0;}
Test details
Test 1
Group: 1, 2, 3
Verdict: RUNTIME ERROR
input |
---|
100 1 2 74 1 3 100 2 4 50 3 5 40 ... |
correct output |
---|
88687 |
user output |
---|
(empty) |
Test 2
Group: 2, 3
Verdict: RUNTIME ERROR
input |
---|
5000 1 2 613084013 1 3 832364259 2 4 411999902 3 5 989696303 ... |
correct output |
---|
1103702320243776 |
user output |
---|
(empty) |
Test 3
Group: 3
Verdict: RUNTIME ERROR
input |
---|
200000 1 2 613084013 1 3 832364259 2 4 411999902 3 5 989696303 ... |
correct output |
---|
1080549209850010931 |
user output |
---|
(empty) |