CSES - NOI 2024

CSES - NOI 2024 - Results

Submission details
Task:	Anime Shops
Sender:	Antero Nyberg
Submission time:	2024-03-06 16:05:01 +0200
Language:	C++ (C++20)
Status:	READY
Result:	39

Feedback
group	verdict	score
#1	ACCEPTED	23
#2	ACCEPTED	16
#3	WRONG ANSWER	0

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.08 s	1, 3	details
#5	ACCEPTED	0.11 s	3	details
#6	ACCEPTED	0.12 s	3	details
#7	WRONG ANSWER	0.11 s	3	details
#8	ACCEPTED	0.13 s	3	details
#9	ACCEPTED	0.05 s	2, 3	details
#10	ACCEPTED	0.05 s	2, 3	details
#11	ACCEPTED	0.07 s	2, 3	details
#12	ACCEPTED	0.05 s	3	details
#13	ACCEPTED	0.05 s	3	details
#14	ACCEPTED	0.05 s	3	details
#15	ACCEPTED	0.02 s	3	details
#16	ACCEPTED	0.05 s	3	details

Code

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define N 112345
#define F first
#define S second

int n,m,k,A[N],a,b,z[N],d[N];
vector<int> v[N],Av;

int main(){
	cin.tie(0)->sync_with_stdio(0);
	cin>>n>>m>>k;
	for(int i=0;i<k;++i){
		cin>>a;
		A[a]=1;
		Av.push_back(a);
	}
	for(int i=0;i<m;++i){
		cin>>a>>b;
		v[a].push_back(b);
		v[b].push_back(a);
	}
	if(n<=1000){
		sort(Av.begin(),Av.end());
		for(int e:Av){
			queue<pair<int,int>> q;
			q.push({e,0});
			while(q.size()){
				auto p=q.front(); q.pop();
				int s=p.F;
				int D=p.S;
				if(z[s]==e) continue;
				z[s]=e;
				if(!d[s]) d[s]=D;
				else if(D!=0) d[s]=min(d[s],D);
				for(int u:v[s]){
					if(z[u]==e) continue;
					q.push({u,D+1});
				}
			}
		}
	} else {
	queue<pair<pair<int,int>,int>> q;
	for(int e:Av){
		q.push({{e,e},0});
	}
	while(q.size()){
		auto p=q.front(); q.pop();
		int s=p.F.F;
		int e=p.F.S;
		int D=p.S;
		if(z[s]){
			if(z[s]!=e){
				if(A[s]){
					if(!d[e]) d[e]=D;
					if(!d[z[s]]) d[z[s]]=D;
				} else {
					if(!d[e]) d[e]=D+d[s];
					if(!d[z[s]]) d[z[s]]=D+d[s];
				}
			}
			continue;
		}
		z[s]=e;
		d[s]=D;
		for(int u:v[s]){
			if(z[u]){
				if(z[u]!=e){
					if(A[u]){
						if(!d[e]) d[e]=D+1;
						if(!d[z[u]]) d[z[u]]=D+1;
					} else {
						if(!d[e]) d[e]=D+d[u]+1;
						if(!d[z[u]]) d[z[u]]=D+d[u]+1;
					}
				}
				continue;
			}
			q.push({{u,e},D+1});
		}
	}
	}
	for(int s=1;s<=n;++s){
		if(d[s]) cout<<d[s]<<' ';
		else cout<<"-1 ";
	}

	cout<<'\n';
}

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: 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: 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 (Antero Nyberg)