CSES - NOI 2024

CSES - NOI 2024 - Results

Submission details
Task:	Anime Shops
Sender:
Submission time:	2024-03-06 16:39:04 +0200
Language:	C++ (C++17)
Status:	READY
Result:	0

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

Test results
test	verdict	time	group
#1	RUNTIME ERROR	0.06 s	1, 3	details
#2	RUNTIME ERROR	0.03 s	1, 3	details
#3	RUNTIME ERROR	0.03 s	1, 3	details
#4	RUNTIME ERROR	0.02 s	1, 3	details
#5	RUNTIME ERROR	0.08 s	3	details
#6	RUNTIME ERROR	0.08 s	3	details
#7	RUNTIME ERROR	0.08 s	3	details
#8	RUNTIME ERROR	0.09 s	3	details
#9	RUNTIME ERROR	0.04 s	2, 3	details
#10	RUNTIME ERROR	0.04 s	2, 3	details
#11	RUNTIME ERROR	0.05 s	2, 3	details
#12	RUNTIME ERROR	0.04 s	3	details
#13	RUNTIME ERROR	0.04 s	3	details
#14	RUNTIME ERROR	0.04 s	3	details
#15	RUNTIME ERROR	0.85 s	3	details
#16	RUNTIME ERROR	0.04 s	3	details

Code

#include <bits/stdc++.h>
#include <queue>
using namespace std;
 
#define MAXN 1000
#define INF 1e6
 
typedef pair<int, int> pii;
priority_queue<pii> q;
vector<int> adj[MAXN][MAXN];
int dist[MAXN];
int parent[MAXN];
 
int find_set(int u) {
  if (parent[u] == -1)
    return u;
 
  return parent[u] = find_set(parent[u]);
}
 
void unite(int a, int b) {
  a = find_set(a);
  b = find_set(b);
 
  if (a != b) {
    parent[b] = a;
  }
}
 
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  int n, m, k;
  cin >> n >> m >> k;
 
  vector<bool> shop(n + 1, false);
 
  int c;
  for (int i = 0; i < k; ++i) {
    cin >> c;
    shop[c] = true;
  }
 
  vector<pii> edges(m);
 
  fill_n(parent, n + 1, -1);
  int a, b;
  for (int i = 0; i < m; ++i) {
    cin >> a >> b;
 
    unite(a, b);
    edges.push_back({a, b});
  }
 
  for (auto edge : edges) {
    int a = edge.first, b = edge.second;
    auto s = find_set(a);
    adj[s][a].emplace_back(b);
    adj[s][b].emplace_back(a);
  }
 
  // Group 2
  if (m == n - 1) {
    fill_n(dist, n + 1, INF);
    int seen = INF;
    for (int i = 1; i < n + 1; ++i) {
      dist[i] = seen + 1;
      if (shop[i]) {
        seen = 0;
      } else {
        seen++;
      }
    }
    seen = INF;
    for (int i = n; i > 0; --i) {
      dist[i] = min(seen + 1, dist[i]);
      if (shop[i]) {
        seen = 0;
      } else {
        seen++;
      }
    }
 
    for (int i = 1; i < n + 1; ++i) {
      cout << ((dist[i] < INF) ? dist[i] : -1) << ' ';
    }
    return 0;
  }
 
  for (int x = 1; x < n + 1; ++x) {
    fill_n(dist, n + 1, INF);
    dist[x] = 0;
 
    q = {};
    q.push({0, x});
 
    auto g = find_set(x);
    int target = -1;
    while (!q.empty()) {
      int a = q.top().second;
 
      // Found the shortest path to an anime shop
      if (shop[a] && a != x) {
        target = a;
 
        // printf("shortest %d -> %d dist: %d\n", x, a, dist[a]);
        break;
      }
 
      q.pop();
      for (auto b : adj[g][a]) {
        if (dist[a] + 1 < dist[b]) {
          dist[b] = dist[a] + 1;
          q.push({-dist[b], b});
        }
      }
    }
 
    cout << (target == -1 ? target : dist[target]) << ' ';
  }
  cout << '\n';
}

Test details

Test 1

Group: 1, 3

Verdict: RUNTIME ERROR

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
(empty)

Test 2

Group: 1, 3

Verdict: RUNTIME ERROR

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
(empty)

Test 3

Group: 1, 3

Verdict: RUNTIME ERROR

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
(empty)

Test 4

Group: 1, 3

Verdict: RUNTIME ERROR

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
(empty)

Test 5

Group: 3

Verdict: RUNTIME ERROR

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
(empty)

Test 6

Group: 3

Verdict: RUNTIME ERROR

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
(empty)

Test 7

Group: 3

Verdict: RUNTIME ERROR

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
(empty)

Test 8

Group: 3

Verdict: RUNTIME ERROR

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
(empty)

Test 9

Group: 2, 3

Verdict: RUNTIME ERROR

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

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

user output
(empty)

Test 10

Group: 2, 3

Verdict: RUNTIME ERROR

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
(empty)

Test 11

Group: 2, 3

Verdict: RUNTIME ERROR

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
(empty)

Test 12

Group: 3

Verdict: RUNTIME ERROR

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
(empty)

Test 13

Group: 3

Verdict: RUNTIME ERROR

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
(empty)

Test 14

Group: 3

Verdict: RUNTIME ERROR

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: RUNTIME ERROR

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: RUNTIME ERROR

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
(empty)

NOI 2024

Anime Shops

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 ()