Submission #437005

#TimeUsernameProblemLanguageResultExecution timeMemory
437005PiejanVDCKeys (IOI21_keys)C++17
Compilation error
0 ms0 KiB
#include "keys.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> find_reachable(vector<int> r, vector<int> u, vector<int> v, vector<int> c) {
    int n = r.size(), m = u.size();
    vector<pair<int,int>>adj[n];
    for(int i = 0 ; i < m ; i++) {
        adj[u[i]].push_back({v[i],i});
        adj[v[i]].push_back({u[i],i});
    }
    int mn=INT_MAX;
    vector<int>mini;
    vector<bitset<n>>vis;
    //vector<vector<bool>>vis(n,vector<bool>(n,false));
    for(int i = 0 ; i < n ; i++) {
        vector<bool>keys(n,false);
        queue<int>q;
        q.push(i);
        bool change=true;
        while(change && !q.empty()) {
        vector<int>restore;
            change=false;
            int sz = q.size();
            while(sz--) {
                int node = q.front();
                q.pop();
                keys[r[node]]=true;
                restore.push_back(node);
                if(!vis[i][node]) {
                    for(int j = 0 ; j < n ; j++) {
                        if(vis[node][j]) {
                            vis[i][j]=true;
                            keys[r[j]]=true;
                        }
                    }
                    vis[i][node]=true;
                }
                for(auto z : adj[node]) {
                    if(keys[c[z.second]] && !vis[i][z.first]) {
                        change=true;
                        q.push(z.first);
                    }
                }
            }
         for(auto z : restore) q.push(z);
        }
    int curr=0;
    for(auto z : vis[i]) curr+=z;
     if(curr < mn) {
        mini.clear();
        mini.push_back(i);
        mn=curr;
     } else if(curr == mn) mini.push_back(i);
    }
    vector<int>ans(n,0);
    for(auto z : mini) ans[z]=1;
    return ans;
}

Compilation message (stderr)

keys.cpp: In function 'std::vector<int> find_reachable(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
keys.cpp:14:19: error: the value of 'n' is not usable in a constant expression
   14 |     vector<bitset<n>>vis;
      |                   ^
keys.cpp:6:9: note: 'int n' is not const
    6 |     int n = r.size(), m = u.size();
      |         ^
keys.cpp:14:19: note: in template argument for type 'long unsigned int'
   14 |     vector<bitset<n>>vis;
      |                   ^
keys.cpp:14:20: error: template argument 1 is invalid
   14 |     vector<bitset<n>>vis;
      |                    ^~
keys.cpp:14:20: error: template argument 2 is invalid
keys.cpp:30:24: error: invalid types 'int[int]' for array subscript
   30 |                 if(!vis[i][node]) {
      |                        ^
keys.cpp:32:31: error: invalid types 'int[int]' for array subscript
   32 |                         if(vis[node][j]) {
      |                               ^
keys.cpp:33:32: error: invalid types 'int[int]' for array subscript
   33 |                             vis[i][j]=true;
      |                                ^
keys.cpp:37:24: error: invalid types 'int[int]' for array subscript
   37 |                     vis[i][node]=true;
      |                        ^
keys.cpp:40:49: error: invalid types 'int[int]' for array subscript
   40 |                     if(keys[c[z.second]] && !vis[i][z.first]) {
      |                                                 ^
keys.cpp:49:21: error: invalid types 'int[int]' for array subscript
   49 |     for(auto z : vis[i]) curr+=z;
      |                     ^