oj.uz

답안 #956538

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
956538 2024-04-02T06:52:08 Z KK_1729 슈퍼트리 잇기 (IOI20_supertrees) C++17
21 / 100
 170 ms 24184 KB 
#include "supertrees.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;

struct UFDS {
    vector<int> link, siz;
    UFDS(int n) : link(n), siz(n, 1) { iota(link.begin(), link.end(), 0); } //each element as its own subset, with size 1
    int findRoot(int x) {
        if(x == link[x]) return x;
        return link[x] = findRoot(link[x]);
        /*
        A shorter way of writing the following is:
        return x == link[x]  ? x : link[x]  =  findRoot(link[x]);  
        */
    }
    bool same(int x, int y) { return findRoot(x) == findRoot(y); }
    bool unite(int x, int y) {
        x = findRoot(x);
        y = findRoot(y);
        if (x == y)
            return false;
        if (siz[x] < siz[y]) swap(x, y);
        siz[x] += siz[y];
        link[y] = x;
        return true;
    }
    int size(int x) { return siz[findRoot(x)]; }
};


int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	std::vector<std::vector<int>> answer;
	for (int i = 0; i < n; i++) {
		std::vector<int> row;
		row.resize(n);
		answer.push_back(row);
	}


	UFDS ds(n);
	for (int i = 0; i < n; ++i){
		for (int j = 0; j < n; ++j){
			if (p[i][j] == 1) ds.unite(i, j);
			else{
				if (ds.same(i, j)) return 0;
			}
		}
	}


	vector<vector<int>> parents(n);

	for (int i = 0; i < n; ++i) parents[ds.findRoot(i)].push_back(i);
	
	for (auto item: parents){
		int u = item.size();
		for (int i = 0; i < u-1; i++){
			answer[item[i]][item[i+1]] = 1;
			answer[item[i+1]][item[i]] = 1;
		}
	}
	build(answer);
	return 1;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 7 ms 1372 KB Output is correct
7 Correct 155 ms 23464 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 7 ms 1372 KB Output is correct
7 Correct 155 ms 23464 KB Output is correct
8 Correct 1 ms 428 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1372 KB Output is correct
13 Correct 170 ms 24056 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 928 KB Output is correct
17 Correct 65 ms 14164 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 38 ms 6264 KB Output is correct
21 Correct 151 ms 24148 KB Output is correct
22 Correct 160 ms 24148 KB Output is correct
23 Correct 155 ms 24060 KB Output is correct
24 Correct 151 ms 24184 KB Output is correct
25 Correct 63 ms 14092 KB Output is correct
26 Correct 66 ms 14072 KB Output is correct
27 Correct 158 ms 24148 KB Output is correct
28 Correct 147 ms 24144 KB Output is correct

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 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 7 ms 1372 KB Output is correct
7 Correct 155 ms 23464 KB Output is correct
8 Correct 1 ms 428 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1372 KB Output is correct
13 Correct 170 ms 24056 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 928 KB Output is correct
17 Correct 65 ms 14164 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 38 ms 6264 KB Output is correct
21 Correct 151 ms 24148 KB Output is correct
22 Correct 160 ms 24148 KB Output is correct
23 Correct 155 ms 24060 KB Output is correct
24 Correct 151 ms 24184 KB Output is correct
25 Correct 63 ms 14092 KB Output is correct
26 Correct 66 ms 14072 KB Output is correct
27 Correct 158 ms 24148 KB Output is correct
28 Correct 147 ms 24144 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 7 ms 1372 KB Output is correct
7 Correct 155 ms 23464 KB Output is correct
8 Correct 1 ms 428 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 6 ms 1372 KB Output is correct
13 Correct 170 ms 24056 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 3 ms 928 KB Output is correct
17 Correct 65 ms 14164 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 38 ms 6264 KB Output is correct
21 Correct 151 ms 24148 KB Output is correct
22 Correct 160 ms 24148 KB Output is correct
23 Correct 155 ms 24060 KB Output is correct
24 Correct 151 ms 24184 KB Output is correct
25 Correct 63 ms 14092 KB Output is correct
26 Correct 66 ms 14072 KB Output is correct
27 Correct 158 ms 24148 KB Output is correct
28 Correct 147 ms 24144 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Incorrect 0 ms 348 KB Answer gives possible 1 while actual possible 0
33 Halted 0 ms 0 KB -