Submission #315374

#	Time	Username	Problem	Language	Result	Execution time	Memory
315374		nickmet2004	Connecting Supertrees (IOI20_supertrees)	C++14	Compilation error	0 ms	0 KiB

supertrees

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

const int N = 1005;
int n , p[N][N], cmp[N] , ch[N] , vis[N] , ans[N][N];
vector<int> E[N] , Q;
void construct(vector<vector<int>> p){
    int n = p.size();
    for(int i = 0; i< n; ++i) for(int j = 0; j< n; ++j) if(p[i][j] == 3 || p[i][j] != p[j][i]) return 0;
    int cnt = 0;
    for(int i = 0; i < n; ++i){
        if(cmp[i]) continue;
        cmp[i] = ++cnt;
        for(int j = 0; j < n; ++j) if(p[i][j])cmp[j] = cmp[i];
    }
    /// components
    for(int i = 0; i < n; ++i) for(int j = 0; j < n; ++j) if(cmp[i] != cmp[j] && p[i][j])return 0;
    cnt =0;
    for(int i= 0; i < n; ++i){
        if(ch[i])continue;
        ch[i] = ++cnt;
        for(int j = 0; j< n; ++j) if(p[i][j] == 1) E[i].emplace_back(j) , ch[j] = ch[i];
    }
    /// determine double cycles
    for(int i = 0; i < n; ++i) for(int j = 0; j < n; ++j) if(ch[i] != ch[j] && p[i][j] == 1)return 0;
    for(int i = 0; i < n; ++i){
        if(!E[i].size())continue;
        Q.emplace_back(i);
        for(int j : E[i]) ans[i][j] = ans[j][i] = 1;
    }
    /// make a cycle
    for(int i : Q){
        if(vis[i])continue;
        vector<int> a;
        for(int j : Q){
            if(p[i][j]) a.emplace_back(j) , vis[j] = 1;
        }
        if(a.size() == 2) return 0;
        if(a.size() == 1)continue;
        for(int k = 0; k < a.size(); ++k){
            int X = a[k] , Y = a[(k + 1) % a.size()];
            ans[X][Y] = ans[Y][X]= 1;
        }
    }
    build(ans);
}

Compilation message (stderr)

supertrees.cpp:8:6: error: ambiguating new declaration of 'void construct(std::vector<std::vector<int> >)'
    8 | void construct(vector<vector<int>> p){
      |      ^~~~~~~~~
In file included from supertrees.cpp:2:
supertrees.h:3:5: note: old declaration 'int construct(std::vector<std::vector<int> >)'
    3 | int construct(std::vector<std::vector<int>> p);
      |     ^~~~~~~~~
supertrees.cpp: In function 'void construct(std::vector<std::vector<int> >)':
supertrees.cpp:10:103: error: return-statement with a value, in function returning 'void' [-fpermissive]
   10 |     for(int i = 0; i< n; ++i) for(int j = 0; j< n; ++j) if(p[i][j] == 3 || p[i][j] != p[j][i]) return 0;
      |                                                                                                       ^
supertrees.cpp:18:97: error: return-statement with a value, in function returning 'void' [-fpermissive]
   18 |     for(int i = 0; i < n; ++i) for(int j = 0; j < n; ++j) if(cmp[i] != cmp[j] && p[i][j])return 0;
      |                                                                                                 ^
supertrees.cpp:26:100: error: return-statement with a value, in function returning 'void' [-fpermissive]
   26 |     for(int i = 0; i < n; ++i) for(int j = 0; j < n; ++j) if(ch[i] != ch[j] && p[i][j] == 1)return 0;
      |                                                                                                    ^
supertrees.cpp:39:34: error: return-statement with a value, in function returning 'void' [-fpermissive]
   39 |         if(a.size() == 2) return 0;
      |                                  ^
supertrees.cpp:41:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |         for(int k = 0; k < a.size(); ++k){
      |                        ~~^~~~~~~~~~
supertrees.cpp:46:11: error: could not convert '(int (*)[1005])(& ans)' from 'int (*)[1005]' to 'std::vector<std::vector<int> >'
   46 |     build(ans);
      |           ^~~
      |           |
      |           int (*)[1005]