답안 #440277

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
440277	2021-07-01T22:19:51 Z	MohamedAliSaidane	슈퍼트리 잇기 (IOI20_supertrees)	C++14	21 / 100	294 ms	31812 KB

supertrees

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

typedef long long ll;
typedef vector<int> vi;
#define pb push_back
#define popb pop_back
#define ff first
#define ss second

vi par;
vi rnk;
int findset(int i)
{
    if(par[i] == i)
        return i;
    return findset(par[i]) ;
}
void unite(int i, int j)
{
    if(findset(i) == findset(j))
        return;
    int x = findset(i);
    int y = findset(j);
    if(rnk[x] < rnk[y])
        swap(x,y);
    par[y] = x;
    if(rnk[x] == rnk[y])
        rnk[x] ++;
    return ;
}
int construct(vector<vi> p)
 {
	int n = p.size();
	vector<vi> b;
	for (int i = 0; i < n; i++)
    {
		vi row;
		for(int j = 0; j <n; j ++)
        {
            par.pb(j);
            rnk.pb(0);
            row.pb(0);
        }
		b.pb(row);
	}
	for(int i = 0; i <n; i ++)
	{
	    for(int j = 0; j < n; j ++)
        {
            if(i == j)
            {
                continue;
            }
            if(p[i][j] > 0)
            {
                unite(i,j);
            }
        }
	}
	for(int i = 0; i <n; i ++)
    {
        for(int j = 0; j < n; j ++)
        {
            if(i == j)
                continue;
            if(p[i][j] == 0 && findset(i) == findset(j))
                return 0;
        }
    }
    for(int i = 0; i <n; i ++)
    {
        if(i != par[i])
        {
            b[i][par[i]] = 1;
            b[par[i]][i] = 1;
        }
    }
    build(b);
	return 1;
}
/*
6
1 1 1 0 0 0
1 1 1 0 0 0
1 1 1 0 0 0
0 0 0 1 1 1
0 0 0 1 1 1
0 0 0 1 1 1
*/

Subtask #1

11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	11 ms	1420 KB	Output is correct
7	Correct	262 ms	29844 KB	Output is correct

Subtask #2

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	11 ms	1420 KB	Output is correct
7	Correct	262 ms	29844 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	10 ms	1520 KB	Output is correct
13	Correct	294 ms	31812 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	6 ms	1300 KB	Output is correct
17	Correct	122 ms	21852 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	300 KB	Output is correct
20	Correct	66 ms	8172 KB	Output is correct
21	Correct	240 ms	31812 KB	Output is correct
22	Correct	261 ms	31764 KB	Output is correct
23	Correct	260 ms	31776 KB	Output is correct
24	Correct	257 ms	31776 KB	Output is correct
25	Correct	109 ms	21856 KB	Output is correct
26	Correct	108 ms	21968 KB	Output is correct
27	Correct	255 ms	31808 KB	Output is correct
28	Correct	239 ms	31764 KB	Output is correct

Subtask #3

0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Incorrect	1 ms	204 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	204 KB	Output is correct
2	Incorrect	1 ms	204 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	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	11 ms	1420 KB	Output is correct
7	Correct	262 ms	29844 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	10 ms	1520 KB	Output is correct
13	Correct	294 ms	31812 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	6 ms	1300 KB	Output is correct
17	Correct	122 ms	21852 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	300 KB	Output is correct
20	Correct	66 ms	8172 KB	Output is correct
21	Correct	240 ms	31812 KB	Output is correct
22	Correct	261 ms	31764 KB	Output is correct
23	Correct	260 ms	31776 KB	Output is correct
24	Correct	257 ms	31776 KB	Output is correct
25	Correct	109 ms	21856 KB	Output is correct
26	Correct	108 ms	21968 KB	Output is correct
27	Correct	255 ms	31808 KB	Output is correct
28	Correct	239 ms	31764 KB	Output is correct
29	Correct	1 ms	204 KB	Output is correct
30	Correct	0 ms	204 KB	Output is correct
31	Correct	1 ms	204 KB	Output is correct
32	Incorrect	1 ms	204 KB	Answer gives possible 1 while actual possible 0
33	Halted	0 ms	0 KB	-

Subtask #6

0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	11 ms	1420 KB	Output is correct
7	Correct	262 ms	29844 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	10 ms	1520 KB	Output is correct
13	Correct	294 ms	31812 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	6 ms	1300 KB	Output is correct
17	Correct	122 ms	21852 KB	Output is correct
18	Correct	1 ms	204 KB	Output is correct
19	Correct	1 ms	300 KB	Output is correct
20	Correct	66 ms	8172 KB	Output is correct
21	Correct	240 ms	31812 KB	Output is correct
22	Correct	261 ms	31764 KB	Output is correct
23	Correct	260 ms	31776 KB	Output is correct
24	Correct	257 ms	31776 KB	Output is correct
25	Correct	109 ms	21856 KB	Output is correct
26	Correct	108 ms	21968 KB	Output is correct
27	Correct	255 ms	31808 KB	Output is correct
28	Correct	239 ms	31764 KB	Output is correct
29	Correct	1 ms	204 KB	Output is correct
30	Correct	0 ms	204 KB	Output is correct
31	Correct	1 ms	204 KB	Output is correct
32	Incorrect	1 ms	204 KB	Answer gives possible 1 while actual possible 0
33	Halted	0 ms	0 KB	-