Submission #526957

#	Time	Username	Problem	Language	Result	Execution time	Memory
526957		Olympia	Connecting Supertrees (IOI20_supertrees)	C++17	75 / 100	219 ms	22428 KiB

supertrees

#include <cmath>
#include <cassert>
#include <iostream>
#include <set>
#include <climits>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <type_traits>
#include <string>
#include <queue>
#include <map>
#include "supertrees.h"

#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("Ofast")
#pragma GCC optimization ("unroll-loops")

using namespace std;

class DisjointSetUnion {
protected:
    vector<int> parent;
    vector<int> compSize;
    const int n;
    int connectedComponents;
public:
    int getConnectedComponents() const {
        return connectedComponents;
    }

public:
    DisjointSetUnion(int sz) : n(sz), connectedComponents(sz) {
        parent.resize(sz), compSize.resize(sz);
        for (int i = 0; i < n; i++) {
            parent[i] = i, compSize[i] = 1;
        }
    }

    int find_head(int x) const {
        int cur = x;
        while (cur != parent[cur]) {
            cur = parent[cur];
        }
        return cur;
    }

    void join(int x, int y) {
        x = find_head(x);
        y = find_head(y);
        if (x == y) {
            return;
        }
        if (compSize[x] > compSize[y]) {
            swap(x, y);
            //ensures that compSize[x1] <= compSize[y1]
        }
        parent[x] = y;
        compSize[y] += compSize[x];
        connectedComponents--;
    }

    bool comp(int x, int y) {
        return (find_head(x) == find_head(y));
    }
};


/*
void build (vector<vector<int>> grid) {
    for (int i = 0; i < grid.size(); i++) {
        for (int j: grid[i]) {
            cout << j << ' ';
        }
        cout << '\n';
    }
}
*/


int construct (vector<vector<int>> grid) {
    vector<vector<int>> ans(grid.size());
    for (int i = 0; i < grid.size(); i++) {
        ans[i].assign(grid[0].size(), 0);
    }
    set<int> s;
    map<int,int> cnt;
    DisjointSetUnion disjointSetUnion(grid.size());
    for (int i = 0; i < grid.size(); i++) {
        for (int j = 0; j < grid.size(); j++) {
            s.insert(grid[i][j]);
            cnt[grid[i][j]]++;
            if (grid[i][j] != 0) {
                disjointSetUnion.join(i, j);
            }
        }
    }
    map<int,vector<int>> myMap;
    for (int i = 0; i < grid.size(); i++) {
        myMap[disjointSetUnion.find_head(i)].push_back(i);
    }
    if (cnt[2] == 0 && cnt[3] == 0) {
        for (auto& p: myMap) {
            vector<int> v = p.second;
            for (int i = 1; i < (int)v.size(); i++) {
                ans[v[i]][v[0]] = 1;
                ans[v[0]][v[i]] = 1;
            }
            for (int x: v) {
                for (int y: v) {
                    if (grid[x][y] != 1) return false;
                }
            }
        }
        build(ans);
        return 1;
    }
    if (cnt[0] >= 0 && cnt[1] == (int)grid.size() && cnt[2] >= 0 && cnt[3] == 0) {
        for (auto& p: myMap) {
            vector<int> v = p.second;
            if (v.size() == 2) {
                return 0;
            }
            if (v.size() <= 1) {
                continue;
            }
            for (int i = 1; i < (int)v.size(); i++) {
                ans[v[i]][v[i - 1]] = 1;
                ans[v[i - 1]][v[i]] = 1;
            }
            ans[v[0]][v.back()] = ans[v.back()][v[0]] = 1;
            for (int x: v) {
                for (int y: v) {
                    if (grid[x][y] == 0) {
                        return 0;
                    }
                }
            }
        }
        build(ans);
        return 1;
    }
    if (cnt[0] >= 0 && cnt[1] > 0 && cnt[2] > 0 && cnt[3] == 0) {
        //cout << "YES\n";
        for (auto& p: myMap) {
            DisjointSetUnion dsu(grid.size());
            map<int,vector<int>> m;
            for (int x: p.second) {
                for (int y: p.second) {
                    if (grid[x][y] == 1) {
                        dsu.join(x, y);
                    }
                }
            }
            for (int i: p.second) {
                m[dsu.find_head(i)].push_back(i);
            }
            vector<int> vec;
            for (auto& q: m) {
                vec.push_back(q.first);
            }
            if (vec.size() != 1) {
                for (int i = 0; i < vec.size(); i++) {
                    ans[vec[i]][vec[(i + 1) % (int) vec.size()]] = ans[vec[(i + 1) % (int) vec.size()]][vec[i]] = 1;
                }
            }
            for (int x: vec) {
                for (int y: vec) {
                    if (grid[x][y] == 0) {
                        return false;
                    }
                }
            }
            for (auto& q: m) {
                vector<int> v = q.second;
                for (int i: v) {
                    for (int j: v) {
                        if (grid[i][j] == 0) {
                            return false;
                        }
                    }
                }
                for (int i = 1; i < (int)v.size(); i++) {
                    ans[v[i]][v[0]] = 1;
                    ans[v[0]][v[i]] = 1;
                }
                for (int x: v) {
                    for (int y: v) {
                        if (grid[x][y] != 1) {
                            return 0;
                        }
                    }
                }
            }

        }
        build(ans);
        return 1;
    }

}

/*
int main () {
    const int N = 7;
    vector<vector<int>> grid = {{1, 2, 2, 2, 0, 0, 0, 0, 0, 2},{2, 1, 2, 2, 0, 0, 0, 0, 0, 2},{2, 2, 1, 2, 0, 0, 0, 0, 0, 2},{2, 2, 2, 1, 0, 0, 0, 0, 0, 2},{0, 0, 0, 0, 1, 1, 0, 1, 1, 0},{0, 0, 0, 0, 1, 1, 0, 1, 1, 0},{0, 0, 0, 0, 0, 0, 1, 0, 0, 0},{0, 0, 0, 0, 1, 1, 0, 1, 1, 0},{0, 0, 0, 0, 1, 1, 0, 1, 1, 0},{2, 2, 2, 2, 0, 0, 0, 0, 0, 1}};
    construct(grid);
}

*/

Compilation message (stderr)

supertrees.cpp:16: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   16 | #pragma GCC optimization ("O3")
      | 
supertrees.cpp:17: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   17 | #pragma GCC optimization ("Ofast")
      | 
supertrees.cpp:18: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
   18 | #pragma GCC optimization ("unroll-loops")
      | 
supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:84:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |     for (int i = 0; i < grid.size(); i++) {
      |                     ~~^~~~~~~~~~~~~
supertrees.cpp:90:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |     for (int i = 0; i < grid.size(); i++) {
      |                     ~~^~~~~~~~~~~~~
supertrees.cpp:91:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |         for (int j = 0; j < grid.size(); j++) {
      |                         ~~^~~~~~~~~~~~~
supertrees.cpp:100:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  100 |     for (int i = 0; i < grid.size(); i++) {
      |                     ~~^~~~~~~~~~~~~
supertrees.cpp:164:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  164 |                 for (int i = 0; i < vec.size(); i++) {
      |                                 ~~^~~~~~~~~~~~
supertrees.cpp:83:40: warning: control reaches end of non-void function [-Wreturn-type]
   83 |     vector<vector<int>> ans(grid.size());
      |                                        ^

• Subtask 1: 11 / 11
• Subtask 2: 10 / 10
• Subtask 3: 19 / 19
• Subtask 4: 35 / 35
• Subtask 5: 0 / 21
• Subtask 6: 0 / 4