Submission #301293

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
301293	2020-09-17T20:18:19 Z	Gilgamesh	Connecting Supertrees (IOI20_supertrees)	C++17	0 / 100	1 ms	384 KB

supertrees

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

const int mxN = 1000;

int parent[mxN];
int rnk[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 (rnk[xRoot] < rnk[yRoot]) 
        parent[xRoot] = yRoot; 
    else if (rnk[yRoot] < rnk[xRoot]) 
        parent[yRoot] = xRoot; 
    else 
    { 
        parent[yRoot] = xRoot; 
        rnk[xRoot] = rnk[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){
        for(int j = i + 1; j < n; ++j){
            if(!p[i][j] && find(i) == find(j)) return 0;
        }
    }
    std::vector<int> sets[n];
    for(int i = 0; i < n; ++i){
        int rep = find(i);
        sets[rep].emplace_back(i);
    }
    for(int i = 0; i < n; ++i){
        for(int j = 0; j < sets[i].size() - 1; ++j){
            answer[sets[i][j]][sets[i][j + 1]] = 1;
            answer[sets[i][j + 1]][sets[i][j]] = 1;
        }
        if(sets[i].size() > 1){
            answer[sets[i][0]][sets[i][sets[i].size()-1]] = 1;
            answer[sets[i][sets[i].size()-1]][sets[i][0]] = 1;
        }
    }
    build(answer);
    return 1;
}

Compilation message

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

Subtask #1
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Runtime error	1 ms	384 KB	Execution killed with signal 11
3	Halted	0 ms	0 KB	-

Subtask #2
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Runtime error	1 ms	384 KB	Execution killed with signal 11
3	Halted	0 ms	0 KB	-

Subtask #3
0 / 19.0

#	Verdict	Execution time	Memory	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	Runtime error	1 ms	384 KB	Execution killed with signal 11
5	Halted	0 ms	0 KB	-