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 11:34:06100
2016-05-12 11:32:4967
2016-05-12 11:22:3767
2016-05-12 11:21:1867
2016-05-12 11:19:3667
2016-05-12 11:12:500
2016-05-12 11:05:5667
2016-05-12 11:03:5967
2016-05-12 11:03:1067
2016-05-12 11:00:010
Task:Bosses
Sender:nikalosa
Submission time:2016-05-12 11:34:06
Language:C++
Status:READY
Score:100

Feedback

groupverdictscore
#1ACCEPTED22
#2ACCEPTED45
#3ACCEPTED33

Test results

testverdicttime (s)group
#1ACCEPTED0.05 / 1.501details
#2ACCEPTED0.06 / 1.501details
#3ACCEPTED0.06 / 1.501details
#4ACCEPTED0.05 / 1.501details
#5ACCEPTED0.05 / 1.501details
#6ACCEPTED0.06 / 1.501details
#7ACCEPTED0.06 / 1.502details
#8ACCEPTED0.05 / 1.502details
#9ACCEPTED0.06 / 1.502details
#10ACCEPTED0.05 / 1.502details
#11ACCEPTED0.06 / 1.502details
#12ACCEPTED0.06 / 1.503details
#13ACCEPTED0.05 / 1.503details
#14ACCEPTED0.30 / 1.503details
#15ACCEPTED0.08 / 1.503details
#16ACCEPTED0.76 / 1.503details
#17ACCEPTED1.48 / 1.503details
#18ACCEPTED1.49 / 1.503details

Compiler report

input/code.cpp:41:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^
input/code.cpp: In function 'int main()':
input/code.cpp:42:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
                   ^
input/code.cpp:45:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
       scanf("%d",&k);
                     ^
input/code.cpp:48:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
      scanf("%d",&m);
                    ^

Code

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define MAX(a,b) (a>b?a:b)
#define MIN(a,b) (a<b?a:b)
#define UP upper_bound
#define LB lower_bound
#define LL long long 
#define Pi 3.14159265358
#define si size()
#define en end()
#define be begin()
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define ii set<int>::iterator
#define raod order_of_key
#define mexe find_by_order
#define Tree int ind, int L, int R
#define Left 2*ind,L,(L+R)/2
#define Right 2*ind+1,(L+R)/2+1,R
#define TOSNU tree_order_statistics_node_update
#define SET tree < int , null_type , less < int > , rb_tree_tag , TOSNU  >
using namespace std;
using namespace __gnu_pbds;
queue < int > q;
int f[5001];
int n, m, k, i, j, a, ans=12312313, cur, res;
int v[5001][5001];
int g[5001][5001];
int ind[5001];
int ind1[5001];
int dfs(int v, int p)
{
	int cur=0;
	for(int j=0;j<ind1[v];j++)
	  cur+=dfs(g[v][j],v)+1;
	res+=cur+1;    
    return cur;		 
}
main(){
	   scanf("%d",&n);
	   for(i=1;i<=n;i++)
	    {
	     scanf("%d",&k);
	     for(j=1;j<=k;j++)
		  {
		   scanf("%d",&m);
		   v[m][ind[m]++]=i;	
		  }
		}
	   for(i=1;i<=n;i++)
	    {
	     for(j=1;j<=n;j++)ind1[j]=0;
	     q.push(i);	
	     f[i]=i; cur=1;
	     while(q.si)
	      {
		   a=q.front();
	       q.pop();
		   for(j=0;j<ind[a];j++)
		     if(f[v[a][j]]!=i)
			  {
			   f[v[a][j]]=i; cur++;
			   q.push(v[a][j]);
			   g[a][ind1[a]++]=v[a][j];	
			  }	
		  }
		 if(cur==n)
		  {
		   res=0;
		   dfs(i,0);
		   ans=MIN(res,ans);
		  }
		} 
		printf("%d",ans);		
       }

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

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
24

view   save

Test 5

Group: 1

Verdict: ACCEPTED

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

correct output
23

view   save

user output
23

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

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
156

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

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

correct output
428

view   save

user output
428

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

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

correct output
39850

view   save

user output
39850

view   save

Test 18

Group: 3

Verdict: ACCEPTED

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

correct output
40097

view   save

user output
40097

view   save