Submission #825095

#	Time	Username	Problem	Language	Result	Execution time	Memory
825095		Marco_Escandon	Connecting Supertrees (IOI20_supertrees)	C++17	21 / 100	168 ms	24004 KiB

supertrees

    #include "supertrees.h"
    #include <vector>
    #include<bits/stdc++.h>
    using namespace std;
    struct st
    {
        vector<int> cad;
        int findf(int a)
        {
            if(a==cad[a])return a;
            else return cad[a]=findf(cad[a]);
        }
        void unionf(int a, int b){
            a=findf(a);
            b=findf(b);
            if(a!=b){
                cad[a]=b;
            }
        }
        st(int n){
            cad.resize(2*n);
            for(int i=0; i<cad.size(); i++)
                cad[i]=i;
        }
    };
    int construct(std::vector<std::vector<int>> cad) {
    	int n = cad.size();
    	std::vector<std::vector<int>> answer(n,vector<int>(n,0LL));
    	st asdfg(n+1);
    	for(int i=0; i<n; i++)
            for(int j=0; j<n; j++)
                if(cad[i][j]!=0&&i!=j)
                    asdfg.unionf(i,j);
        for(int i=0; i<n; i++)
            for(int j=0; j<n; j++)
                if(cad[i][j]==0&&asdfg.findf(i)==asdfg.findf(j)&&i!=j)
                    return 0;
        st asd(n+1);
    	for(int i=0; i<n; i++)
            for(int j=0; j<n; j++)
                if(cad[i][j]==1&&i!=j)
                    asd.unionf(i,j);
        for(int i=0; i<n; i++)
            for(int j=0; j<n; j++)
            {
                if(cad[i][j]==2&&asd.findf(i)==asd.findf(j)&&i!=j)
                    return 0;
                if(asd.cad[i]==j&&i!=j)
                {
                    answer[i][j]=1;
                    answer[j][i]=1;
                }
                if(cad[i][j]==2&&asd.cad[i]==i&&asd.cad[j]==j)
                {
                    answer[i][j]=1;
                    answer[j][i]=1;
                }
            }
    	build(answer);
    	return 1;
    }

Compilation message (stderr)

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

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