Submission #657348

#	Time	Username	Problem	Language	Result	Execution time	Memory
657348		ssense	Connecting Supertrees (IOI20_supertrees)	C++14	100 / 100	180 ms	24060 KiB

supertrees

#include <bits/stdc++.h>
#include "supertrees.h"
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
typedef long long  ll;
using namespace std;
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define MXL 1000000000000000000
#define PI (ld)2*acos(0.0)
#define pb push_back
#define sc second
#define fr first
#define endl '\n'
#define ld long double
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}struct prefix_sum{vint pref;void build(vint a){pref.pb(0);for(int i = 0; i < a.size(); i++){pref.pb(pref.back()+a[i]);}}int get(int l, int r){return pref[r]-pref[l-1];}};//mesanu

int par[1005];
int sz[1005];

void init(int n)
{
    for(int i = 0; i < n; i++)
    {
        par[i] = i;
        sz[i] = 1;
    }
}

int find(int v) {
    if (v == par[v])
        return v;
    return par[v] = find(par[v]);
}

void usets(int a, int b) {
    a = find(a);
    b = find(b);
    if (a != b) {
        if (sz[a] < sz[b])
            swap(a, b);
        par[b] = a;
        sz[a] += sz[b];
    }
}


int construct(vector<vector<int>> p)
{
    int n = (int)p.size();
    init(1000);
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < n; j++)
        {
            if(p[i][j] == 1)
            {
                usets(i, j);
            }
            if(p[i][j] == 3)
            {
                return 0;
            }
        }
    }
    vector<int> sets(n);
    for(int i = 0; i < n; i++)
    {
        sets[i] = find(i);
    }
    for(int i = 0; i < n; i++)
    {
        int cnt_2 = 0;
        for(int j = 0; j < n; j++)
        {
            if(p[i][j] == 2)
            {
                cnt_2++;
            }
            if(p[i][i] != 1)
            {
                return 0;
            }
            if(p[i][j] == 0 && sets[i] == sets[j])
            {
                return 0;
            }
            if(p[i][j] == 2 && sets[i] == sets[j])
            {
                return 0;
            }
        }
        if(cnt_2 == 1)
        {
            return 0;
        }
    }
    vector<vector<int>> answer(n, vector<int>(n));
    vector<bool> vis(n, false);
    for(int i = 0; i < n; i++)
    {
        int now = i;
        while(!vis[now])
        {
            vis[now] = true;
            if(now == par[now])
            {
                break;
            }
            answer[now][par[now]] = 1;
            answer[par[now]][now] = 1;
            now = par[now];
        }
    }
    vector<bool> incycle(n, false);
    for(int i = 0; i < n; i++)
    {
        set<int> cycle_now;
        int now = sets[i];
        if(incycle[now])
        {
            continue;
        }
        cycle_now.insert(now);
        incycle[now] = true;
        for(int j = 0; j < n; j++)
        {
            if(p[i][j] == 2)
            {
                cycle_now.insert(sets[j]);
                incycle[sets[j]] = true;
            }
        }
        if(cycle_now.size() > 2)
        {
            auto it = cycle_now.end();
            it--;
            int last = *it;
            for(auto x : cycle_now)
            {
                answer[x][last] = 1;
                answer[last][x] = 1;
                usets(x, last);
                last = x;
            }
        }
    }
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < n; j++)
        {
            if(p[i][j] == 0 && find(i) == find(j))
            {
                return 0;
            }
            if(p[i][j] == 2 && find(i) != find(j))
            {
                return 0;
            }
        }
    }
    build(answer);
    return 1;
}

Compilation message (stderr)

supertrees.cpp: In member function 'void prefix_sum::build(std::vector<int>)':
supertrees.cpp:20:667: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 | int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}struct prefix_sum{vint pref;void build(vint a){pref.pb(0);for(int i = 0; i < a.size(); i++){pref.pb(pref.back()+a[i]);}}int get(int l, int r){return pref[r]-pref[l-1];}};//mesanu
      |                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                         ~~^~~~~~~~~~

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