oj.uz

Submission #316012

# Submission time Handle Problem Language Result Execution time Memory
316012 2020-10-24T20:21:51 Z gurkot Connecting Supertrees (IOI20_supertrees) C++14
100 / 100
 262 ms 22264 KB 
#include <iostream>
#include "supertrees.h"
#include <vector>
using namespace std;
int tree[1501],comp[1501],mas[1501],mas1[1501],mas2[1501];
int n,ntree,ncomp;

int construct(std::vector<std::vector<int>> p) {
	n = p.size();
	std::vector<std::vector<int>> answer;
	for (int i = 0; i < n; i++) {
		std::vector<int> row;
		row.resize(n);
		answer.push_back(row);
	}
	
	// check con
	int cnt=0;
	for(int i=0;i<n;i++)	
        if(comp[i]==0){		
        comp[i]=++cnt;
        for(int j=0; j<n; j++) if(p[i][j]>0) comp[j] = comp[i];
    }
    /// components
    for(int i=0;i<n;i++) 
	 for(int j=0;j<n;j++)         
	   if((comp[i]==comp[j])^(p[i][j]>0)) return 0;
	
	//cout<<"ok1: let find trees"<<endl;
	for (int i=0; i<n;i++)	 
	 if (tree[i]==0){	  
	 ++ntree;
	 for (int j=0;j<n;j++) {
	  if(p[i][j] == 3) return 0;
	  	  
	  if (i!=j && p[i][j]==1){
	   if (tree[j]>0) return 0;
	   tree[j]=ntree;	 
	   answer[i][j]=answer[j][i]=1;
      }	
     }//J
	}//i
	
	
	//cout<<"ok2: let find connected components"<<endl;
	for (int i=0; i<n;i++)	 comp[i]=0;
	for (int i=0; i<n;i++)	 
	 if (comp[i]==0){	  	  
	  ncomp++;	  
	  int s=i,a=i,k=1,cnt=0;  
	  for (int j=0;j<n;j++)
	   if (i!=j && p[i][j]>0){	   	
	    mas[++cnt]=j; 
	    for (int ic=1;ic<cnt;ic++)
	     if (p[mas[ic]] [j]==0 || p[j] [mas[ic]]==0) return 0;
	     
	   	if (comp[j]>0) return 0;
	    comp[j]=ncomp;
	    if (tree[j]==0) {
	      mas2[++k]=j;
	      for (int ic=2;ic<k;ic++)
	      if (p[mas2[ic]] [j]<2 || p[j] [mas2[ic]]<2) return 0;
		  answer[a][j]=answer[j][a]=1;	      
	      a=j;
		}
	   }//j
	   if (k==2) return 0;
	   if (k>2) answer[a][s]=answer[s][a]=1;   
	   
	   
	 }//i
	
	
	build(answer);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:51:4: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   51 |    for (int j=0;j<n;j++)
      |    ^~~
supertrees.cpp:67:5: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   67 |     if (k==2) return 0;
      |     ^~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 10 ms 1280 KB Output is correct
7 Correct 240 ms 22136 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 10 ms 1280 KB Output is correct
7 Correct 240 ms 22136 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 13 ms 1280 KB Output is correct
13 Correct 237 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 107 ms 12152 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 59 ms 5880 KB Output is correct
21 Correct 235 ms 22136 KB Output is correct
22 Correct 239 ms 22136 KB Output is correct
23 Correct 247 ms 22264 KB Output is correct
24 Correct 237 ms 22152 KB Output is correct
25 Correct 96 ms 12152 KB Output is correct
26 Correct 95 ms 12152 KB Output is correct
27 Correct 245 ms 22264 KB Output is correct
28 Correct 241 ms 22264 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 10 ms 1280 KB Output is correct
9 Correct 238 ms 22136 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 10 ms 1280 KB Output is correct
13 Correct 248 ms 22140 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 106 ms 12152 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 60 ms 5756 KB Output is correct
22 Correct 246 ms 22136 KB Output is correct
23 Correct 239 ms 22136 KB Output is correct
24 Correct 262 ms 22264 KB Output is correct
25 Correct 101 ms 12152 KB Output is correct
26 Correct 96 ms 12152 KB Output is correct
27 Correct 255 ms 22100 KB Output is correct
28 Correct 259 ms 22100 KB Output is correct
29 Correct 102 ms 12120 KB Output is correct

Subtask #4
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 59 ms 5880 KB Output is correct
5 Correct 236 ms 22136 KB Output is correct
6 Correct 237 ms 22084 KB Output is correct
7 Correct 242 ms 22104 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 60 ms 5880 KB Output is correct
10 Correct 242 ms 22136 KB Output is correct
11 Correct 236 ms 22168 KB Output is correct
12 Correct 261 ms 22136 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 61 ms 5880 KB Output is correct
17 Correct 238 ms 22264 KB Output is correct
18 Correct 241 ms 22136 KB Output is correct
19 Correct 239 ms 22160 KB Output is correct
20 Correct 254 ms 22136 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 10 ms 1280 KB Output is correct
7 Correct 240 ms 22136 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 13 ms 1280 KB Output is correct
13 Correct 237 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 107 ms 12152 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 59 ms 5880 KB Output is correct
21 Correct 235 ms 22136 KB Output is correct
22 Correct 239 ms 22136 KB Output is correct
23 Correct 247 ms 22264 KB Output is correct
24 Correct 237 ms 22152 KB Output is correct
25 Correct 96 ms 12152 KB Output is correct
26 Correct 95 ms 12152 KB Output is correct
27 Correct 245 ms 22264 KB Output is correct
28 Correct 241 ms 22264 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 238 ms 22136 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 10 ms 1280 KB Output is correct
41 Correct 248 ms 22140 KB Output is correct
42 Correct 1 ms 256 KB Output is correct
43 Correct 1 ms 256 KB Output is correct
44 Correct 5 ms 768 KB Output is correct
45 Correct 106 ms 12152 KB Output is correct
46 Correct 1 ms 256 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 0 ms 256 KB Output is correct
49 Correct 60 ms 5756 KB Output is correct
50 Correct 246 ms 22136 KB Output is correct
51 Correct 239 ms 22136 KB Output is correct
52 Correct 262 ms 22264 KB Output is correct
53 Correct 101 ms 12152 KB Output is correct
54 Correct 96 ms 12152 KB Output is correct
55 Correct 255 ms 22100 KB Output is correct
56 Correct 259 ms 22100 KB Output is correct
57 Correct 102 ms 12120 KB Output is correct
58 Correct 1 ms 256 KB Output is correct
59 Correct 1 ms 256 KB Output is correct
60 Correct 5 ms 768 KB Output is correct
61 Correct 104 ms 12124 KB Output is correct
62 Correct 1 ms 256 KB Output is correct
63 Correct 1 ms 256 KB Output is correct
64 Correct 1 ms 384 KB Output is correct
65 Correct 64 ms 5880 KB Output is correct
66 Correct 99 ms 12152 KB Output is correct
67 Correct 110 ms 12152 KB Output is correct
68 Correct 95 ms 12152 KB Output is correct
69 Correct 102 ms 12408 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 10 ms 1280 KB Output is correct
7 Correct 240 ms 22136 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 13 ms 1280 KB Output is correct
13 Correct 237 ms 22136 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 1 ms 256 KB Output is correct
16 Correct 5 ms 768 KB Output is correct
17 Correct 107 ms 12152 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 59 ms 5880 KB Output is correct
21 Correct 235 ms 22136 KB Output is correct
22 Correct 239 ms 22136 KB Output is correct
23 Correct 247 ms 22264 KB Output is correct
24 Correct 237 ms 22152 KB Output is correct
25 Correct 96 ms 12152 KB Output is correct
26 Correct 95 ms 12152 KB Output is correct
27 Correct 245 ms 22264 KB Output is correct
28 Correct 241 ms 22264 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 1 ms 256 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 10 ms 1280 KB Output is correct
37 Correct 238 ms 22136 KB Output is correct
38 Correct 1 ms 256 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 10 ms 1280 KB Output is correct
41 Correct 248 ms 22140 KB Output is correct
42 Correct 1 ms 256 KB Output is correct
43 Correct 1 ms 256 KB Output is correct
44 Correct 5 ms 768 KB Output is correct
45 Correct 106 ms 12152 KB Output is correct
46 Correct 1 ms 256 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 0 ms 256 KB Output is correct
49 Correct 60 ms 5756 KB Output is correct
50 Correct 246 ms 22136 KB Output is correct
51 Correct 239 ms 22136 KB Output is correct
52 Correct 262 ms 22264 KB Output is correct
53 Correct 101 ms 12152 KB Output is correct
54 Correct 96 ms 12152 KB Output is correct
55 Correct 255 ms 22100 KB Output is correct
56 Correct 259 ms 22100 KB Output is correct
57 Correct 102 ms 12120 KB Output is correct
58 Correct 1 ms 256 KB Output is correct
59 Correct 0 ms 256 KB Output is correct
60 Correct 0 ms 384 KB Output is correct
61 Correct 59 ms 5880 KB Output is correct
62 Correct 236 ms 22136 KB Output is correct
63 Correct 237 ms 22084 KB Output is correct
64 Correct 242 ms 22104 KB Output is correct
65 Correct 1 ms 384 KB Output is correct
66 Correct 60 ms 5880 KB Output is correct
67 Correct 242 ms 22136 KB Output is correct
68 Correct 236 ms 22168 KB Output is correct
69 Correct 261 ms 22136 KB Output is correct
70 Correct 1 ms 512 KB Output is correct
71 Correct 1 ms 384 KB Output is correct
72 Correct 1 ms 256 KB Output is correct
73 Correct 61 ms 5880 KB Output is correct
74 Correct 238 ms 22264 KB Output is correct
75 Correct 241 ms 22136 KB Output is correct
76 Correct 239 ms 22160 KB Output is correct
77 Correct 254 ms 22136 KB Output is correct
78 Correct 1 ms 256 KB Output is correct
79 Correct 1 ms 256 KB Output is correct
80 Correct 5 ms 768 KB Output is correct
81 Correct 104 ms 12124 KB Output is correct
82 Correct 1 ms 256 KB Output is correct
83 Correct 1 ms 256 KB Output is correct
84 Correct 1 ms 384 KB Output is correct
85 Correct 64 ms 5880 KB Output is correct
86 Correct 99 ms 12152 KB Output is correct
87 Correct 110 ms 12152 KB Output is correct
88 Correct 95 ms 12152 KB Output is correct
89 Correct 102 ms 12408 KB Output is correct
90 Correct 1 ms 256 KB Output is correct
91 Correct 1 ms 256 KB Output is correct
92 Correct 5 ms 768 KB Output is correct
93 Correct 103 ms 12152 KB Output is correct
94 Correct 1 ms 384 KB Output is correct
95 Correct 1 ms 256 KB Output is correct
96 Correct 1 ms 256 KB Output is correct
97 Correct 26 ms 3328 KB Output is correct
98 Correct 96 ms 12152 KB Output is correct
99 Correct 96 ms 12152 KB Output is correct
100 Correct 95 ms 12152 KB Output is correct
101 Correct 100 ms 12244 KB Output is correct
102 Correct 100 ms 12152 KB Output is correct
103 Correct 99 ms 12152 KB Output is correct
104 Correct 103 ms 12248 KB Output is correct
105 Correct 112 ms 12152 KB Output is correct