Submission #416050

#	Time	Username	Problem	Language	Result	Execution time	Memory
416050		duality	Connecting Supertrees (IOI20_supertrees)	C++14	100 / 100	268 ms	24128 KiB

supertrees

#define DEBUG 0

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

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------
#include "supertrees.h"

int com1[1000],com2[1000],r[1000];
vi vv[1000];
int construct(vector<vector<int> > p) {
    int i,j,n = p.size();
    int c1 = 0,c2 = 0;
    for (i = 0; i < n; i++) {
        for (j = 0; j < i; j++) {
            if (p[i][j] == 3) return 0;
            if (p[i][j] > 0) {
                com1[i] = com1[j];
                break;
            }
        }
        if (j == i) com1[i] = c1++;
        for (j = 0; j < i; j++) {
            if (p[i][j] == 1) {
                com2[i] = com2[j];
                break;
            }
        }
        if (j == i) com2[i] = c2++,vv[com1[i]].pb(i),r[c2-1] = i;
        for (j = 0; j < i; j++) {
            if ((com1[i] == com1[j]) == (p[i][j] == 0)) return 0;
            if ((com2[i] == com2[j]) != (p[i][j] == 1)) return 0;
        }
    }
    vector<vi> b(n,vi(n,0));
    for (i = 0; i < n; i++) {
        if (r[com2[i]] != i) b[i][r[com2[i]]] = b[r[com2[i]]][i] = 1;
    }
    for (i = 0; i < c1; i++) {
        if (vv[i].size() == 2) return 0;
        else if (vv[i].size() > 1) {
            for (j = 0; j < vv[i].size(); j++) {
                b[vv[i][j]][vv[i][(j+1) % vv[i].size()]] = 1;
                b[vv[i][(j+1) % vv[i].size()]][vv[i][j]] = 1;
            }
        }
    }
    build(b);
    return 1;
}

Compilation message (stderr)

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

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