CSES - NOI 2024

CSES - NOI 2024 - Results

Submission details
Task:	Anime Shops
Sender:	Sofie Fu
Submission time:	2024-03-06 18:06:02 +0200
Language:	C++ (C++11)
Status:	READY
Result:	100

Feedback
group	verdict	score
#1	ACCEPTED	23
#2	ACCEPTED	16
#3	ACCEPTED	61

Test results
test	verdict	time	group
#1	ACCEPTED	0.01 s	1, 3	details
#2	ACCEPTED	0.01 s	1, 3	details
#3	ACCEPTED	0.01 s	1, 3	details
#4	ACCEPTED	0.01 s	1, 3	details
#5	ACCEPTED	0.12 s	3	details
#6	ACCEPTED	0.12 s	3	details
#7	ACCEPTED	0.12 s	3	details
#8	ACCEPTED	0.15 s	3	details
#9	ACCEPTED	0.04 s	2, 3	details
#10	ACCEPTED	0.05 s	2, 3	details
#11	ACCEPTED	0.07 s	2, 3	details
#12	ACCEPTED	0.04 s	3	details
#13	ACCEPTED	0.04 s	3	details
#14	ACCEPTED	0.05 s	3	details
#15	ACCEPTED	0.03 s	3	details
#16	ACCEPTED	0.04 s	3	details

Code

#include <bits/stdc++.h>
using namespace std;
 
#define int long long
#define vo vector
#define pb push_back
#define sz(x) x.size()
#define fi first 
#define se second
 
typedef long long ll;
typedef pair<int ,int> pii;
typedef vo<int> vi;
 
#define rep(i, a, b) for(ll i=(a); i<(b); i++)
#define pr(x) cerr << #x << " " << x << endl;
 
ll const inf = 1e9; 
ll const mxn = 1e5+4;
int n, m, k, anime[mxn], vis[mxn];
vo<vi> adj(mxn);
// vi dist(mxn, inf);
 
int bfs(int source){
    queue<int> qu; qu.push(source);
    vi dist(n, inf); dist[source] = 0;
 
    while(sz(qu)){
        int v = qu.front(); qu.pop();
 
        for(auto x: adj[v]){
            if(dist[x] == inf){
                dist[x] = dist[v] + 1;
                if(anime[x]) return dist[x];
                qu.push(x);
            }
        }
 
    }
    return -1;
}
 
signed main(){
    cin.tie(0)->sync_with_stdio(0);
    cin>>n>>m>>k;
    vi dist(n, inf), par(n, -1);
    queue<array<int, 3>> qu; // node, source animenode, dist
 
    rep(i, 0, k){
        int a; cin>>a;a--;
        anime[a] = 1;
        qu.push({a, a, 0});
    }
    rep(i, 0, m){
        int a, b; cin>>a>>b; a--, b--;
        adj[a].pb(b); adj[b].pb(a);
    }
 
    // rep(i, 0, n){
    //     int tmp = bfs(i);
    //     cout << tmp << " ";
    // }
    while(sz(qu)){
        array<int, 3> v = qu.front(); qu.pop();
        int d = v[2], p = v[1];
        // pr(v[0])
 
        for(auto x: adj[v[0]]){
            if(x == p) continue;
            // pr(x)
            if(dist[x] == inf){
 
                dist[x] = d+1;
                par[x] = p;
                qu.push({x, p, dist[x]});
            }
            else if(anime[x]){
                dist[p] = min(dist[p], d+1);
                dist[x] = min(dist[x], d+1);
            }
            else{
 
                if(par[x] != p){
                    if(par[x] == -1) continue;
                    // pr(par[x])
                    // pr(p)
 
                    // pr(dist[p])
                    dist[p] = min(dist[p], d+1 + dist[x]);
                    dist[par[x]] = min(dist[par[x]], d+1+dist[x]);
                    // pr(dist[p])
                }
            }
        }
    }
 
    rep(i, 0, n){
        if(dist[i] == inf) cout << -1 << " ";
        else cout << dist[i] << " ";
    }
}
 
/*
5 6 2
1 2
1 2
2 3 
3 4
4 5
5 1
5 2
 
5 6 3
2 3 5 
1 3
3 4
2 4
3 5
4 5
1 4
 
4 6 3
2 4 1 
1 2
2 3
3 4
1 3
2 4
1 4
 
 
    while(sz(qu)){
        int v = qu.front(); qu.pop();
 
        for(auto x: adj[v]){
            if(dist[x] == inf){
                dist[x] = dist[v]+1;
                
            }
        }
 
    }
*/

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

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

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

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

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

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

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

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
`50000 1 2 3 4 5 6 7 8 9 10 11 ...` 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 (Sofie Fu)