oj.uz

Submission #456132

# Submission time Handle Problem Language Result Execution time Memory
456132 2021-08-06T07:03:22 Z fuad27 Connecting Supertrees (IOI20_supertrees) C++14
40 / 100
 295 ms 32124 KB 
    #include "supertrees.h"
    #include<bits/stdc++.h>
    using namespace std;
#define s second
    int visited[2000];
    vector<vector<int> > adjlist;
    int coun=1;
    void dfs(int s){
    	visited[s]=coun;
    	for(int i=0; i<adjlist[s].size(); i++){
    		int v=adjlist[s][i];
    		if(visited[v]==0)
    			dfs(v);
    	}
    }
    int construct(vector<vector<int> > p) {
    	int n = p.size();
    	adjlist.assign(n+1, vector<int>());
    	bool is=false;
    	for(int i=0; i<n; i++){		
    		for(int j=0; j<n; j++){
    			if(p[i][j] && i!=j){
    				adjlist[i].push_back(j);
    				adjlist[j].push_back(i);
    			}
    			if(p[i][j]==2)
    				is=true;
    		}
    	}
    	for(int i=0; i<n; i++){
    		if(visited[i]==0){
    			dfs(i);
    			coun++;
    		}
    	}
    	for(int i=0; i<n; i++){
    		for(int j=0; j<n; j++){
    			if(visited[i]==visited[j] && p[i][j]==0)
    				return 0;
    		}
    	}
    	vector<vector<int> > answer;
    	answer.assign(n, vector<int>());
    	for(int i=0; i<n; i++)
    		answer[i].assign(n, 0);
    	map<int, vector<int> > mp;
    	for(int i=0; i<n; i++)
    		mp[visited[i]].push_back(i);
    	for(auto x:mp){
    		for(int i=1; i<x.s.size(); i++){
    			answer[x.s[i-1]][x.s[i]]=1;
    			answer[x.s[i]][x.s[i-1]]=1;
    		}
    		if(is){
    			if(x.s.size()==1)
    				continue;
    			if(x.s.size()==2)
    				return 0;
    			answer[x.s[0]][x.s[x.s.size()-1]]=1;
    			answer[x.s[x.s.size()-1]][x.s[0]]=1;
    		}
    	}
    	build(answer);
    	return 1;
    }

Compilation message

