oj.uz

답안 #362807

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
362807 2021-02-04T12:18:47 Z mathking1021 슈퍼트리 잇기 (IOI20_supertrees) C++17
19 / 100
 291 ms 24324 KB 
#include "supertrees.h"
#include <vector>

using namespace std;

int cp[1005];
vector<int> ve[1005];

int fnd(int p)
{
    if(cp[p] == p) return p;
    return cp[p] = fnd(cp[p]);
}

void uni(int p, int q)
{
    if(fnd(p) == fnd(q)) return;
    cp[fnd(p)] = fnd(q);
}

int construct(vector<vector<int> > p) {
	int n = p.size();
	vector<vector<int> > answer;
	for(int i = 0; i < n; i++)
    {
        cp[i] = i;
    }
	for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < n; j++)
        {
            if(p[i][j]) uni(i, j);
        }
    }
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < n; j++)
        {
            if(!p[i][j] && fnd(i) == fnd(j)) return 0;
        }
    }
	for(int i = 0; i < n; i++)
    {
		vector<int> row;
		for(int j = 0; j < n; j++)
        {
            row.push_back(0);
        }
		answer.push_back(row);
	}
	for(int i = 0; i < n; i++)
    {
        ve[fnd(i)].push_back(i);
    }
    for(int i = 0; i < n; i++)
    {
        if(ve[i].size() == 2) return 0;
        if(ve[i].size() == 0) continue;
        if(ve[i].size() == 1) continue;
        for(int j = 1; j < ve[i].size(); j++)
        {
            answer[ve[i][j]][ve[i][j - 1]] = 1;
            answer[ve[i][j - 1]][ve[i][j]] = 1;
        }
        answer[ve[i][0]][ve[i][ve[i].size() - 1]] = 1;
        answer[ve[i][ve[i].size() - 1]][ve[i][0]] = 1;
    }
	build(answer);
	return 1;
}

Compilation message

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:60:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |         for(int j = 1; j < ve[i].size(); j++)
      |                        ~~^~~~~~~~~~~~~~

Subtask #1
0 / 11.0

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

Subtask #2
0 / 10.0

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

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 11 ms 1260 KB Output is correct
9 Correct 255 ms 24172 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 11 ms 1260 KB Output is correct
13 Correct 271 ms 24172 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 0 ms 364 KB Output is correct
16 Correct 6 ms 748 KB Output is correct
17 Correct 130 ms 10220 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 0 ms 364 KB Output is correct
21 Correct 67 ms 6380 KB Output is correct
22 Correct 291 ms 24044 KB Output is correct
23 Correct 271 ms 24044 KB Output is correct
24 Correct 288 ms 24324 KB Output is correct
25 Correct 129 ms 14188 KB Output is correct
26 Correct 121 ms 10220 KB Output is correct
27 Correct 259 ms 24044 KB Output is correct
28 Correct 290 ms 24044 KB Output is correct
29 Correct 129 ms 14188 KB Output is correct

Subtask #4
0 / 35.0

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

Subtask #5
0 / 21.0

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

Subtask #6
0 / 4.0

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