Submission #1066920

#	Time	Username	Problem	Language	Result	Execution time	Memory
1066920		Muhammad_Aneeq	늑대인간 (IOI18_werewolf)	C++17	7 / 100	4065 ms	30328 KiB

werewolf

#include <vector>
#include <queue>
#include <iostream>
#include <algorithm>
using namespace std;
int const N=2e5+10;
vector<int>nei[N]={};
bool reach[N]={};
bool bfs(int u,int v,int l,int r)
{
    queue<pair<int,int>>Q;
    Q.push({0,u});
    reach[u]=1;
    while (Q.size())
    {
        int city,form;
        tie(form,city)=Q.front();
        Q.pop();
        for (auto j:nei[city])
        {
            if (city<l&&j>r)
                continue;
            if (city>r&&j<l)
                continue;
            if (reach[j])
                continue;
            if (j>r&&form==1)
                continue;
            if (j<l)
                Q.push({1,j});
            else if (j>r)
                Q.push({0,j});
            else
                Q.push({form,j});
            reach[j]=1;
        }
    }
    return reach[v];
}
vector<int> check_validity(int N, vector<int> X, vector<int> Y,vector<int> S, vector<int> E,vector<int> L, vector<int> R)
{
    for (int i=0;i<X.size();i++)
    {
        nei[X[i]].push_back(Y[i]);
        nei[Y[i]].push_back(X[i]);
    }
    vector<int>ans;
    for (int i=0;i<S.size();i++)
    {
        ans.push_back(bfs(S[i],E[i],L[i],R[i]));
        for (int j=0;j<N;j++)
            reach[j]=0;
    }
    return ans;
}

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:42:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |     for (int i=0;i<X.size();i++)
      |                  ~^~~~~~~~~
werewolf.cpp:48:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |     for (int i=0;i<S.size();i++)
      |                  ~^~~~~~~~~

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