oj.uz

답안 #770998

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
770998 2023-07-02T10:13:12 Z OrazB 슈퍼트리 잇기 (IOI20_supertrees) C++17
0 / 100
 2 ms 2644 KB 
#include <bits/stdc++.h>
#include "supertrees.h"
using namespace std;
#define N 100005
#define wr cout << "Continue debugging\n";
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define ff first
#define ss second

vector<int> vec[N];

// int find(int i, vector<vector<int>> p, int n){
// 	set<int> s;
// 	for (int j = 0; j < n; j++){
// 		if (p[i][j] and i != j) s.insert(p[i][j]);
// 	}
// 	if (s.size() > 1) return -1;
// 	if (!s.size()) return -2;
// 	return *s.begin();
// }

int construct(vector<vector<int>> p){
	int n = p.size();
	vector<vector<int>> b(n, vector<int>(n, 0));
	vector<int> vis(n, 0);
	int cnt = 0;
	for (int i = 0; i < n; i++){
		if (!vis[i]) vis[i] = ++cnt;
		for (int j = 0; j < n; j++){
			if (p[i][j] and i != j){
				b[i][j] = b[j][i] = 1;
				vis[j] = vis[i];
			}else if (!p[i][j]) vec[vis[i]].pb(j);
		}
		// if (x == 2){
		// 	int a1 = -1, b1 = -1;
		// 	for (int j = 0; j < n; j++){
		// 		if (p[i][j] and i != j){
		// 			if (a1 == -1) a1 = j;
		// 			else b1 = j;
		// 		}
		// 	}
		// 	if (b1 == -1) return 0;
		// 	b[a1][b1] = b[b1][a1] = 1;
		// }
	}
	for (int i = 0; i < n; i++){
		for (auto j : vec[vis[i]]){
			if (p[i][j]) return 0;
		}
	}
	// for (int i = 0; i < n; i++){
	// 	for (int j = 0; j < n; j++) cout << b[i][j] << ' ';
	// 	cout << '\n';
	// }
	build(b);
	return 1;
}
// int main ()
// {
// 	int n;
// 	cin >> n;
// 	vector<vector<int>> p(n, vector<int>(n));
// 	for (int i = 0; i < n; i++){
// 		for (int j = 0; j < n; j++) cin >> p[i][j];
// 	}
// 	int x = construct(p);
// }

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Incorrect 1 ms 2644 KB Too many ways to get from 0 to 2, should be 1 found no less than 2
4 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Incorrect 1 ms 2644 KB Too many ways to get from 0 to 2, should be 1 found no less than 2
4 Halted 0 ms 0 KB -

Subtask #3
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Incorrect 1 ms 2644 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 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Incorrect 1 ms 2644 KB Too many ways to get from 1 to 4, should be 1 found no less than 2
4 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Incorrect 1 ms 2644 KB Too many ways to get from 0 to 2, should be 1 found no less than 2
4 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Incorrect 1 ms 2644 KB Too many ways to get from 0 to 2, should be 1 found no less than 2
4 Halted 0 ms 0 KB -