Submission #301415

#	Time	Username	Problem	Language	Result	Execution time	Memory
301415		cuom1999	Connecting Supertrees (IOI20_supertrees)	C++14	46 / 100	261 ms	30200 KiB

supertrees

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


struct Solver {
    int n;
    vector<bool> vs;
    vector<int> lineIndex;
    vector<vector<int>> p, line, cycle;

    Solver(vector<vector<int>> p): p(p), n(p.size()) {
        vs.resize(n);
        lineIndex.resize(n);
        line.resize(n);
        cycle.resize(n);
    }

    void dfs1(int a, int c) {
        if (vs[a]) return;
        vs[a] = 1;
        lineIndex[a] = c;
        line[c].push_back(a);

        for (int i = 0; i < n; i++) {
            if (p[a][i] == 1) dfs1(i, c);
        }
    }

    void dfs2(int a, int c) {
        if (vs[a]) return;
        vs[a] = 1;
        cycle[c].push_back(a);

        for (int i = 0; i < n; i++) {
            if (p[a][i] == 2) dfs2(i, c);
        }
    }

    int solve() {
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                if (p[i][j] == 3) return 0;
            }
        }

        for (int i = 0; i < n; i++) {
            if (!vs[i]) dfs1(i, i);
        }

        for (int i = 0; i < n; i++) {
            if (lineIndex[i] == i) vs[i] = 0;
        }

        for (int i = 0; i < n; i++) {
            if (!vs[i]) dfs2(i, i);
        }

        // construct res
        vector<vector<int>> res(n, vector<int>(n));

        for (int i = 0; i < n; i++) {
            for (int j = 0; j + 1 < line[i].size(); j++) {
                int x = line[i][j], y = line[i][j + 1];
                res[x][y] = res[y][x] = 1;
            }

            if (cycle[i].size() > 1) cycle[i].push_back(cycle[i][0]);
            for (int j = 0; j + 1 < cycle[i].size(); j++) {
                int x = cycle[i][j], y = cycle[i][j + 1];
                res[x][y] = res[y][x] = 1;
            }
        }

        build(res);
        // for (int i = 0; i < n; i++) {
        //     cout << lineIndex[i] << " ";
        // }
        // cout << endl;

        // for (int i = 0; i < n; i++) {
        //     if (cycle[i].size()) {
        //         for (auto j: cycle[i]) cout << j << " ";
        //         cout << endl;
        //     }
        // }

        return 1;
    }
};


int construct(vector<vector<int>> p) {
    return Solver(p).solve();
}

Compilation message (stderr)

supertrees.cpp: In constructor 'Solver::Solver(std::vector<std::vector<int> >)':
supertrees.cpp:10:25: warning: 'Solver::p' will be initialized after [-Wreorder]
   10 |     vector<vector<int>> p, line, cycle;
      |                         ^
supertrees.cpp:7:9: warning:   'int Solver::n' [-Wreorder]
    7 |     int n;
      |         ^
supertrees.cpp:12:5: warning:   when initialized here [-Wreorder]
   12 |     Solver(vector<vector<int>> p): p(p), n(p.size()) {
      |     ^~~~~~
supertrees.cpp: In member function 'int Solver::solve()':
supertrees.cpp:63:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |             for (int j = 0; j + 1 < line[i].size(); j++) {
      |                             ~~~~~~^~~~~~~~~~~~~~~~
supertrees.cpp:69:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |             for (int j = 0; j + 1 < cycle[i].size(); j++) {
      |                             ~~~~~~^~~~~~~~~~~~~~~~~

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