oj.uz

답안 #982921

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
982921 2024-05-15T04:07:27 Z tamir1 슈퍼트리 잇기 (IOI20_supertrees) C++17
19 / 100
 186 ms 24208 KB 
#include "supertrees.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
int sz[1001],par[1001];
int find(int a){
	if(a==par[a]) return a;
	int x=find(par[a]);
	par[a]=x;
	return x;
}
vector<int> v[1001];
int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	for(int i=0;i<n;i++){
		sz[i]=1;
		par[i]=i;
		for(int j=0;j<n;j++){
			if(p[i][j]==3) return 0;
			if(p[i][j]==2 && n<3) return 0;
		}
	}
	if(n==1){
		build({{0}});
		return 1;
	}
	std::vector<std::vector<int>> answer(n,vector<int> (n,0));
	for (int i = 0; i < n; i++) {
		for(int j=0;j<n;j++){
			int x=find(i);
			int y=find(j);
			if(p[i][j]==0 && x==y) return 0;
			if(p[i][j]==2){
				if(x==y) continue;
				if(sz[x]<sz[y]) swap(x,y);
				else if(sz[x]==sz[y] && x>y) swap(x,y);
				sz[x]+=sz[y];
				par[y]=x;
			}
		}
	}
	for(int i=0;i<n;i++){
		par[i]=find(i);
		v[par[i]].push_back(i);
	}
	for(int i=0;i<n;i++){
		int k=v[i].size();
		if(k==0 || k==1) continue;
		if(k==2) return 0;
		v[i].push_back(v[i][0]);
		for(int j=0;j<k;j++){
			answer[v[i][j]][v[i][j+1]]=1;
			answer[v[i][j+1]][v[i][j]]=1;
		}
	}
	build(answer);
	return 1;
}

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Too few ways to get from 0 to 1, should be 1 found 0
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Too few ways to get from 0 to 1, should be 1 found 0
3 Halted 0 ms 0 KB -

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 372 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 7 ms 1212 KB Output is correct
9 Correct 158 ms 23976 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 7 ms 1372 KB Output is correct
13 Correct 186 ms 24108 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 3 ms 960 KB Output is correct
17 Correct 69 ms 14164 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 464 KB Output is correct
21 Correct 41 ms 6224 KB Output is correct
22 Correct 157 ms 24148 KB Output is correct
23 Correct 161 ms 24144 KB Output is correct
24 Correct 165 ms 24208 KB Output is correct
25 Correct 68 ms 14116 KB Output is correct
26 Correct 65 ms 14240 KB Output is correct
27 Correct 157 ms 24148 KB Output is correct
28 Correct 161 ms 24144 KB Output is correct
29 Correct 65 ms 14160 KB Output is correct

Subtask #4
0 / 35.0

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

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Too few ways to get from 0 to 1, should be 1 found 0
3 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB Too few ways to get from 0 to 1, should be 1 found 0
3 Halted 0 ms 0 KB -