CSES - NOI 2019

CSES - NOI 2019 - Results

Submission details
Task:	Distance Code
Sender:	Ásþór Björnsson
Submission time:	2019-03-06 13:03:05 +0200
Language:	C++
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.01 s	1, 2, 3	details
#2	WRONG ANSWER	0.03 s	1, 2, 3	details
#3	WRONG ANSWER	0.02 s	1, 2, 3	details
#4	WRONG ANSWER	0.03 s	1, 2, 3	details
#5	WRONG ANSWER	0.03 s	1, 2, 3	details
#6	WRONG ANSWER	0.03 s	1, 2, 3	details
#7	WRONG ANSWER	0.02 s	1, 2, 3	details
#8	WRONG ANSWER	0.01 s	1, 2, 3	details
#9	WRONG ANSWER	0.02 s	1, 2, 3	details
#10	WRONG ANSWER	0.02 s	1, 2, 3	details
#11	WRONG ANSWER	0.02 s	1, 2, 3	details
#12	WRONG ANSWER	0.04 s	2, 3	details
#13	WRONG ANSWER	0.04 s	2, 3	details
#14	WRONG ANSWER	0.05 s	2, 3	details
#15	WRONG ANSWER	0.04 s	2, 3	details
#16	TIME LIMIT EXCEEDED	--	3	details
#17	TIME LIMIT EXCEEDED	--	3	details
#18	TIME LIMIT EXCEEDED	--	3	details
#19	TIME LIMIT EXCEEDED	--	3	details
#20	WRONG ANSWER	0.02 s	1, 2, 3	details

Compiler report

input/code.cpp: In function 'void bfs(int)':
input/code.cpp:17:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i = 0; i < edg[cur].size(); i++){
                        ~~^~~~~~~~~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:46:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for(int x = 0; x < taken.size(); x++){
                                ~~^~~~~~~~~~~~~~

Code

#include<bits/stdc++.h>
using namespace std;

vector<int> edg[100050];
bool vis[100050];
int dist[100050];

void bfs(int start){
    memset(vis, 0, sizeof(vis));
    memset(dist, -1, sizeof(dist));
    queue<int> q;
    q.push(start);
    dist[start] = true;
    while(!q.empty()){
        int cur = q.front();
        q.pop();
        for(int i = 0; i < edg[cur].size(); i++){
            int nxt = edg[cur][i];
            if(!vis[nxt]){
                vis[nxt] = true;
                dist[nxt] = dist[cur]+1;
                q.push(nxt);
            }
        }
    }
}

int main() {
    int n, k;
    cin >> k >> n;
    vector<int> taken;
    for(int i = 0; i < n-1; i++){
        int x, y;
        cin >> x >> y;
        edg[x].push_back(y);
        edg[y].push_back(x);
    }
    int nodes = n;
    int curr = 1;
    bfs(1);
    while(nodes > 0){
        int best = 2;
        for(int i = 1; i < 10; i++){
            if(dist[i] > dist[best] && i != curr){
                bool add = true;
                for(int x = 0; x < taken.size(); x++){
                    if(i == taken[x]) add = false;
                }
                if(add) best = i;
            }
        }
        cout << best << ' ';
        taken.push_back(best);
        bfs(best);
        curr = best;
        nodes--;
    }
    return 0;
}

Test details

Test 1

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`1 2 2 1` view save

correct output
(empty)

user output
`2 2` view save

Test 2

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`1 3 3 1 2 1` view save

correct output
(empty)

user output
`2 2 2` view save

Test 3

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`1 4 3 2 2 1 4 1` view save

correct output
(empty)

user output
`3 4 2 2` view save

Test 4

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`1 4 2 3 3 4 1 3` view save

correct output
(empty)

user output
`2 2 2 2` view save

Test 5

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`1 5 3 5 4 1 1 3 ...` view save

correct output
(empty)

user output
`2 5 2 3 2` view save

Test 6

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`1 5 3 2 3 4 5 1 ...` view save

correct output
(empty)

user output
`2 5 2 2 2` view save

Test 7

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`1 5 4 3 1 4 4 2 ...` view save

correct output
(empty)

user output
`2 2 2 2 2` view save

Test 8

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`1 10 9 3 8 9 2 9 ...` view save

correct output
(empty)

user output
`2 2 2 2 2 2 2 2 2 2` view save

Test 9

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`1 10 9 2 5 8 7 1 ...` view save

correct output
(empty)

user output
`4 5 3 8 2 6 2 1 2 2` view save

Test 10

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`1 10 10 4 9 1 4 7 ...` view save

correct output
(empty)

user output
`5 3 2 8 2 9 2 1 2 4` view save

Test 11

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`1 10 2 6 4 3 3 5 ...` view save

correct output
(empty)

user output
`4 6 3 9 5 2 7 2 2 2` view save

Test 12

Group: 2, 3

Verdict: WRONG ANSWER

input
`1 500 10 6 6 255 6 428 ...` view save

correct output
(empty)

user output
`2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...` view save

Test 13

Group: 2, 3

Verdict: WRONG ANSWER

input
`1 500 152 466 451 313 158 479 ...` view save

correct output
(empty)

user output
`5 3 8 1 6 2 4 2 7 2 9 2 2 2 2 ...` view save

Test 14

Group: 2, 3

Verdict: WRONG ANSWER

input
`1 500 109 440 330 190 443 161 ...` view save

correct output
(empty)

user output
`9 1 2 8 2 6 2 3 2 7 2 5 2 4 2 ...` view save

Test 15

Group: 2, 3

Verdict: WRONG ANSWER

input
`1 500 144 373 257 233 341 318 ...` view save

correct output
(empty)

user output
`6 1 8 3 4 2 5 2 7 2 9 2 2 2 2 ...` view save

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`1 100000 54983 75172 93807 75172 44082 75172 ...` view save

correct output
(empty)

user output
(empty)

Test 17

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`1 100000 88863 19059 86423 76688 98536 95984 ...` view save

correct output
(empty)

user output
(empty)

Test 18

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`1 100000 59979 6389 19097 24999 27846 82330 ...` view save

correct output
(empty)

user output
(empty)

Test 19

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`1 100000 58761 66001 25102 51081 98625 67861 ...` view save

correct output
(empty)

user output
(empty)

Test 20

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`1 6 2 1 3 2 4 2 ...` view save

correct output
(empty)

user output
`3 1 2 2 2 2` view save

NOI 2019

Distance Code

Compiler report

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

Test 17

Test 18

Test 19

Test 20

Tasks

Submissions (Ásþór Björnsson)