CSES - NOI 2024

CSES - NOI 2024 - Results

Submission details
Task:	Anime Shops
Sender:	Nicolai Frigaard
Submission time:	2024-03-06 18:19:09 +0200
Language:	C++ (C++11)
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#2	WRONG ANSWER	0
#3	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.00 s	1, 3	details
#2	WRONG ANSWER	0.01 s	1, 3	details
#3	WRONG ANSWER	0.01 s	1, 3	details
#4	ACCEPTED	0.01 s	1, 3	details
#5	ACCEPTED	0.12 s	3	details
#6	WRONG ANSWER	0.18 s	3	details
#7	WRONG ANSWER	0.24 s	3	details
#8	ACCEPTED	0.59 s	3	details
#9	ACCEPTED	0.05 s	2, 3	details
#10	WRONG ANSWER	0.05 s	2, 3	details
#11	ACCEPTED	0.13 s	2, 3	details
#12	WRONG ANSWER	0.05 s	3	details
#13	WRONG ANSWER	0.27 s	3	details
#14	TIME LIMIT EXCEEDED	--	3	details
#15	ACCEPTED	0.05 s	3	details
#16	WRONG ANSWER	0.05 s	3	details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:39:13: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |   std::scanf("%d %d %d", &N, &M, &K);
      |   ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:44:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   44 |     scanf("%d", &a);
      |     ~~~~~^~~~~~~~~~
input/code.cpp:51:15: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |     std::scanf("%d %d", &a, &b);
      |     ~~~~~~~~~~^~~~~~~~~~~~~~~~~

Code

#include <cstdio>

#include <algorithm>
#include <deque>
#include <vector>
#include <limits>
#include <utility>

void bfs(int root, std::vector<bool> &visited, std::vector<std::vector<int>> &roads, std::vector<int> &distances) {
  std::deque<std::pair<int, int>> queue;

  visited[root] = true;
  for (int neighbor : roads[root]) if (!visited[neighbor]) {
    visited[neighbor] = true;
    queue.push_back({ neighbor, 1 });
  }

  while (!queue.empty()) {
    auto par = queue.front();
    queue.pop_front();

    int city = par.first;
    int distance = par.second;

    if (distances[city] != -1 && distance > distances[city]) {
      continue;
    }
    distances[city] = distance;

    for (int neighbor : roads[city]) if (!visited[neighbor]) {
      visited[neighbor] = true;
      queue.push_back({ neighbor, distance + 1 });
    }
  }
}

int main() {
  int N, M, K;
  std::scanf("%d %d %d", &N, &M, &K);

  std::vector<int> marked;
  for (int k = 0; k < K; k++) {
    int a;
    scanf("%d", &a);
    marked.push_back(a - 1);
  }

  std::vector<std::vector<int>> roads(N, std::vector<int>());
  int a, b;
  for (int m = 0; m < M; m++) {
    std::scanf("%d %d", &a, &b);
    roads[a - 1].push_back(b - 1);
    roads[b - 1].push_back(a - 1);
  }

  std::vector<int> distances(N, -1);
  std::vector<bool> visited(N, false);
  for (int m : marked) {
    visited.assign(N, false);
    bfs(m, visited, roads, distances);
  }

  for (int city : distances) {
    std::printf("%d ", city);
  }
  std::printf("\n");

  return 0;
}

Test details

Test 1

Group: 1, 3

Verdict: ACCEPTED

input
`1000 2000 1 816 1 868 976 995 377 536 ...` view save

correct output
`4 3 3 4 6 4 -1 4 5 2 2 5 5 3 5...` view save

user output
`4 3 3 4 6 4 -1 4 5 2 2 5 5 3 5...` Truncated

Test 2

Group: 1, 3

Verdict: WRONG ANSWER

input
`1000 2000 20 578 955 222 813 494 962 753 71...` view save

correct output
`5 6 4 3 4 2 -1 3 3 3 4 3 2 3 -...` view save

user output
`5 6 4 3 4 2 -1 3 3 3 4 3 2 3 -...` Truncated

