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 13:14:00100
2016-05-12 13:13:220
2016-05-12 13:10:2967
2016-05-12 13:08:200
2016-05-12 12:52:240
2016-05-12 12:49:5967
Task:Bosses
Sender:ReaLNero
Submission time:2016-05-12 13:08:20
Language:C++
Status:READY
Score:0

Feedback

groupverdictscore
#1WRONG ANSWER0
#2WRONG ANSWER0
#3WRONG ANSWER0

Test results

testverdicttime (s)group
#1WRONG ANSWER0.06 / 1.501details
#2WRONG ANSWER0.06 / 1.501details
#3WRONG ANSWER0.05 / 1.501details
#4WRONG ANSWER0.06 / 1.501details
#5WRONG ANSWER0.05 / 1.501details
#6WRONG ANSWER0.05 / 1.501details
#7WRONG ANSWER0.04 / 1.502details
#8WRONG ANSWER0.05 / 1.502details
#9WRONG ANSWER0.05 / 1.502details
#10WRONG ANSWER0.06 / 1.502details
#11WRONG ANSWER0.06 / 1.502details
#12WRONG ANSWER0.06 / 1.503details
#13WRONG ANSWER0.06 / 1.503details
#14WRONG ANSWER0.20 / 1.503details
#15WRONG ANSWER0.09 / 1.503details
#16WRONG ANSWER0.56 / 1.503details
#17WRONG ANSWER0.79 / 1.503details
#18WRONG ANSWER0.78 / 1.503details

Compiler report

input/code.cpp: In function 'void find(int)':
input/code.cpp:15:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j = 0; j < adj[pos].size(); j++){
                                    ^
input/code.cpp: In function 'int main()':
input/code.cpp:57:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int j = 0; j < adj[fr].size(); j++){
                                    ^

Code

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

int v;
vector<int> adj[10005];
int level[10005];
int sum[10005], val[10005];

inline void find(int pos){
	if(val[pos] == -1){
		sum[pos] = 0;
		val[pos] = 1;

		for(int j = 0; j < adj[pos].size(); j++){
			if(val[adj[pos][j]] == -1 and level[adj[pos][j]] == level[pos] + 1){
				val[pos] += val[adj[pos][j]];
				sum[pos] += sum[adj[pos][j]];
			}
		}

		sum[pos] += val[pos];
	}
}
int main() {
	ios::sync_with_stdio(false);

	cin >> v;

	for(int i = 0; i < v; i++){
		int s;
		cin >> s;

		for(int j = 0; j < s; j++){
			int inp;
			cin >> inp;
			inp--;
			adj[inp].push_back(i);
		}
	}

	int best = v * v + 5;
	for(int i = 0; i < v; i++){
		for(int j = 0; j < v; j++){
			level[j] = -1;
			sum[j] = -1;
			val[j] = -1;
		}
		level[i] = 0;
		queue<int> q;
		q.push(i);

		while(!q.empty()){
			int fr = q.front();
			q.pop();

			for(int j = 0; j < adj[fr].size(); j++){
				int next = adj[fr][j];

				if(level[next] == -1){
					level[next] = level[fr] + 1;
					q.push(next);
				}
			}
		}

		int j;
		for(j = 0; j < v; j++){
			if(level[j] == -1){
				break;
			}
		}
		if(j == v){
			find(i);
			best = min(best, sum[i]);
		}
	}

	cout << best;
	return 0;
}

Test details

Test 1

Group: 1

Verdict: WRONG ANSWER

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

correct output
8

view   save

user output
-3

view   save

Test 2

Group: 1

Verdict: WRONG ANSWER

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
-7

view   save

Test 3

Group: 1

Verdict: WRONG ANSWER

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

correct output
22

view   save

user output
-7

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
-7

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
-9

view   save

Test 6

Group: 1

Verdict: WRONG ANSWER

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

correct output
26

view   save

user output
-7

view   save

Test 7

Group: 2

Verdict: WRONG ANSWER

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

correct output
527

view   save

user output
-5

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
-21

view   save

Test 9

Group: 2

Verdict: WRONG ANSWER

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
-21

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
-11

view   save

Test 11

Group: 2

Verdict: WRONG ANSWER

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

correct output
617

view   save

user output
-7

view   save

Test 12

Group: 3

Verdict: WRONG ANSWER

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

correct output
531

view   save

user output
-133

view   save

Test 13

Group: 3

Verdict: WRONG ANSWER

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

correct output
370

view   save

user output
-155

view   save

Test 14

Group: 3

Verdict: WRONG ANSWER

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

correct output
6256017

view   save

user output
-1

view   save

Test 15

Group: 3

Verdict: WRONG ANSWER

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

correct output
45193

view   save

user output
-7

view   save

Test 16

Group: 3

Verdict: WRONG ANSWER

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

correct output
27449

view   save

user output
-347

view   save

Test 17

Group: 3

Verdict: WRONG ANSWER

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

correct output
39850

view   save

user output
-327

view   save

Test 18

Group: 3

Verdict: WRONG ANSWER

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

correct output
40097

view   save

user output
-323

view   save