CSES - NOI 2024

CSES - NOI 2024 - Results

Submission details
Task:	Anime Shops
Sender:	Anastasiia Saranchina
Submission time:	2024-03-06 15:38:23 +0200
Language:	C++ (C++17)
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	WRONG ANSWER	0.00 s	1, 3	details
#2	ACCEPTED	0.00 s	1, 3	details
#3	ACCEPTED	0.00 s	1, 3	details
#4	ACCEPTED	0.01 s	1, 3	details
#5	WRONG ANSWER	0.13 s	3	details
#6	WRONG ANSWER	0.13 s	3	details
#7	WRONG ANSWER	0.13 s	3	details
#8	ACCEPTED	0.13 s	3	details
#9	WRONG ANSWER	0.05 s	2, 3	details
#10	WRONG ANSWER	0.05 s	2, 3	details
#11	ACCEPTED	0.06 s	2, 3	details
#12	WRONG ANSWER	0.05 s	3	details
#13	WRONG ANSWER	0.05 s	3	details
#14	WRONG ANSWER	0.05 s	3	details
#15	ACCEPTED	0.02 s	3	details
#16	WRONG ANSWER	0.05 s	3	details

Code

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fi first
#define se second
typedef long double ld;
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
const ll inf = 1e9 + 7;
const ld eps = 1e-8;



signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll n, m, k;
    cin >> n >> m >> k;
    vector<pair<ll, ll>> vert(m);
    vector<bool> good(n);
    for (ll i = 0; i < k; i++) {
        ll x;
        cin >> x;
        good[x - 1] = 1;
    }
    vector<vector<ll>> g(n);
    for (ll i = 0; i < m; i++) {
        ll v, u;
        cin >> v >> u;
        vert[i] = {v - 1, u - 1};
        g[v - 1].push_back(u - 1);
        g[u - 1].push_back(v - 1);
    }
    vector<pair<ll, ll>> par(n, {-1, -1});
    deque<ll> q;
    vector<ll>dist(n, inf);
    for (ll i = 0; i < n; i++) {
        for (auto u : g[i]) {
            if (good[u]) {
                if (dist[i] == 1)
                    par[i].se = i;
                else {
                    dist[i] = 1;
                    par[i].fi  = u;
                    q.push_back(i);
                }
            }
        }
    }
    while (!q.empty()) {
        auto v = q.front();
        q.pop_front();
        for (auto u : g[v]) {
            if (u == par[v].fi && par[v].se == -1) {
                continue;
            }
            if (dist[u] == dist[v] + 1) {
                par[u].se = v;
            } else if (dist[u] > dist[v] + 1) {
                par[u].fi = v;
                dist[u] = dist[v] + 1;
                q.push_back(u);
            }
        }
    }
    for (auto [v, u] : vert) {
        if (par[v].fi == -1 || par[u].fi == -1)
            continue;
        if (par[v].fi != par[u].fi) {
            //cout << v << ' ' << dist[u] << ' ' << 1 << endl;
            dist[par[v].fi] = min(dist[par[v].fi], dist[u] + 1 + dist[v]);
            dist[par[u].fi] = min(dist[par[u].fi], dist[u] + 1 + dist[v]);
        } else if (par[v].fi != par[u].se && par[u].se != -1) {
           // cout << par[v].fi << ' ' << par[u].se << endl;
            dist[par[v].fi] = min(dist[par[v].fi], dist[u] + 1 + dist[v]);
            dist[par[u].se] = min(dist[par[u].se], dist[u] + 1 + dist[v]);
        } else if (par[v].se != par[u].fi && par[v].se != -1) {
            //cout << par[v].se << ' ' << par[u].fi << endl;
            dist[par[v].se] = min(dist[par[v].se], dist[u] + 1 + dist[v]);
            dist[par[u].fi] = min(dist[par[u].fi], dist[u] + 1 + dist[v]);
        }

    }
    for (ll i = 0; i < n; i++) {
        if (dist[i] == inf)
            cout << -1 << ' ';
        else
            cout << dist[i] << ' ';
    }
    cout << '\n';
}

Test details

Test 1

Group: 1, 3

Verdict: WRONG ANSWER

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: ACCEPTED

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: ACCEPTED

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: WRONG ANSWER

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: WRONG ANSWER

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: WRONG ANSWER

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
`3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 ...` Truncated

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
`4 1 2 3 4 5 6 7 8 9 10 11 12 1...` Truncated

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