Test 3

Group: 1, 3

Verdict: WRONG ANSWER

input
`1000 2000 100 945 230 119 680 975 520 490 28...` view save

correct output
`2 2 3 -1 2 -1 3 2 2 1 2 -1 3 2...` view save

user output
`2 2 3 -1 2 -1 3 2 2 1 2 -1 3 2...` Truncated

Test 4

Group: 1, 3

Verdict: ACCEPTED

input
`1000 2000 1000 150 443 960 545 218 487 896 38...` view save

correct output
`1 -1 1 1 -1 1 1 1 -1 1 1 1 -1 ...` view save

user output
`1 -1 1 1 -1 1 1 1 -1 1 1 1 -1 ...` Truncated

Test 5

Group: 3

Verdict: ACCEPTED

input
`100000 200000 1 77222 59470 61811 43092 48939 14395 19964 ...` view save

correct output
`8 10 8 8 8 8 8 8 9 7 7 8 8 8 6...` view save

user output
`8 10 8 8 8 8 8 8 9 7 7 8 8 8 6...` Truncated

Test 6

Group: 3

Verdict: WRONG ANSWER

input
`100000 200000 20 70440 82302 64483 96767 51485 ...` view save

correct output
`-1 8 6 5 5 7 6 7 6 6 8 5 6 4 5...` view save

user output
`-1 8 6 5 5 7 6 7 6 6 8 5 6 4 5...` Truncated

Test 7

Group: 3

Verdict: WRONG ANSWER

input
`100000 200000 100 68738 37820 55519 77758 46482 ...` view save

correct output
`4 5 5 5 5 4 6 -1 5 4 5 6 4 5 5...` view save

user output
`4 5 5 5 5 4 6 -1 5 4 5 6 4 5 5...` Truncated

Test 8

Group: 3

Verdict: ACCEPTED

input
`100000 200000 100000 47137 80137 73347 78145 9205 6...` view save

correct output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

user output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` Truncated

Test 9

Group: 2, 3

Verdict: ACCEPTED

input
`100000 99999 1 44158 1 2 2 3 3 4 ...` view save

correct output
`44157 44156 44155 44154 44153 ...` view save

user output
`44157 44156 44155 44154 44153 ...` Truncated

Test 10

Group: 2, 3

Verdict: WRONG ANSWER

input
`100000 99999 20 44158 25720 84658 90057 99607 ...` view save

correct output
`361 360 359 358 357 356 355 35...` view save

user output
`361 360 359 358 357 356 355 35...` Truncated

Test 11

Group: 2, 3

Verdict: ACCEPTED

input
`100000 99999 100000 44158 25720 84658 90057 99607 ...` view save

correct output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

user output
`1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` Truncated

Test 12

Group: 3

Verdict: WRONG ANSWER

input
`100000 99999 3 99998 99999 100000 1 2 1 3 1 4 ...` view save

correct output
`33333 33332 33332 33332 33331 ...` view save

user output
`33333 33332 33332 33332 33331 ...` Truncated

Test 13

Group: 3

Verdict: WRONG ANSWER

input
`100000 99999 300 99701 99702 99703 99704 99705 ...` view save

correct output
`333 333 333 333 333 333 333 33...` view save

user output
`333 333 333 333 333 333 333 33...` Truncated

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`100000 99999 30000 70001 70002 70003 70004 70005 ...` view save

correct output
`3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 ...` view save

user output
(empty)

Test 15

Group: 3

Verdict: ACCEPTED

input
`100000 0 100000 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

correct output
`-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 ...` view save

user output
`-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 ...` Truncated

Test 16

Group: 3

Verdict: WRONG ANSWER

input
`100000 100000 2 1 50001 1 2 2 3 3 4 ...` view save

correct output
`50000 1 2 3 4 5 6 7 8 9 10 11 ...` view save

user output
`-1 1 2 3 4 5 6 7 8 9 10 11 12 ...` Truncated

NOI 2024

Anime Shops

Compiler report

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

Tasks

Submissions (Nicolai Frigaard)