CSES - Datatähti 2023 alku

CSES - Datatähti 2023 alku - Results

Submission details
Task:	Sadonkorjuu
Sender:	Septicuss
Submission time:	2022-11-08 12:37:23 +0200
Language:	C++ (C++17)
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	RUNTIME ERROR	0
#2	RUNTIME ERROR	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.00 s	1, 2	details
#2	ACCEPTED	0.00 s	1, 2	details
#3	RUNTIME ERROR	0.00 s	1, 2	details
#4	ACCEPTED	0.00 s	1, 2	details
#5	ACCEPTED	0.00 s	1, 2	details
#6	RUNTIME ERROR	0.01 s	1, 2	details
#7	RUNTIME ERROR	0.25 s	2	details
#8	RUNTIME ERROR	0.01 s	1, 2	details
#9	RUNTIME ERROR	0.25 s	2	details
#10	RUNTIME ERROR	0.01 s	1, 2	details
#11	RUNTIME ERROR	0.26 s	2	details
#12	RUNTIME ERROR	0.24 s	2	details
#13	RUNTIME ERROR	0.24 s	2	details
#14	RUNTIME ERROR	0.24 s	2	details
#15	RUNTIME ERROR	0.01 s	1, 2	details
#16	RUNTIME ERROR	0.01 s	1, 2	details
#17	RUNTIME ERROR	0.01 s	1, 2	details
#18	RUNTIME ERROR	0.01 s	1, 2	details
#19	RUNTIME ERROR	0.01 s	1, 2	details
#20	RUNTIME ERROR	0.01 s	1, 2	details
#21	RUNTIME ERROR	0.24 s	2	details
#22	RUNTIME ERROR	0.24 s	2	details
#23	RUNTIME ERROR	0.24 s	2	details
#24	RUNTIME ERROR	0.01 s	1, 2	details
#25	RUNTIME ERROR	0.24 s	2	details
#26	RUNTIME ERROR	0.01 s	1, 2	details
#27	RUNTIME ERROR	0.22 s	2	details
#28	RUNTIME ERROR	0.01 s	1, 2	details
#29	RUNTIME ERROR	0.22 s	2	details
#30	RUNTIME ERROR	0.01 s	1, 2	details
#31	RUNTIME ERROR	0.23 s	2	details

Code

#include "bits/stdc++.h"

using namespace std;

const int inf = 1e9 + 1;
const int k = 1000;

void init_code() {
  #ifndef ONLINE_JUDGE
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
  #endif // ONLINE JUDGE
}


signed main() {
  init_code();

  int n; 
  cin >> n;

  int size = n + 1;
  int ports[size];
  vector<pair<int, int>> edges[size];

  int index = 1;
  for (int i = 1; i <= n; i++) {
    int type;
    cin >> type;
    if (type == 0) {
      ports[index] = i;
      index++;
    }
  }

  for (int i = 1; i < n; i++) {
    int a, b, c;
    cin >> a >> b >> c;
    edges[a].push_back({b, c});
    edges[b].push_back({a, c});
  }

  for (int port : ports) {
    edges[0].push_back({port,0});
  }


  vector<int> distance(size, inf);
  vector<int> visited(size);

  queue<int> bfs[k + 1];
  
  bfs[0].push(0);
  distance[0] = 0;

  // Dial's algorithm
  // We use buckets to speed up bfs

  int pos = 0,  kol = 1;
  while (kol > 0) {
    while (bfs[pos % (k + 1)].empty()) {
      ++pos;
    }

    int v = bfs[pos % (k + 1)].front();
    bfs[pos % (k + 1)].pop();
    kol--;
    
    if (visited[v]) continue;
    visited[v] = 1;

    for (pair<int, int> edge : edges[v]) {
      int cost = edge.second;
      int w = edge.first;

      if (distance[v] + cost < distance[w]) {
          distance[w] = distance[v] + cost;
          bfs[distance[w] % (k + 1)].push(w);
          ++kol;
      }
    }
  }

  long long c = 0;
  for (int d : distance)
    c+=d;

  cout << c << '\n';
}

Test details

Test 1

Group: 1, 2

Verdict: ACCEPTED

input
`1 0` view save

correct output
`0` view save

user output
`0` view save

Test 2

Group: 1, 2

Verdict: ACCEPTED

input
`5 0 0 0 0 0 1 2 1 2 3 2 3 4 3 ...` view save

correct output
`0` view save

user output
`0` view save

Test 3

Group: 1, 2

Verdict: RUNTIME ERROR

