oj.uz

Submission #479914

# Submission time Handle Problem Language Result Execution time Memory
479914 2021-10-13T22:01:37 Z glome Connecting Supertrees (IOI20_supertrees) C++17
11 / 100
 183 ms 22128 KB 
#include "supertrees.h"
#include <vector>
#include<bits/stdc++.h>

using namespace std;

int construct(std::vector<std::vector<int>> p) {
	set<int> s;
	bool ok = 1;
	for (int i = 0; i<p.size(); i++) {
		for (int j = 0; j<p.size(); j++) {
			ok &= p[i][j];
			s.insert(p[i][j]);
		}
	}
	if(ok) {
		vector<vector<int>> ans(p.size(), vector<int> (p.size()));
		for (int i = 0; i<p.size(); i++) {
			ans[i][i] = 0;
		}
		for (int i = 1; i<p.size(); i++) {
			ans[0][i] = 1;
			ans[i][0] = 1;
		}
		build(ans);
		return 1;
	}
	if(s.size() == 2) {
		vector<vector<int>> ans(p.size(), vector<int> (p.size(), 0));
		for (int i = 0; i<p.size(); i++) {
			for (int j = i + 1; j<p.size(); j++) {
				if(p[i][j] == 1) {
					ans[i][j] = 1;
					ans[j][i] = 1;
				}
			}
		}
		build(ans);
		return 1;
	}


}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:10:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |  for (int i = 0; i<p.size(); i++) {
      |                  ~^~~~~~~~~
supertrees.cpp:11:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 |   for (int j = 0; j<p.size(); j++) {
      |                   ~^~~~~~~~~
supertrees.cpp:18:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |   for (int i = 0; i<p.size(); i++) {
      |                   ~^~~~~~~~~
supertrees.cpp:21:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |   for (int i = 1; i<p.size(); i++) {
      |                   ~^~~~~~~~~
supertrees.cpp:30:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |   for (int i = 0; i<p.size(); i++) {
      |                   ~^~~~~~~~~
supertrees.cpp:31:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |    for (int j = i + 1; j<p.size(); j++) {
      |                        ~^~~~~~~~~
supertrees.cpp:8:11: warning: control reaches end of non-void function [-Wreturn-type]
    8 |  set<int> s;
      |           ^

Subtask #1
11.0 / 11.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 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 8 ms 1100 KB Output is correct
7 Correct 181 ms 21956 KB Output is correct

Subtask #2
0 / 10.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 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 8 ms 1100 KB Output is correct
7 Correct 181 ms 21956 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 232 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 8 ms 1100 KB Output is correct
13 Correct 183 ms 22128 KB Output is correct
14 Incorrect 0 ms 204 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Incorrect 0 ms 204 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Too few ways to get from 0 to 1, should be 2 found 0
3 Halted 0 ms 0 KB -

Subtask #5
0 / 21.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 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 8 ms 1100 KB Output is correct
7 Correct 181 ms 21956 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 232 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 8 ms 1100 KB Output is correct
13 Correct 183 ms 22128 KB Output is correct
14 Incorrect 0 ms 204 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -

Subtask #6
0 / 4.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 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 8 ms 1100 KB Output is correct
7 Correct 181 ms 21956 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 232 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 8 ms 1100 KB Output is correct
13 Correct 183 ms 22128 KB Output is correct
14 Incorrect 0 ms 204 KB Answer gives possible 1 while actual possible 0
15 Halted 0 ms 0 KB -