답안 #301766

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
301766	2020-09-18T07:42:19 Z	SOIVIEONE	슈퍼트리 잇기 (IOI20_supertrees)	C++14	21 / 100	273 ms	22172 KB

supertrees

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

int ota[222222];
int find(int x)
{
    return (ota[x] == x ? x : ota[x] = find(ota[x]));
}

void unite(int x, int y)
{
    x = find(x);
    y = find(y);
    ota[y] = x;
}


int construct(std::vector<std::vector<int>> p) {
	int n = p.size();
	std::vector<std::vector<int>> a;
	for (int i = 0; i < n; i++) {
		std::vector<int> row;
		row.resize(n);
		a.push_back(row);
	}
	for(int i = 0; i < n; i ++)
        ota[i] = i;
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < n; j ++)
        {
            if(p[i][j])
            {
                unite(i, j);
            }
        }
    }
    for(int i = 0; i < n; i ++)
    {

        for(int j = 0; j < n; j ++)
        {
            if(i==j)continue;
            int otai = find(i);
            int otaj = find(j);
            if(((otai != otaj) && p[i][j]) || ((otai ==otaj) && !p[i][j]))
                return 0;
            if(otai == otaj)
            {
                if(otai != i)
                    a[i][otai] = a[otai][i] = 1;
            }
        }
    }
	build(a);
	return 1;
}
/*
5
1 0 0 1 1
0 1 1 0 0
0 1 1 0 0
1 0 0 1 1
1 0 0 1 1
*/

Subtask #1

11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	11 ms	1280 KB	Output is correct
7	Correct	265 ms	22112 KB	Output is correct

Subtask #2

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	11 ms	1280 KB	Output is correct
7	Correct	265 ms	22112 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	1 ms	256 KB	Output is correct
11	Correct	1 ms	256 KB	Output is correct
12	Correct	10 ms	1280 KB	Output is correct
13	Correct	241 ms	22136 KB	Output is correct
14	Correct	1 ms	256 KB	Output is correct
15	Correct	1 ms	256 KB	Output is correct
16	Correct	5 ms	768 KB	Output is correct
17	Correct	121 ms	12152 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	1 ms	256 KB	Output is correct
20	Correct	62 ms	5880 KB	Output is correct
21	Correct	249 ms	22136 KB	Output is correct
22	Correct	244 ms	22136 KB	Output is correct
23	Correct	273 ms	22172 KB	Output is correct
24	Correct	247 ms	22136 KB	Output is correct
25	Correct	101 ms	12152 KB	Output is correct
26	Correct	97 ms	12152 KB	Output is correct
27	Correct	269 ms	22136 KB	Output is correct
28	Correct	263 ms	22140 KB	Output is correct

Subtask #3

0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Incorrect	1 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	1 ms	256 KB	Output is correct
2	Incorrect	1 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	1 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	11 ms	1280 KB	Output is correct
7	Correct	265 ms	22112 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	1 ms	256 KB	Output is correct
11	Correct	1 ms	256 KB	Output is correct
12	Correct	10 ms	1280 KB	Output is correct
13	Correct	241 ms	22136 KB	Output is correct
14	Correct	1 ms	256 KB	Output is correct
15	Correct	1 ms	256 KB	Output is correct
16	Correct	5 ms	768 KB	Output is correct
17	Correct	121 ms	12152 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	1 ms	256 KB	Output is correct
20	Correct	62 ms	5880 KB	Output is correct
21	Correct	249 ms	22136 KB	Output is correct
22	Correct	244 ms	22136 KB	Output is correct
23	Correct	273 ms	22172 KB	Output is correct
24	Correct	247 ms	22136 KB	Output is correct
25	Correct	101 ms	12152 KB	Output is correct
26	Correct	97 ms	12152 KB	Output is correct
27	Correct	269 ms	22136 KB	Output is correct
28	Correct	263 ms	22140 KB	Output is correct
29	Correct	1 ms	256 KB	Output is correct
30	Correct	1 ms	256 KB	Output is correct
31	Correct	1 ms	256 KB	Output is correct
32	Incorrect	1 ms	256 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	256 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	11 ms	1280 KB	Output is correct
7	Correct	265 ms	22112 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	1 ms	256 KB	Output is correct
11	Correct	1 ms	256 KB	Output is correct
12	Correct	10 ms	1280 KB	Output is correct
13	Correct	241 ms	22136 KB	Output is correct
14	Correct	1 ms	256 KB	Output is correct
15	Correct	1 ms	256 KB	Output is correct
16	Correct	5 ms	768 KB	Output is correct
17	Correct	121 ms	12152 KB	Output is correct
18	Correct	1 ms	256 KB	Output is correct
19	Correct	1 ms	256 KB	Output is correct
20	Correct	62 ms	5880 KB	Output is correct
21	Correct	249 ms	22136 KB	Output is correct
22	Correct	244 ms	22136 KB	Output is correct
23	Correct	273 ms	22172 KB	Output is correct
24	Correct	247 ms	22136 KB	Output is correct
25	Correct	101 ms	12152 KB	Output is correct
26	Correct	97 ms	12152 KB	Output is correct
27	Correct	269 ms	22136 KB	Output is correct
28	Correct	263 ms	22140 KB	Output is correct
29	Correct	1 ms	256 KB	Output is correct
30	Correct	1 ms	256 KB	Output is correct
31	Correct	1 ms	256 KB	Output is correct
32	Incorrect	1 ms	256 KB	Answer gives possible 1 while actual possible 0
33	Halted	0 ms	0 KB	-