답안 #301282

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
301282	2020-09-17T19:46:58 Z	Gilgamesh	슈퍼트리 잇기 (IOI20_supertrees)	C++17	11 / 100	254 ms	22140 KB

supertrees

#include "supertrees.h"
#include <vector>

const int mxN = 1000;

int parent[mxN];
int rank[mxN];

int find(int x) 
{ 
    if(parent[x] == -1)
        parent[x] = x;
    if (parent[x] != x) { 
        parent[x] = find(parent[x]); 
    }
    return parent[x]; 
}
bool merge(int x, int y) 
{ 
    int xRoot = find(x), yRoot = find(y); 
    if (xRoot == yRoot) 
        return false; 
    if (rank[xRoot] < rank[yRoot]) 
        parent[xRoot] = yRoot; 
    else if (rank[yRoot] < rank[xRoot]) 
        parent[yRoot] = xRoot; 
    else 
    { 
        parent[yRoot] = xRoot; 
        rank[xRoot] = rank[xRoot] + 1; 
    } 
    return true;
} 

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);
    }
    for(int i = 0; i < n; ++i){
        parent[i] = i;
    }
    for(int i = 0; i < n; ++i){
        for(int j = i + 1; j < n; ++j){
            if(!p[i][j] && find(i) == find(j)){
                return 0;
            }
            if(p[i][j]) merge(i, j);
        }
    }
    for(int i = 0; i < n; ++i){
        int rep = find(i);
        if(rep == i) continue;
        answer[rep][i] = 1;
        answer[i][rep] = 1;
    }
    build(answer);
    return 1;
}

Subtask #1

11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	12 ms	1152 KB	Output is correct
7	Correct	254 ms	22100 KB	Output is correct

Subtask #2

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	12 ms	1152 KB	Output is correct
7	Correct	254 ms	22100 KB	Output is correct
8	Correct	0 ms	256 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	10 ms	1152 KB	Output is correct
13	Correct	246 ms	22140 KB	Output is correct
14	Correct	0 ms	256 KB	Output is correct
15	Correct	0 ms	256 KB	Output is correct
16	Correct	5 ms	768 KB	Output is correct
17	Correct	113 ms	12152 KB	Output is correct
18	Incorrect	0 ms	256 KB	Answer gives possible 1 while actual possible 0
19	Halted	0 ms	0 KB	-

Subtask #3

0 / 19.0

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

Subtask #4

0 / 35.0

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

Subtask #5

0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	12 ms	1152 KB	Output is correct
7	Correct	254 ms	22100 KB	Output is correct
8	Correct	0 ms	256 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	10 ms	1152 KB	Output is correct
13	Correct	246 ms	22140 KB	Output is correct
14	Correct	0 ms	256 KB	Output is correct
15	Correct	0 ms	256 KB	Output is correct
16	Correct	5 ms	768 KB	Output is correct
17	Correct	113 ms	12152 KB	Output is correct
18	Incorrect	0 ms	256 KB	Answer gives possible 1 while actual possible 0
19	Halted	0 ms	0 KB	-

Subtask #6

0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	0 ms	256 KB	Output is correct
3	Correct	0 ms	256 KB	Output is correct
4	Correct	0 ms	256 KB	Output is correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	12 ms	1152 KB	Output is correct
7	Correct	254 ms	22100 KB	Output is correct
8	Correct	0 ms	256 KB	Output is correct
9	Correct	0 ms	256 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	10 ms	1152 KB	Output is correct
13	Correct	246 ms	22140 KB	Output is correct
14	Correct	0 ms	256 KB	Output is correct
15	Correct	0 ms	256 KB	Output is correct
16	Correct	5 ms	768 KB	Output is correct
17	Correct	113 ms	12152 KB	Output is correct
18	Incorrect	0 ms	256 KB	Answer gives possible 1 while actual possible 0
19	Halted	0 ms	0 KB	-