CSES - NOI 2024

CSES - NOI 2024 - Results

Submission details
Task:	Anime Shops
Sender:	David Strømme Eikeland
Submission time:	2024-03-06 16:52:37 +0200
Language:	C++ (C++17)
Status:	READY
Result:	23

Feedback
group	verdict	score
#1	ACCEPTED	23
#2	TIME LIMIT EXCEEDED	0
#3	TIME LIMIT EXCEEDED	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.07 s	1, 3	details
#5	ACCEPTED	0.21 s	3	details
#6	ACCEPTED	0.48 s	3	details
#7	TIME LIMIT EXCEEDED	--	3	details
#8	TIME LIMIT EXCEEDED	--	3	details
#9	ACCEPTED	0.10 s	2, 3	details
#10	ACCEPTED	0.19 s	2, 3	details
#11	TIME LIMIT EXCEEDED	--	2, 3	details
#12	ACCEPTED	0.10 s	3	details
#13	ACCEPTED	0.53 s	3	details
#14	TIME LIMIT EXCEEDED	--	3	details
#15	ACCEPTED	0.07 s	3	details
#16	ACCEPTED	0.10 s	3	details

Code

#include <iostream>
#include <vector>
#include <queue>
#define all(n) n.begin(),n.end()
#ifndef INT_MAX
#define INT_MAX 0x7fffffff
#endif

int main()
{
    int n,m,k;
    std::cin >> n >> m >> k;
    std::vector<int> store(k,0);
    for(auto&& i : store) std::cin >> i;
    for(auto&& i : store) i--;
    std::vector<std::vector<int>> neigh(n,std::vector<int>{});
    for(int i = 0; i < m; i++)
    {
        int a,b;
        std::cin >> a >> b;
        a--;
        b--;
        neigh[a].push_back(b);
        neigh[b].push_back(a);
    }
    std::vector<int> mindist(n,INT_MAX);
    //for(auto i : store) std::cerr << i; std::cerr << "\n";
    
    for(int num = 0; num < k; num++)
    {
        for(int par = 0; par <= 0; par++)
        {
            std::vector<int> q;
            // for(int i = 0; i < k; i++)
            // {
            //     if ((i ^ par) & bit) q.emplace_back(store[i]);
            // }
            q.emplace_back(store[num]);
            // bfs
            std::vector<bool> visit(n,0);
            int len = 0;
            while(q.size())
            {
                std::vector<int> p;
                for(auto node : q)
                {
                    if (visit[node]) continue;
                    visit[node] = true;
                    if (len > 0 && len < mindist[node]) mindist[node] = len;
                    for(auto n : neigh[node]) if(!visit[n]) p.push_back(n);
                }
                q = p;
                len++;
            }
        }
        //std::cout << bit << "\n";
    }
    for(auto&& i : mindist) if (i == INT_MAX) i = -1;
    for(auto i : mindist) std::cout << i << " ";
    std::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: TIME LIMIT EXCEEDED

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: TIME LIMIT EXCEEDED

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: 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: TIME LIMIT EXCEEDED

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: 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: TIME LIMIT EXCEEDED

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: 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 (David Strømme Eikeland)