답안 #798122

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
798122	2023-07-30T11:35:02 Z	nnin	슈퍼트리 잇기 (IOI20_supertrees)	C++14	11 / 100	156 ms	23940 KB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;

int dsu[1001];
int par(int x) {
    if(dsu[x]==x) return x;
    return dsu[x] = par(dsu[x]);
}

int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	vector<vector<int>> answer(n, vector<int>(n, 0));

	for(int i=0;i<n;i++) dsu[i] = i;

	for(int i=0;i<n;i++) for(int j=i+1;j<n;j++) {
        if(p[i][j]) {
            int pari = par(i);
            int parj = par(j);
            if(pari!=parj) {
                dsu[pari] = parj;
                answer[pari][parj] = answer[parj][pari] = 1;
            }
        }
	}

	build(answer);
	return 1;
}

Subtask #1

11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	7 ms	1208 KB	Output is correct
7	Correct	156 ms	23940 KB	Output is correct

Subtask #2

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	7 ms	1208 KB	Output is correct
7	Correct	156 ms	23940 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	300 KB	Output is correct
10	Correct	0 ms	300 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	6 ms	1244 KB	Output is correct
13	Correct	149 ms	23940 KB	Output is correct
14	Incorrect	1 ms	212 KB	Answer gives possible 1 while actual possible 0
15	Halted	0 ms	0 KB	-

Subtask #3

0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	304 KB	Output is correct
4	Incorrect	1 ms	212 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	212 KB	Output is correct
2	Incorrect	0 ms	212 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	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	7 ms	1208 KB	Output is correct
7	Correct	156 ms	23940 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	300 KB	Output is correct
10	Correct	0 ms	300 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	6 ms	1244 KB	Output is correct
13	Correct	149 ms	23940 KB	Output is correct
14	Incorrect	1 ms	212 KB	Answer gives possible 1 while actual possible 0
15	Halted	0 ms	0 KB	-

Subtask #6

0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	7 ms	1208 KB	Output is correct
7	Correct	156 ms	23940 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	0 ms	300 KB	Output is correct
10	Correct	0 ms	300 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	6 ms	1244 KB	Output is correct
13	Correct	149 ms	23940 KB	Output is correct
14	Incorrect	1 ms	212 KB	Answer gives possible 1 while actual possible 0
15	Halted	0 ms	0 KB	-