supertrees.cpp: In function 'void dfs(int)':
supertrees.cpp:10:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |      for(int i=0; i<adjlist[s].size(); i++){
      |                   ~^~~~~~~~~~~~~~~~~~
supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:50:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |       for(int i=1; i<x.s.size(); i++){
      |                    ~^~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 11 ms 1612 KB Output is correct
7 Correct 278 ms 30640 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 11 ms 1612 KB Output is correct
7 Correct 278 ms 30640 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 10 ms 1228 KB Output is correct
13 Correct 232 ms 24052 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 7 ms 864 KB Output is correct
17 Correct 126 ms 15912 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 62 ms 6324 KB Output is correct
21 Correct 241 ms 25076 KB Output is correct
22 Correct 241 ms 24064 KB Output is correct
23 Correct 263 ms 28064 KB Output is correct
24 Correct 242 ms 24120 KB Output is correct
25 Correct 120 ms 11248 KB Output is correct
26 Correct 98 ms 10104 KB Output is correct
27 Correct 255 ms 30276 KB Output is correct
28 Correct 234 ms 24104 KB Output is correct

Subtask #3
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 10 ms 1104 KB Output is correct
9 Correct 235 ms 22188 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 11 ms 1576 KB Output is correct
13 Correct 253 ms 32124 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 6 ms 844 KB Output is correct
17 Correct 123 ms 15740 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 0 ms 300 KB Output is correct
21 Correct 59 ms 6340 KB Output is correct
22 Correct 243 ms 25072 KB Output is correct
23 Correct 231 ms 24052 KB Output is correct
24 Correct 254 ms 30324 KB Output is correct
25 Correct 106 ms 14212 KB Output is correct
26 Correct 117 ms 11252 KB Output is correct
27 Correct 230 ms 24112 KB Output is correct
28 Correct 295 ms 28144 KB Output is correct
29 Correct 117 ms 14196 KB Output is correct

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 60 ms 5760 KB Output is correct
5 Correct 240 ms 23236 KB Output is correct
6 Correct 234 ms 22144 KB Output is correct
7 Correct 251 ms 26176 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 61 ms 6264 KB Output is correct
10 Correct 242 ms 25084 KB Output is correct
11 Correct 233 ms 24132 KB Output is correct
12 Correct 256 ms 30208 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Incorrect 0 ms 204 KB Too many ways to get from 4 to 8, should be 1 found no less than 2
15 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 11 ms 1612 KB Output is correct
7 Correct 278 ms 30640 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 10 ms 1228 KB Output is correct
13 Correct 232 ms 24052 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 7 ms 864 KB Output is correct
17 Correct 126 ms 15912 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 62 ms 6324 KB Output is correct
21 Correct 241 ms 25076 KB Output is correct
22 Correct 241 ms 24064 KB Output is correct
23 Correct 263 ms 28064 KB Output is correct
24 Correct 242 ms 24120 KB Output is correct
25 Correct 120 ms 11248 KB Output is correct
26 Correct 98 ms 10104 KB Output is correct
27 Correct 255 ms 30276 KB Output is correct
28 Correct 234 ms 24104 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 10 ms 1104 KB Output is correct
37 Correct 235 ms 22188 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 11 ms 1576 KB Output is correct
41 Correct 253 ms 32124 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 6 ms 844 KB Output is correct
45 Correct 123 ms 15740 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 0 ms 300 KB Output is correct
49 Correct 59 ms 6340 KB Output is correct
50 Correct 243 ms 25072 KB Output is correct
51 Correct 231 ms 24052 KB Output is correct
52 Correct 254 ms 30324 KB Output is correct
53 Correct 106 ms 14212 KB Output is correct
54 Correct 117 ms 11252 KB Output is correct
55 Correct 230 ms 24112 KB Output is correct
56 Correct 295 ms 28144 KB Output is correct
57 Correct 117 ms 14196 KB Output is correct
58 Correct 0 ms 204 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 6 ms 1100 KB Output is correct
61 Correct 122 ms 18940 KB Output is correct
62 Correct 1 ms 204 KB Output is correct
63 Incorrect 1 ms 204 KB Too many ways to get from 0 to 9, should be 1 found no less than 2
64 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 11 ms 1612 KB Output is correct
7 Correct 278 ms 30640 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 10 ms 1228 KB Output is correct
13 Correct 232 ms 24052 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 7 ms 864 KB Output is correct
17 Correct 126 ms 15912 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 62 ms 6324 KB Output is correct
21 Correct 241 ms 25076 KB Output is correct
22 Correct 241 ms 24064 KB Output is correct
23 Correct 263 ms 28064 KB Output is correct
24 Correct 242 ms 24120 KB Output is correct
25 Correct 120 ms 11248 KB Output is correct
26 Correct 98 ms 10104 KB Output is correct
27 Correct 255 ms 30276 KB Output is correct
28 Correct 234 ms 24104 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 10 ms 1104 KB Output is correct
37 Correct 235 ms 22188 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 0 ms 204 KB Output is correct
40 Correct 11 ms 1576 KB Output is correct
41 Correct 253 ms 32124 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 6 ms 844 KB Output is correct
45 Correct 123 ms 15740 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 0 ms 300 KB Output is correct
49 Correct 59 ms 6340 KB Output is correct
50 Correct 243 ms 25072 KB Output is correct
51 Correct 231 ms 24052 KB Output is correct
52 Correct 254 ms 30324 KB Output is correct
53 Correct 106 ms 14212 KB Output is correct
54 Correct 117 ms 11252 KB Output is correct
55 Correct 230 ms 24112 KB Output is correct
56 Correct 295 ms 28144 KB Output is correct
57 Correct 117 ms 14196 KB Output is correct
58 Correct 0 ms 204 KB Output is correct
59 Correct 0 ms 204 KB Output is correct
60 Correct 0 ms 204 KB Output is correct
61 Correct 60 ms 5760 KB Output is correct
62 Correct 240 ms 23236 KB Output is correct
63 Correct 234 ms 22144 KB Output is correct
64 Correct 251 ms 26176 KB Output is correct
65 Correct 1 ms 204 KB Output is correct
66 Correct 61 ms 6264 KB Output is correct
67 Correct 242 ms 25084 KB Output is correct
68 Correct 233 ms 24132 KB Output is correct
69 Correct 256 ms 30208 KB Output is correct
70 Correct 1 ms 204 KB Output is correct
71 Incorrect 0 ms 204 KB Too many ways to get from 4 to 8, should be 1 found no less than 2
72 Halted 0 ms 0 KB -