Code Submission Evaluation System Login

BOI 2016, day 1

Start:2016-05-12 09:00:00
End:2016-05-12 14:00:00
 

Tasks | Scoreboard | Statistics


CSES - BOI 2016, day 1 - Results
History
2016-05-12 18:41:17100
2016-05-12 18:30:1967
2016-05-12 18:29:4167
2016-05-12 10:04:500
Task:Bosses
Sender:adp0
Submission time:2016-05-12 10:04:50
Language:C++
Status:READY
Score:0

Feedback

groupverdictscore
#1WRONG ANSWER0
#2WRONG ANSWER0
#3TIME LIMIT EXCEEDED0

Test results

testverdicttime (s)group
#1ACCEPTED0.06 / 1.501details
#2ACCEPTED0.05 / 1.501details
#3ACCEPTED0.06 / 1.501details
#4WRONG ANSWER0.05 / 1.501details
#5WRONG ANSWER0.06 / 1.501details
#6ACCEPTED0.05 / 1.501details
#7ACCEPTED0.06 / 1.502details
#8WRONG ANSWER0.05 / 1.502details
#9ACCEPTED0.05 / 1.502details
#10WRONG ANSWER0.06 / 1.502details
#11ACCEPTED0.06 / 1.502details
#12ACCEPTED0.04 / 1.503details
#13ACCEPTED0.05 / 1.503details
#14ACCEPTED0.05 / 1.503details
#15ACCEPTED0.05 / 1.503details
#16ACCEPTED0.06 / 1.503details
#17TIME LIMIT EXCEEDED-- / 1.503details
#18TIME LIMIT EXCEEDED-- / 1.503details

Compiler report

input/code.cpp: In function 'int dfs(int)':
input/code.cpp:16:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < tree[a].size(); i++)
                                     ^
input/code.cpp: In function 'int slove(int)':
input/code.cpp:40:38: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i = 0; i < k[a].size(); i++)
                                      ^

Code

#include <iostream>
#include <vector>
#include <queue>
using namespace std;

const int maxn = 5004;
int n;
vector<int> k[maxn];


vector<int> tree[maxn];
int sum;
int dfs(int a)
{
    int l = 1;
    for(int i = 0; i < tree[a].size(); i++)
        l += dfs(tree[a][i]);
    sum += l;
    return l;
}




int slove(int boss)
{
    queue<int> q;
    q.push(boss);

    for(int i = 0; i < n; i++)
        tree[i].clear();
    bool seen[maxn];
    for(int i = 0; i < n; i++)
        seen[i] = false;
    seen[boss] = true;
    while(!q.empty())
    {
        int a = q.front();
        q.pop();
        for(int i = 0; i < k[a].size(); i++)
        {
            if(!seen[k[a][i]])
            {
                seen[k[a][i]] = true;
                tree[a].push_back(k[a][i]);
                q.push(k[a][i]);
            }
        }
    }
    sum = 0;
    dfs(boss);
    return sum;
}




int main()
{
    cin >> n;
    int boss = -1;
    for(int i = 0; i < n; i++)
    {
        int a;
        cin >> a;
        if(a == 0)
            boss = i;
        else
        {
            for(int j = 0; j < a; j++)
            {
                int b;
                cin >> b;
                k[b-1].push_back(i);
            }
        }
    }


    if(boss == -1)
    {
        int best = 1000000000;

        for(int i = 0; i < n; i++)
        {
            best = min(best, slove(i));
        }
        cout << best;
    }
    else cout << slove(boss);
}


Test details

Test 1

Group: 1

Verdict: ACCEPTED

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

correct output
8

view   save

user output
8

view   save

Test 2

Group: 1

Verdict: ACCEPTED

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

correct output
12

view   save

user output
12

view   save

Test 3

Group: 1

Verdict: ACCEPTED

input
9
2 6 3
2 8 4
0
4 8 3 6 9
...
view   save

correct output
22

view   save

user output
22

view   save

Test 4

Group: 1

Verdict: WRONG ANSWER

input
10
3 3 2 8
3 6 7 3
4 6 10 7 9
1 10
...
view   save

correct output
24

view   save

user output
1

view   save

Test 5

Group: 1

Verdict: WRONG ANSWER

input
10
3 4 8 10
1 10
1 5
3 6 8 5
...
view   save

correct output
23

view   save

user output
1

view   save

Test 6

Group: 1

Verdict: ACCEPTED

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

correct output
26

view   save

user output
26

view   save

Test 7

Group: 2

Verdict: ACCEPTED

input
100
2 78 92
1 15
1 57
1 45
...
view   save

correct output
527

view   save

user output
527

view   save

Test 8

Group: 2

Verdict: WRONG ANSWER

input
50
6 16 31 50 6 4 8
7 7 16 27 22 15 30 14
5 20 22 42 33 37
3 18 45 9
...
view   save

correct output
156

view   save

user output
1

view   save

Test 9

Group: 2

Verdict: ACCEPTED

input
30
5 12 26 25 18 24
8 6 13 5 7 10 22 20 29
6 16 14 9 27 5 20
3 19 17 11
...
view   save

correct output
77

view   save

user output
77

view   save

Test 10

Group: 2

Verdict: WRONG ANSWER

input
100
2 2 77
3 99 94 85
2 47 29
2 33 74
...
view   save

correct output
428

view   save

user output
1

view   save

Test 11

Group: 2

Verdict: ACCEPTED

input
100
3 50 11 85
2 84 69
2 41 39
2 43 82
...
view   save

correct output
617

view   save

user output
617

view   save

Test 12

Group: 3

Verdict: ACCEPTED

input
200
46 154 36 47 187 86 48 66 124 ...
view   save

correct output
531

view   save

user output
531

view   save

Test 13

Group: 3

Verdict: ACCEPTED

input
150
60 32 101 42 139 95 36 81 83 1...
view   save

correct output
370

view   save

user output
370

view   save

Test 14

Group: 3

Verdict: ACCEPTED

input
5000
1 3355
1 2176
1 3754
1 950
...
view   save

correct output
6256017

view   save

user output
6256017

view   save

Test 15

Group: 3

Verdict: ACCEPTED

input
5000
1 848
1 418
1 3390
1 2840
...
view   save

correct output
45193

view   save

user output
45193

view   save

Test 16

Group: 3

Verdict: ACCEPTED

input
5000
2 4629 753
1 345
3 3573 1802 449
1 3051
...
view   save

correct output
27449

view   save

user output
27449

view   save

Test 17

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
5000
2 2282 1819
2 2987 3194
2 3472 4256
2 3226 3684
...
view   save

correct output
39850

view   save

user output
(empty)

Test 18

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
5000
2 1912 3423
2 419 4226
2 1627 4693
2 4760 1391
...
view   save

correct output
40097

view   save

user output
(empty)