oj.uz

답안 #1087721

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1087721 2024-09-13T06:56:35 Z T0p_ 슈퍼트리 잇기 (IOI20_supertrees) C++14
0 / 100
 1000 ms 22160 KB 
#include "supertrees.h"
#include <bits/stdc++.h>

using namespace std;

const int N = 1000;

int tree_parent[N];

int find_tree_parent(int u) {
	return u == tree_parent[u] ? u : find_tree_parent(tree_parent[u]); 
}

int construct(vector<vector<int>> p) {
	int n = p.size();
	vector<vector<int>> ans(n, vector<int>(n));

	for (int i=0 ; i<n ; i++) {
		for (int j=0 ; j<n ; j++) {
			if (p[i][j] == 3) {
				return 0;
			}
		}
	}

	for (int i=0 ; i<n ; i++) {
		tree_parent[i] = i;
	}

	for (int i=0 ; i<n ; i++) {
		for (int j=i+1 ; j<n ; j++) {
			if (p[i][j] == 1) {
				int ii = find_tree_parent(i);
				int jj = find_tree_parent(j);

				if (ii != jj) {
					tree_parent[ii] = jj;
					ans[i][j] = ans[j][i] = 1;
				}
			}
		}
	}

	build(ans);
	return 1;
}

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 436 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 13 ms 1256 KB Output is correct
7 Execution timed out 1040 ms 22160 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 436 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 13 ms 1256 KB Output is correct
7 Execution timed out 1040 ms 22160 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
5 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Incorrect 0 ms 348 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 436 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 13 ms 1256 KB Output is correct
7 Execution timed out 1040 ms 22160 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 436 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 13 ms 1256 KB Output is correct
7 Execution timed out 1040 ms 22160 KB Time limit exceeded
8 Halted 0 ms 0 KB -