Submission #1157121

#	Time	Username	Problem	Language	Result	Execution time	Memory
1157121		LolkasMeep	September (APIO24_september)	C++20	Compilation error	0 ms	0 KiB

september

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

typedef long long int ll;

int dsuParents[100005];
int dsuSizes[100005];
    
int getParent(int node){
    if(dsuParents[node] = node) return node;
    dsuParents[node] = getParent(dsuParents[node]);
    return dsuParents[node];
}

void createNode(int node){
    dsuParents[node] = node;
    dsuSizes[node] = 1;
}

bool merge(int a, int b){
    int pA = getParent(a);
    int pB = getParent(b);
    if (pA == pB) return false;
    if(dsuSizes[pA] > dsuSizes[pB]) swap(pA, pB);
    dsuParents[pA] = pB;
    dsuSizes[pB] += dsuSizes[pA];
    return true;
}

int solveM(int N, vector<int> &F, vector<int> S), vector<unordered_set<int>> &adjList;{
    for(int i=0;i<100005;i++){
        dsuParents[i]=-1;
        dsuSizes[i]=0;
    }

    bool visited[100005];

    visited[0] = true;

    int components = 1;
    for(int i = S.size() - 1; i >= 0; i--){
        components++;

        for(int node : adjList[S[i]]){
            if(visited[node] && merge(S[i], node)) components--;
        }

        visited[S[i]] = true;
    }
}


int solve(int N, int M, vector<int> F,vector<vector<int>> S){
    int minSize = 99999999;
    vector<unordered_set<int>> adjList;
    adjList.resize();
    for(int i = 1; i < N; i++){
        adjList[i].insert(F[i]);
        adjList[F[i]].insert(i);
    }

    for(int j = 0; j < M; j++) minSize = min(minSize, solveM(N, F, S[j], adjList));

    return minSize;
}

Compilation message (stderr)

september.cpp:30:78: error: invalid declarator before '&' token
   30 | int solveM(int N, vector<int> &F, vector<int> S), vector<unordered_set<int>> &adjList;{
      |                                                                              ^
september.cpp:30:87: error: expected unqualified-id before '{' token
   30 | int solveM(int N, vector<int> &F, vector<int> S), vector<unordered_set<int>> &adjList;{
      |                                                                                       ^
september.cpp: In function 'int solve(int, int, std::vector<int>, std::vector<std::vector<int> >)':
september.cpp:56:19: error: no matching function for call to 'std::vector<std::unordered_set<int> >::resize()'
   56 |     adjList.resize();
      |     ~~~~~~~~~~~~~~^~
In file included from /usr/include/c++/11/vector:67,
                 from /usr/include/c++/11/functional:62,
                 from /usr/include/c++/11/pstl/glue_algorithm_defs.h:13,
                 from /usr/include/c++/11/algorithm:74,
                 from /usr/include/x86_64-linux-gnu/c++/11/bits/stdc++.h:65,
                 from september.cpp:1:
/usr/include/c++/11/bits/stl_vector.h:937:7: note: candidate: 'void std::vector<_Tp, _Alloc>::resize(std::vector<_Tp, _Alloc>::size_type) [with _Tp = std::unordered_set<int>; _Alloc = std::allocator<std::unordered_set<int> >; std::vector<_Tp, _Alloc>::size_type = long unsigned int]'
  937 |       resize(size_type __new_size)
      |       ^~~~~~
/usr/include/c++/11/bits/stl_vector.h:937:7: note:   candidate expects 1 argument, 0 provided
/usr/include/c++/11/bits/stl_vector.h:957:7: note: candidate: 'void std::vector<_Tp, _Alloc>::resize(std::vector<_Tp, _Alloc>::size_type, const value_type&) [with _Tp = std::unordered_set<int>; _Alloc = std::allocator<std::unordered_set<int> >; std::vector<_Tp, _Alloc>::size_type = long unsigned int; std::vector<_Tp, _Alloc>::value_type = std::unordered_set<int>]'
  957 |       resize(size_type __new_size, const value_type& __x)
      |       ^~~~~~
/usr/include/c++/11/bits/stl_vector.h:957:7: note:   candidate expects 2 arguments, 0 provided
september.cpp:62:61: error: too many arguments to function 'int solveM(int, std::vector<int>&, std::vector<int>)'
   62 |     for(int j = 0; j < M; j++) minSize = min(minSize, solveM(N, F, S[j], adjList));
      |                                                       ~~~~~~^~~~~~~~~~~~~~~~~~~~~
september.cpp:30:5: note: declared here
   30 | int solveM(int N, vector<int> &F, vector<int> S), vector<unordered_set<int>> &adjList;{
      |     ^~~~~~