Submission #835362

#	Time	Username	Problem	Language	Result	Execution time	Memory
835362		mousebeaver	Werewolf (IOI18_werewolf)	C++14	15 / 100	4027 ms	35924 KiB

werewolf

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

void dfs(int l, int r, vector<vector<int>>& adjlist, int i, vector<bool>& visited)
{
    visited[i] = true;
    for(int j : adjlist[i])
    {
        if(!visited[j] && l <= j && j <= r)
        {
            dfs(l, r, adjlist, j, visited);
        }
    }
}

std::vector<int> check_validity(int N, std::vector<int> X, std::vector<int> Y, std::vector<int> S, std::vector<int> E, std::vector<int> L, std::vector<int> R) 
{
    if(N <= 3000 && (int) X.size() <= 6000 && (int) S.size() <= 3000)
    {
        int n = N;
        vector<vector<int>> adjlist(n, vector<int> (0));
        for(int i = 0; i < (int) X.size(); i++)
        {
            int a = X[i];
            int b = Y[i];
            adjlist[a].push_back(b);
            adjlist[b].push_back(a);
        }

        vector<int> output(S.size());
        for(int t = 0; t < (int) S.size(); t++)
        {
            int l = L[t];
            int r = R[t];
            int s = S[t];
            int e = E[t];

            vector<bool> visited(n, false);
            dfs(l, numeric_limits<int>::max()/2, adjlist, s, visited);
            for(int i = 0; i < n; i++)
            {
                if(visited[i] && l <= i && i <= r)
                {
                    dfs(0, r, adjlist, i, visited);
                }
            }
            output[t] = visited[e];
        }
        return output;
    }
}

Compilation message (stderr)

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

• Subtask 1: 7 / 7
• Subtask 2: 8 / 8
• Subtask 3: 0 / 34
• Subtask 4: 0 / 51