CSES - NOI 2024

CSES - NOI 2024 - Results

Submission details
Task:	Anime Shops
Sender:	Vladimir Osmekhin
Submission time:	2024-03-06 18:31:13 +0200
Language:	C++ (C++17)
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.21 s	3	details
#6	ACCEPTED	0.21 s	3	details
#7	ACCEPTED	0.21 s	3	details
#8	ACCEPTED	0.24 s	3	details
#9	ACCEPTED	0.10 s	2, 3	details
#10	ACCEPTED	0.10 s	2, 3	details
#11	ACCEPTED	0.14 s	2, 3	details
#12	ACCEPTED	0.10 s	3	details
#13	ACCEPTED	0.09 s	3	details
#14	ACCEPTED	0.10 s	3	details
#15	ACCEPTED	0.05 s	3	details
#16	ACCEPTED	0.10 s	3	details

Code

#include <bits/stdc++.h>
using namespace std;
#define forn(i,n) for(int i=0;i<n;++i)
#define N (int)(1e5+1)
#define ll long long
#define pb push_back
#define inf (int)(1.01e9)
#define F first
#define S second

int n,m,k,Z[N],mem[N],z[N];
bool ANIME[N];
vector<int> roads[N],anime;
pair<pair<int,int>, pair<int,int>> nz[N];

void haku1() {
    queue<tuple<int,int,int>> q;
    forn(i,k) q.push({0, anime[i], anime[i]});
    while (q.size()) {
        
        auto[c, p, x] = q.front(); q.pop();
        if (ANIME[p] && p!=x) {
            Z[p] = min(Z[p],(-c)); 
            Z[x] = min(Z[x],(-c));
            continue;
        }

        for (int i : roads[p]) {
            if (i==x) continue;
            auto[ek, tok] = nz[i];
            if (z[i]) {
                if (ek.S && ek.S!=x) {
                    Z[ek.S]=min(Z[ek.S], ek.F+(-c)+1);
                    Z[x]=min(Z[x], ek.F+(-c)+1);
                }
                else if (tok.S && tok.S!=x) {
                    Z[tok.S]=min(Z[tok.S], tok.F+(-c)+1);
                    Z[x]=min(Z[x], tok.F+(-c)+1); 
                }
                continue; 
            } 
            z[i]=1;
            if (!ek.S) ek = {(-c)+1,x};
            else if (ek.S==x) ek.F=min(ek.F,(-c)+1);
            else if (!tok.S) tok = {(-c)+1,x};
            else if (tok.S==x) tok.F=min(tok.F,(-c)+1);
            if (ek.F<tok.F) nz[i] = {ek, tok};
            else nz[i] = {tok,ek}; 
            Z[i] = min(Z[i],(-c)+1);
            q.push({c-1, i, x});
        }
    }
}

int main() {
    cin>>n>>m>>k;
    fill(Z, Z+n+1, inf);
    forn(i,k) {
        int a;
        cin>>a; 
        anime.pb(a);
        ANIME[a]=1;
    }
    forn(i,m) {
        int a,b;
        cin>>a>>b;
        roads[a].pb(b);
        roads[b].pb(a);
    }
    haku1();
    
    forn(i,n) cout<<(Z[i+1]==inf ? -1 : Z[i+1])<<' ';
    cout<<endl;
}

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