oj.uz

Submission #777005

# Submission time Handle Problem Language Result Execution time Memory
777005 2023-07-08T13:27:57 Z Trisanu_Das Connecting Supertrees (IOI20_supertrees) C++17
0 / 100
 1 ms 256 KB 
#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
 
int construct(vector<vector<int>> p) {
	int n = p.size();
	vector<vector<int>> ans(n, vector<int>(n, 0));
	for(int i = 0; i < n; i ++) for(int j = 0; j < n; j ++) if(p[i][j] == 3) return 0;
	vector<int> rt(n, 0);
	for(int i = 0; i < n; i ++){
		int la = 0;
		for(; p[i][la] != 1; la ++);
		if(la != i){
			if(p[la] != p[i]) return 0;
			ans[la][i] = 1; ans[i][la] = 1;
		}else rt[i] = 1;
	}
	for(int i = 0; i < n; i ++) if(rt[i]){
		int cc = 0;
		for(; p[i][cc] == 0; cc ++);
		for(int j = 0; j < n; j ++)if((p[cc][j] == 0) ^ (p[i][j] == 0))return 0;
		if(cc == i){
			int la = i;
			for(int j = i + 1; j < n; j ++)
				if(rt[j] && p[i][j]){
					ans[la][j] = 1; ans[j][la] = 1;
					la = j;
				}
			if(la == i);
			else if(ans[la][i]) return 0;
			else ans[la][i] = 1; ans[i][la] = 1;
		}
	}
 
	build(ans);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:31:4: warning: this 'else' clause does not guard... [-Wmisleading-indentation]
   31 |    else ans[la][i] = 1; ans[i][la] = 1;
      |    ^~~~
supertrees.cpp:31:25: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'else'
   31 |    else ans[la][i] = 1; ans[i][la] = 1;
      |                         ^~~

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB b[0][0] is not 0
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB b[0][0] is not 0
2 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB b[0][0] is not 0
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 256 KB b[0][0] is not 0
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB b[0][0] is not 0
2 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB b[0][0] is not 0
2 Halted 0 ms 0 KB -