Submission #314139

#	Time	Username	Problem	Language	Result	Execution time	Memory
314139		lukameladze	Connecting Supertrees (IOI20_supertrees)	C++14	0 / 100	15 ms	14720 KiB

supertrees

#include "supertrees.h"
#include <bits/stdc++.h>
using namespace std;
long long par[300005],a,bb,n,fix[300005];
int pa,sh;
//std::vector <std::vector <int> >  ans;
std::vector <long long> v[300005],v1;
int get_col(int a)
{
    if (par[a]==a) return a;
    par[a]=get_col(par[a]);
    return par[a];
}
void col(int a, int b)
{
    a=get_col(a);
    b=get_col(b);
    par[a]=b;
}
int construct(std::vector <std::vector <int> > p)
{
     n=p.size();
     for (int i=0; i<n; i++)
     {
          par[i]=i;
     }
     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++)
    {
          for (int j=0; j<n; j++)
          {
               if (p[i][j]) col(i,j);
          }
     }
     for (int i=0; i<n; i++)
     {
         for (int j=0; j<n; j++)
         {
             if (get_col(i)==get_col(j) && !p[i][j]) return 0;
         }
     }
     
     for (int i=0; i<n;i++)
     {
          v[get_col(i)].push_back(i);
     }
     for (int i=0; i<n; i++)
     {
        if (!fix[get_col(i)])
        {
            v1.push_back(get_col(i)); 
            fix[get_col(i)]=1;              
        }
     }
     
    std:: vector < std::vector < int > > ans(n, std::vector < int >(n, 0));
     for (int i=0; i<v1.size(); i++)
     {
         pa=v1[i];
         for (int j=0; j<v[pa].size(); j++)
         {
             sh=v[pa][j];
             if (sh!=pa)
             {
             ans[sh][pa]=1;
             ans[pa][sh]=1;
             }
         }
     }
     build(ans);
}*/

Compilation message (stderr)

supertrees.cpp: In function 'int construct(std::vector<std::vector<int> >)':
supertrees.cpp:35:1: warning: control reaches end of non-void function [-Wreturn-type]
   35 | }
      | ^

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