oj.uz

Submission #479888

# Submission time Handle Problem Language Result Execution time Memory
479888 2021-10-13T18:50:18 Z glome Connecting Supertrees (IOI20_supertrees) C++17
11 / 100
 215 ms 23472 KB 
#include "supertrees.h"
#include <vector>
#include<bits/stdc++.h>

using namespace std;

int construct(std::vector<std::vector<int>> p) {
	bool ok = 1;
	for (int i = 0; i<p.size(); i++) {
		for (int j = 0; j<p.size(); j++) {
			ok &= 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;
	}	
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:9:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |  for (int i = 0; i<p.size(); i++) {
      |                  ~^~~~~~~~~
supertrees.cpp:10:20: 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 j = 0; j<p.size(); j++) {
      |                   ~^~~~~~~~~
supertrees.cpp:16:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |   for (int i = 0; i<p.size(); i++) {
      |                   ~^~~~~~~~~
supertrees.cpp:19:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |   for (int i = 1; i<p.size(); i++) {
      |                   ~^~~~~~~~~
supertrees.cpp:26:1: warning: control reaches end of non-void function [-Wreturn-type]
   26 | }
      | ^

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 1 ms 204 KB Output is correct
6 Correct 10 ms 1204 KB Output is correct
7 Correct 215 ms 23472 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 1 ms 204 KB Output is correct
6 Correct 10 ms 1204 KB Output is correct
7 Correct 215 ms 23472 KB Output is correct
8 Incorrect 0 ms 204 KB Too many ways to get from 0 to 1, should be 0 found no less than 1
9 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Too many ways to get from 0 to 1, should be 0 found no less than 1
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Too many ways to get from 0 to 1, should be 0 found no less than 1
2 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 1 ms 204 KB Output is correct
6 Correct 10 ms 1204 KB Output is correct
7 Correct 215 ms 23472 KB Output is correct
8 Incorrect 0 ms 204 KB Too many ways to get from 0 to 1, should be 0 found no less than 1
9 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 1 ms 204 KB Output is correct
6 Correct 10 ms 1204 KB Output is correct
7 Correct 215 ms 23472 KB Output is correct
8 Incorrect 0 ms 204 KB Too many ways to get from 0 to 1, should be 0 found no less than 1
9 Halted 0 ms 0 KB -