Submission #666906

#TimeUsernameProblemLanguageResultExecution timeMemory
666906YENGOYANConnecting Supertrees (IOI20_supertrees)C++17
11 / 100
188 ms22072 KiB
#include "supertrees.h" #include <vector> using namespace std; vector<int> par, sizes; int get(int u){ if(par[u] == u) return u; return par[u] = get(par[u]); } bool areInOne(int u, int v){ return get(u) == get(v); } void union_sets(int u, int v){ int a = get(u), b = get(v); if(a == b) return; if(sizes[a] < sizes[b]) swap(a, b); sizes[a] += sizes[b]; par[b] = a; } vector<int> comp; void dfs(int u, vector<vector<int>> &gp, vector<bool> &vis){ comp.push_back(u); vis[u] = 1; for(int &v : gp[u]){ if(!vis[v]){ dfs(v, gp, vis); } } } int construct(vector<vector<int>> p) { int n = p.size(); vector<vector<int>> gp(n, vector<int> (n)); par = sizes = vector<int> (n); for(int i = 0; i < n; i++) par[i] = i, sizes[i] = 1; vector<int> vec; for(int i = 0; i < n; i++){ for(int j = i + 1; j < n; j++){ if(!areInOne(i, j) && p[i][j] == 1){ gp[i][j] = gp[j][i] = 1; union_sets(i, j); vec.push_back(i); vec.push_back(j); } } } vector<vector<int>> graph(n); for(int i = 0; i < n; i++){ for(int j = i + 1; j < n; j++){ if(p[i][j] == 2) { graph[i].push_back(j); graph[j].push_back(i); } } } vector<bool> vis(n); for(int i = 0; i < vec.size(); i++){ int u = vec[i]; comp.clear(); dfs(u, graph, vis); for(int i = 0; i < comp.size() - 1; i++){ gp[comp[i]][comp[i + 1]] = gp[comp[i + 1]][comp[i]] = 1; } } build(gp); return 1; }

Compilation message (stderr)

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:66:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |     for(int i = 0; i < vec.size(); i++){
      |                    ~~^~~~~~~~~~~~
supertrees.cpp:70:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |         for(int i = 0; i < comp.size() - 1; i++){
      |                        ~~^~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...