input
`4 1 0 1 1 1 2 10 2 3 20 2 4 30` view save

correct output
`60` view save

user output
(empty)

Test 4

Group: 1, 2

Verdict: ACCEPTED

input
`5 0 1 1 1 0 1 2 10 2 3 20 3 4 30 ...` view save

correct output
`80` view save

user output
`80` view save

Test 5

Group: 1, 2

Verdict: ACCEPTED

input
`5 0 1 0 1 1 1 2 1 2 3 5 3 4 3 ...` view save

correct output
`6` view save

user output
`6` view save

Test 6

Group: 1, 2

Verdict: RUNTIME ERROR

input
`1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`5506363` view save

user output
(empty)

Test 7

Group: 2

Verdict: RUNTIME ERROR

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`1795118520` view save

user output
(empty)

Test 8

Group: 1, 2

Verdict: RUNTIME ERROR

input
`1000 0 0 1 0 1 1 0 1 0 1 1 0 0 0 1 ...` view save

correct output
`293576` view save

user output
(empty)

Test 9

Group: 2

Verdict: RUNTIME ERROR

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`816932444` view save

user output
(empty)

Test 10

Group: 1, 2

Verdict: RUNTIME ERROR

input
`1000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

correct output
`3089` view save

user output
(empty)

Test 11

Group: 2

Verdict: RUNTIME ERROR

input
`200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

correct output
`40839` view save

user output
(empty)

Test 12

Group: 2

Verdict: RUNTIME ERROR

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`5683983203973` view save

user output
(empty)

Test 13

Group: 2

Verdict: RUNTIME ERROR

input
`200000 0 1 1 1 1 1 1 0 0 0 1 1 0 1 0 ...` view save

correct output
`58572993` view save

user output
(empty)

Test 14

Group: 2

Verdict: RUNTIME ERROR

input
`200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

correct output
`32755` view save

user output
(empty)

Test 15

Group: 1, 2

Verdict: RUNTIME ERROR

input
`1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`126238345` view save

user output
(empty)

Test 16

Group: 1, 2

Verdict: RUNTIME ERROR

input
`1000 0 0 0 1 0 1 1 1 0 0 1 0 1 1 0 ...` view save

correct output
`278678` view save

user output
(empty)

Test 17

Group: 1, 2

Verdict: RUNTIME ERROR

input
`1000 1 0 0 0 1 0 0 0 1 0 0 0 0 0 0 ...` view save

correct output
`34929` view save

user output
(empty)

Test 18

Group: 1, 2

Verdict: RUNTIME ERROR

input
`1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`1543963` view save

user output
(empty)

Test 19

Group: 1, 2

Verdict: RUNTIME ERROR

input
`1000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

correct output
`39606` view save

user output
(empty)

Test 20

Group: 1, 2

Verdict: RUNTIME ERROR

input
`1000 1 0 1 0 1 0 0 0 0 1 1 0 0 0 1 ...` view save

correct output
`321598` view save

user output
(empty)

Test 21

Group: 2

Verdict: RUNTIME ERROR

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`978670626` view save

user output
(empty)

Test 22

Group: 2

Verdict: RUNTIME ERROR

input
`200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...` view save

correct output
`375218` view save

user output
(empty)

Test 23

Group: 2

Verdict: RUNTIME ERROR

input
`200000 1 1 1 1 0 0 0 0 0 1 0 1 0 1 1 ...` view save

correct output
`60422556` view save

user output
(empty)

Test 24

Group: 1, 2

Verdict: RUNTIME ERROR

input
`1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`291990` view save

user output
(empty)

Test 25

Group: 2

Verdict: RUNTIME ERROR

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`59607954` view save

user output
(empty)

Test 26

Group: 1, 2

Verdict: RUNTIME ERROR

input
`1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`990` view save

user output
(empty)

Test 27

Group: 2

Verdict: RUNTIME ERROR

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`199982` view save

user output
(empty)

Test 28

Group: 1, 2

Verdict: RUNTIME ERROR

input
`1000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`7987` view save

user output
(empty)

Test 29

Group: 2

Verdict: RUNTIME ERROR

input
`200000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`3137875` view save

user output
(empty)

Test 30

Group: 1, 2

Verdict: RUNTIME ERROR

input
`1000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`4657693` view save

user output
(empty)

Test 31

Group: 2

Verdict: RUNTIME ERROR

input
`200000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`1652889357` view save

user output
(empty)

Datatähti 2023 alku

Sadonkorjuu

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Test 31

Tasks

Submissions (Septicuss)